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.
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, 2004. "Individually rational pure strategies in large games," Games and Economic Behavior, Elsevier, vol. 47(1), pages 221-233, April.
- Ehud Kalai, 2004. "Large Robust Games," Econometrica, Econometric Society, vol. 72(6), pages 1631-1665, November.
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.
If references are entirely missing, you can add them using this form.