On the Number of Pure Strategy Nash Equilibria in Random Games
How many pure Nash equilibria can we expect to have in a finite game chosen at random? Solutions to the above problem have been proposed in some special cases. In this paper we assume independence among the profiles, but we allow either positive or negative dependence among the players' payoffs in a same profile. We provide asymptotic results for the distribution of the number of Nash equilibria when either the number of players or the number of strategies increases. We will show that different dependence assumptions lead to different asymptotic results.
(This abstract was borrowed from another version of this item.)
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Stanford, William, 1999. "On the number of pure strategy Nash equilibria in finite common payoffs games," Economics Letters, Elsevier, vol. 62(1), pages 29-34, January.
- Powers, Imelda Yeung, 1990. "Limiting Distributions of the Number of Pure Strategy Nash Equilibria in N-Person Games," International Journal of Game Theory, Springer, vol. 19(3), pages 277-86.
- Stanford, William, 1997. "On the distribution of pure strategy equilibria in finite games with vector payoffs," Mathematical Social Sciences, Elsevier, vol. 33(2), pages 115-127, April.
When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:33:y:2000:i:2:p:274-293. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
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 references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.