notebook.community

Edit and run

List of theorems, proofs and algorithms

This is not an exhaustive list of examinable material. It is meant as a helpful page with hyperlinks to corresponds sections.

Theorems and proofs

  1. Best response condition
  2. Nash's theorem (proof not examinable)
  3. Theorem of sequence of stage Nash equiliria
  4. Steady state probabilities for match between reactive players
  5. General condition for evolutionary stability
  6. Fixation probabilities for the birth death process

Algorithms

  1. Support enumeration algorithm
  2. Vertex enumeration algorithm
  3. The Lemke Howson algorithm

Content source: drvinceknight/gt

Similar notebooks:

notebook.community | gallery | about