Oddness of the number of equilibrium points: A new proof

@article{Harsanyi1973OddnessOT,
  title={Oddness of the number of equilibrium points: A new proof},
  author={John C. Harsanyi},
  journal={International Journal of Game Theory},
  year={1973},
  volume={2},
  pages={235-250}
}
  • J. Harsanyi
  • Published 1 December 1973
  • Mathematics, Economics
  • International Journal of Game Theory
A new proof is offered for the theorem that, in “almost all” finite games, the number of equilibrium points isfinite andodd. The proof is based on constructing a one-parameter family of games with logarithmic payoff functions, and studying the topological properties of the graph of a certain algebraic function, related to the graph of the set of equilibrium points for the games belonging to this family. In the last section of the paper, it is shown that, in the space of all games of a given… 

Finding all Nash equilibria of a finite game using polynomial algebra

The set of Nash equilibria of a finite game is the set of nonnegative solutions to a system of polynomial equations. In this survey article, we describe how to construct certain special games and

On the genericity of the finite number of equilibria in multicriteria games: a counterexample

TLDR
It is shown that it is possible to find balls in the space of games such that every game in this set has uncountably many equilibria, which formalises the intuitive idea that games with uncountable sets ofEquilibria are not non-generic in the multicriteria case.

The structure of Nash equilibria in Poisson games

An Algebraic Approach for Computing Equilibria of a Subclass of Finite Normal Form Games

TLDR
This paper proposes a purely algebraic method for computing all Nash equilibria of these games that uses knowledge of Galois groups and presents some results, showing properties of the class of games, and an example to show working of the method.

On the Generic Finiteness of Equilibrium Outcome Distributions in Game Forms

Consider nonempty finite pure strategy sets S[subscript 1], . . . , S[subscript n], let S = S[subscript 1] times . . . times S[subscript n], let Omega be a finite space of "outcomes," let

Regularity and Stability of Equilibrium Points of Bimatrix Games

TLDR
It is proved that a bimatrix game with a convex equilibrium point set or with a finite number of equilibrium points has a regular equilibrium point, and it is shown that the class of all m × n-bim atrix games m, n ∈ N for which all the equilibrium points are regular, is an open and dense subset of the class.

On the Hardness and Existence of Quasi-Strict Equilibria

TLDR
It is proved that every symmetric multi-player game where each player has two actions at his disposal contains an efficiently computable quasi-strict equilibrium which may itself be asymmetric.

On the exponential rate of convergence of fictitious play in potential games

  • Brian SwensonS. Kar
  • Economics
    2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2017
TLDR
It is shown that in any regular potential game (and hence, in almost every potential game), FP converges to the set of Nash equilibria at an exponential rate from almost every initial condition.

A Globally Convergent Algorithm to Compute All Nash Equilibria for n-Person Games

TLDR
An algorithm to compute all Nash equilibria for generic finite n-person games in normal form that belongs to the class of homotopy-methods and can be easily implemented is presented.

Some Algebraic Properties of a Subclass of Finite Normal Form Games

TLDR
A method for computing all Nash equilibria of a subclass of finite normal form games and a method for deciding membership to the class of games with its related results are presented.
...

References

SHOWING 1-6 OF 6 REFERENCES

Computing Equilibria of N-Person Games

The algorithm of Lemke and Howson for finding an equilibrium of a 2-person game is extended to provide a constructive procedure for finding an equilibrium of an N-person game by finding in succession

Games with randomly disturbed payoffs: A new rationale for mixed-strategy equilibrium points

Equilibrium points in mixed strategies seem to be unstable, because any player can deviate without penalty from his equilibrium strategy even if he expects all other players to stick to theirs. This

The measure of the critical values of differentiable maps

of a region R of euclidean m-space into part of euclidean w-space. Suppose that each f unction ƒ' 0' = 1, • • • , n) is of class C in R (q^l). A critical point of the map (1.1) is a point in R at