Nash Equilibrium and Axiom of Choice Are Equivalent
Author
Abstract
Suggested Citation
Download full text from publisher
References listed on IDEAS
- Rachmilevitch, Shiran, 2016. "Approximate equilibria in strongly symmetric games," Journal of Mathematical Economics, Elsevier, vol. 66(C), pages 52-57.
- Voorneveld, Mark, 2010. "The possibility of impossible stairways: Tail events and countable player sets," Games and Economic Behavior, Elsevier, vol. 68(1), pages 403-410, January.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Rachmilevitch, Shiran, 2020. "A note on discontinuity and approximate equilibria in games with infinitely many players," Economics Letters, Elsevier, vol. 193(C).
- Voorneveld, Mark, 2019. "An axiomatization of the Nash equilibrium concept," Games and Economic Behavior, Elsevier, vol. 117(C), pages 316-321.
- Khan, M. Ali & Qiao, Lei & Rath, Kali P. & Sun, Yeneng, 2020. "Modeling large societies: Why countable additivity is necessary," Journal of Economic Theory, Elsevier, vol. 189(C).
- Kutay Cingiz & János Flesch & P. Jean-Jacques Herings & Arkadi Predtetchinski, 2020.
"Perfect information games where each player acts only once,"
Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 69(4), pages 965-985, June.
- Cingiz, Kutay & Flesch, Janos & Herings, P. Jean-Jacques & Predtetchinski, Arkadi, 2016. "Perfect Information Games where Each Player Acts Only Once," Research Memorandum 036, Maastricht University, Graduate School of Business and Economics (GSBE).
- Rachmilevitch, Shiran, 2016. "Approximate equilibria in strongly symmetric games," Journal of Mathematical Economics, Elsevier, vol. 66(C), pages 52-57.
More about this item
NEP fields
This paper has been announced in the following NEP Reports:- NEP-DCM-2023-07-17 (Discrete Choice Models)
- NEP-GTH-2023-07-17 (Game Theory)
- NEP-MIC-2023-07-17 (Microeconomics)
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2306.01790. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.