Using Computer Algebra To Find Nash Equilibria

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2003, Pages 74-79

  Datta, Ruchira S ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Game theory; Gr bner bases; Polyhedral homotopy continuation; Polynomial systems

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SOFTWARE; GAME THEORY; POLYNOMIALS; PROBLEM SOLVING;

GRÖBNER BASES; NASH EQUILIBRIA; POLYHEDRAL HOMOTOPY CONTINUATION; POLYNOMIAL SYSTEMS;

COMPUTATIONAL METHODS;

EID: 1542330056     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/860854.860879     Document Type: Conference Paper

References (20)

1. D. N. Bernstein. The number of roots of a system of equations. Functional Analysis and Applications, 9(2):183-185, 1975.
2. R. S. Datta. Universality of Nash equilibria. Mathematics of Operations Research, to appear. Preprint (arXiv:math.AG0301001).
3. I. Emiris. Sparse Elimination and Applications in Kinematics. PhD thesis, University of California, Berkeley, December 1994.
4. T. Emiris and J. Canny. Efficient incremental algorithms for the sparse resultant and the mixed volume. Journal of Symbolic Computation, 20(2):117-149. 1995.
5. J.-C. Faugère. A new efficient algorithm for computing Groebner bases without reduction to zero (F5). In Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation (ISSAC 2002), pages 75-83, 2002.
6. H. Gintis. Game Theory Evolving, Princeton University Press, 2000.
7. D. R. Grayson and M. E. Stillman. Macaulay 2, a software system for research in algebraic geometry. Available at http://www.math.uiuc.edu/Macaulay2/.
8. G.-M. Greuel, G. Poster, and H. Schönemann. SINGULAR 2.0. A Computer Algebra System for Polynomial Computations, Centre for Computer Algebra, University of Kaiserslautern, 2001. http://www.singular.uni-kl.de.
9. T. Gunji, S. Kim, M. Kojima, A. Takeda, K. Fujisawa, and T. Mizutani. PHoM - a polyhedral homotopy continuation method for polynomial systems. Research Report B-386, Tokyo Institute of Technology, Tokyo, January 2003. http://www.is.titech.ac.jp/~kojima/PHoM/.
10. J. Harsanyi. Oddness of the number of equilibrium points: a new proof. International Journal of Game Theory, 2:235-250, 1973.
11. B. Huber and B. Sturmfels. A polyhedral method for solving sparse polynomial systems. Mathematics of Computation, 64:1541-1555, 1995.
12. X. Leroy, J. Vouillon, and D. Doligez. Objective Caml. Available at http://caml.inria.fr.
13. R. McKelvey and A. McLennan. The maximal number of regular totally mixed Nash equilibria. Journal of Economic Theory, 72:411-425, 1997.
14. R. D. McKelvey, A. McLennan, and T. Turocy. Gambit: Software tools for game theory. Available at http://www.hss.caltech.edu/gambit/.
15. A. Montes. A new algorithm for discussing Groebner bases with parameters. Journal of Symbolic Computation, 33(2): 183-208, 2002.
16. J. Nash. Equilibrium points in N-person games. Proceedings of the National Academy of Sciences of the United States of America, 36:48-49, 1950.
17. E. van Damme. Stability and Perfection of Nash Equilibria. Springer Verlag, Berlin, 1987.
18. J. Verschelde. Algorithm 795: PHCpack: A general-purpose solver for polynomial systems by homotopy continuation. ACM Transactions on Mathematical Software, 25(2):251-276, 1999.
19. J. Verscheide, P. Verlinden, and R. Cools. Homotopies exploiting Newton polytopes for solving sparse polynomial systems. SIAM Journal of Numerical Analysis, 31(3):915-930, 1994.
20. J. von Neumann and O. Morgenstern. Theory of Games and Economic Behavior. Princeton University Press, 1944.