The structure of Nash equilibria in Poisson games
Claudia Meroni () and
Carlos Pimienta ()
Journal of Economic Theory, 2017, vol. 169, issue C, 128-144
We show that many results on the structure and stability of equilibria in finite games extend to Poisson games. In particular, the set of Nash equilibria of a Poisson game consists of finitely many connected components and at least one of them contains a stable set (De Sinopoli et al., 2014). In a similar vein, we prove that the number of Nash equilibria in Poisson voting games under plurality, negative plurality, and (when there are at most three candidates) approval rule, as well as in Poisson coordination games, is generically finite. As in finite games, these results are obtained exploiting the geometric structure of the set of Nash equilibria which, in the case of Poisson games, is shown to be semianalytic.
Keywords: Poisson games; Voting; Stable sets; Generic determinacy of equilibria; o-Minimal structures (search for similar items in EconPapers)
JEL-codes: C70 C72 (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1) Track citations by RSS feed
Downloads: (external link)
Full text for ScienceDirect subscribers only
Working Paper: The structure of Nash equilibria in Poisson games (2015)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:eee:jetheo:v:169:y:2017:i:c:p:128-144
Access Statistics for this article
Journal of Economic Theory is currently edited by A. Lizzeri and K. Shell
More articles in Journal of Economic Theory from Elsevier
Bibliographic data for series maintained by Dana Niculescu ().