Nash equilibria in random games

Random Structures and Algorithms

Volumn 31, Issue 4, 2007, Pages 391-405

  Bárány, Imre ^a,b   Vempala, Santosh ^c   Vetta, Adrian ^d  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^b UNIVERSITY COLLEGE LONDON   (United Kingdom)

^c Georgia Institute of Technology   (United States)

^d MCGILL UNIVERSITY   (Canada)

Author keywords

Algorithmic game theory; Nash equilibria; Polynomial time; Random games

Indexed keywords

EID: 36849078854     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20199     Document Type: Article

References (31)

1. F. Affentranger and J. Wieacker, On the convex hull of uniform random points in a simple d-polytope, Discrete Comput Geometry 6 (1991), 291-305.
2. N. Alon and J. Spencer, The Probabilistic method, 2nd edition, Wiley, New York, 2000.
3. I. Bárány, Intrinsic volumes and f-vectors of random polytopes, Math Ann 285 (1989), 671-699.
4. I. Bárány and D. Larman, Convex bodies, economic cap coverings, random polytopes, Mathematika 35 (1988), 274-291.
5. K. Borgwardt, Algorithms and Combinatorics Vol. 1, Springer-Verlag, 1980.
6. X. Chen and X. Deng, Settling the complexity of 2-player Nash-equilibrium, Proceedings of 47th FOCS, Berkeley, October 2006, pp. 267-272.
7. L. Devroye, A note on finding convex hulls via maximal vectors, Inform Process Lett 11(1980), 53-56.
8. J. Dickhaut and T. Kaplan, A program for finding Nash equilibria, The Math J 1 (1991), 87-93.
9. M. Dresher, Probability of a pure equilibrium point in n-person games, J Combin Theory 8 (1970), 134-145.
10. R. Dwyer, On the convex hull of random points in a polytope, J Appl Probab 25 (1988), 688-699.
11. R. Dwyer, Convex hulls of samples from spherically symmetric distributions, Discrete Appl Math 31 (1991), 113-132.
12. A. Fabrikant, C. Papadimitriou, and K. Talwar, The complexity of pure-strategy Nash equilibria, Proceedings of 36th STOC, Chicago, June 2004.
13. K. Goldberg, A. Goldman, and M. Newman, The probability of an equilibrium point, J Res Natl Bur Stand, Section B, 72 (1968), 93-101.
14. H. Groemer, Limit theorems for the convex hull of random points in higher dimensions, Pac J Math 45 (1973), 525-533.
15. I. Heuter, Limit theorems for the convex hull of random points in higher dimensions, Trans Am Math Soc 351 (1999), 4337-4363.
16. A. Kalai, personal communication, 2005.
17. D. Kirkpatrick and R. Seidel, The ultimate planar convex hull algorithm, SIAM J Comput 15 (1988), 287-299.
18. C. Lemke and J. Howson, Equilibrium points of bimatrix games, J Soc Ind Appl Math 12 (1964), 413-423.
19. R. Lipton, E. Markakis, and A. Mehta, Playing large games using simple strategies, Proceedings of E-Commerce, San Diego, June 2003, pp. 36-41.
20. A. McLennan and J. Berg, The asymptotic expected number of Nash equilibria of two player normal form games, Game Econ Behav 51 (2005), 264-295.
21. N. Megiddo, Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm, Math Program 35 (1986), 140-172.
22. C. Papadimitriou, Algorithms, games and the internet, Proceedings of 33rd STOC, Heraklion, Crete, July 2001, pp. 749-753.
23. R. Porter, E. Nudelman, and Y. Shoham, Simple search methods for finding a Nash equilibrium, Proceedings of 19th AAAI, San Jose, July 2004, pp. 664-669.
24. n. I., J Appl Probab 7 (1970), 35-48.
25. L. Santaló, Integral geometry and geometric probability, Addison-Wesley, 1976.
26. R. Savani and B. von Stengel, Exponentially many steps for finding a Nash equilibrium in a bimatrix game, Proceedings of 45th FOCS, Rome, October 2004, pp. 258-267.
27. R. Schneider, "Discrete aspects of stochastic geometry," In Eds. J. Goodman and J. O'Rourke, Handbook of discrete and computational geometry, Boca Raton, CRC Press, 2004, pp. 255-278.
28. S. Smale, On the average number of steps in the simplex method of linear programming, Math Program 27 (1983), 241-262.
29. D. Spielman and S. Teng, Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time, J ACM 51 (2004), 385-463.
30. B. van Wel, The convex hull of a uniform sample from the interior of a simple d-polytope, J Appl Probab 26 (1989), 259-273.
31. W. Weil and J. Wieacker, "Stochastic geometry," In Eds. P. Gruber and J. Wills, Handbook of convex geometry, North-Holland, Amsterdam, 1993, pp. 1391-1438.