On the genericity of the finite number of equilibria in multicriteria games: a counterexample (Q1635385)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the genericity of the finite number of equilibria in multicriteria games: a counterexample |
scientific article; zbMATH DE number 6881333
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the genericity of the finite number of equilibria in multicriteria games: a counterexample |
scientific article; zbMATH DE number 6881333 |
Statements
On the genericity of the finite number of equilibria in multicriteria games: a counterexample (English)
0 references
6 June 2018
0 references
Summary: The famous Harsanyi's Theorem [\textit{J. C. Harsanyi}, Int. J. Game Theory 2, 235--250 (1973; Zbl 0274.90085)] states that a generic finite game has an odd number of Nash equilibria in mixed strategies. In this paper, counterexamples are given showing that for finite multicriteria games (games with vector-valued payoffs) this kind of result does not hold. In particular, 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. This result then formalises the intuitive idea that games with uncountable sets of equilibria are not non-generic in the multicriteria case.
0 references
finite multicriteria game
0 references
Pareto-Nash equilibrium
0 references
genericity
0 references
0.7846702337265015
0 references
0.7799425721168518
0 references