Fix finite pure strategy sets S1,… ,Sn, and let S=S1×⋯×Sn. In our model of a random game the agents' payoffs are statistically independent, with each agent's payoff uniformly distributed on the unit sphere in R-super-S. For given nonempty T1⊂S1,… ,Tn⊂Sn we give a computationally implementable formula for the mean number of Nash equilibria in which each agent i's mixed strategy has support Ti. The formula is the product of two expressions. The first is the expected number of totally mixed equilibria for the truncated game obtained by eliminating pure strategies outside the sets Ti. The second may be construed as the "probability" that such an equilibrium remains an equilibrium when the strategies in the sets Si∖Ti become available. Copyright The Econometric Society 2005.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. 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.
Publisher Info
Article provided by Econometric Society in its journal Econometrica.
Cited by: (explanations, 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.)
Herings,P. Jean-Jacques & Peeters,Ronald J.A.P., 2001.
"Equilibrium Selection in Stochastic Games,"
Research Memoranda
009, Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization.
[Downloadable!]
Other versions: