A family of identities related to zero-sum and team games
We list and prove a family of binomial identities by calculating in two ways the probabilities of approximate saddlepoints occurring in random mxn matrices. The identities are easily seen to be equivalent to the evaluation of a family of Gauss 2F1 polynomials according to a formula of Vandermonde. We also consider some implications concerning the number of approximate pure strategy Nash equilibria we can expect in large matrix zero-sum and team games.
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.:
- Ehud Kalai, 2002.
"Large Robust Games,"
1350, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Stanford, William, 2004. "Individually rational pure strategies in large games," Games and Economic Behavior, Elsevier, vol. 47(1), pages 221-233, April.
When requesting a correction, please mention this item's handle: RePEc:eee:matsoc:v:62:y:2011:i:2:p:91-94. 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 references are entirely missing, you can add them using this form.