Finding all Nash equilibria of a finite game using polynomial algebra

46Citations
Citations of this article
30Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The set of Nash equilibria of a finite game is the set of nonnegative solutions to a system of polynomial equations. In this survey article, we describe how to construct certain special games and explain how to find all the complex roots of the corresponding polynomial systems, including all the Nash equilibria. We then explain how to find all the complex roots of the polynomial systems for arbitrary generic games, by polyhedral homotopy continuation starting from the solutions to the specially constructed games. We describe the use of Gröbner bases to solve these polynomial systems and to learn geometric information about how the solution set varies with the payoff functions. Finally, we review the use of the Gambit software package to find all Nash equilibria of a finite game. © The Author(s) 2009.

Cite

CITATION STYLE

APA

Datta, R. S. (2009). Finding all Nash equilibria of a finite game using polynomial algebra. Economic Theory, 42(1), 55–96. https://doi.org/10.1007/s00199-009-0447-z

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free