Oddness of the number of Nash equilibria: The case of polynomial payoff functions

Philippe Bich and Julien Fixary

Games and Economic Behavior, 2024, vol. 145, issue C, 510-525

Abstract: In 1971, Wilson (1971) proved that “almost all” finite games have an odd number of mixed Nash equilibria. Since then, several other proofs have been given, but always for mixed extensions of finite games. In this paper, we present a new oddness theorem for large classes of polynomial payoff functions and semi-algebraic sets of strategies. Additionally, we provide some applications to recent models of games on networks such that Patacchini-Zenou's model about juvenile delinquency and conformism (Patacchini and Zenou, 2012), Calvó-Armengol-Patacchini-Zenou's model about social networks in education (Calvó-Armengol et al., 2009), Konig-Liu-Zenou's model about R&D networks (König et al., 2019), Helsley-Zenou's model about social networks and interactions in cities (Helsley and Zenou, 2014).

Keywords: Nash equilibrium; Polynomial payoff functions; Generic oddness; Network games (search for similar items in EconPapers)
JEL-codes: C02 C62 C72 D85 (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S089982562400054X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:gamebe:v:145:y:2024:i:c:p:510-525

DOI: 10.1016/j.geb.2024.04.005

Access Statistics for this article

Games and Economic Behavior is currently edited by E. Kalai

More articles in Games and Economic Behavior from Elsevier
Bibliographic data for series maintained by Catherine Liu ().