Published August 30, 2017
| Submitted
Report
Open
The Maximal Number of Regular Totally Mixed Nash Equilibria
- Creators
- McKelvey, Richard D.
- McLennan, Andrew
Abstract
Let S=∏^n_(i=1) Si be the strategy space for a finite n-person game. Let (S10,…, Sn0) ϵ S be any strategy n-tuple, and let Ti = Si - {si0}, i = 1, ..., n. We show that the maximum number of regular totally mixed Nash equilibria to a game with strategy sets Si is the number of partitions P = {P1,…, Pn} of UiTi such that, for each i, #Pi = #Ti and Pi ∩ Ti = ∅. The bound is tight, as we give a method for constructing a game with the maximum number of equilibria.
Additional Information
This research was supported in part by National Science Foundation grants SBR-9308862 to the University of Minnesota and SBR-9308637 to the California Institute of Technology. We benefited from stimulating discussions with Victor Reiner and Michel leBreton. Published as McKelvey, Richard D., and Andrew McLennan. "The maximal number of regular totally mixed Nash equilibria." Journal of Economic Theory 72, no. 2 (1997): 411-425.Attached Files
Submitted - sswp865.pdf
Files
sswp865.pdf
Files
(443.4 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:d84fe0682d11ba9c0067847334745e87
|
443.4 kB | Preview Download |
Additional details
- Eprint ID
- 80745
- Resolver ID
- CaltechAUTHORS:20170823-152433647
- SBR-9308637
- NSF
- SBR-9308862
- NSF
- Created
-
2017-08-30Created from EPrint's datestamp field
- Updated
-
2019-10-03Created from EPrint's last_modified field
- Caltech groups
- Social Science Working Papers
- Series Name
- Social Science Working Paper
- Series Volume or Issue Number
- 865