Document Type

Article

Publication Date

8-2006

Publication Title

International Journal of Game Theory

Abstract

We consider zero-sum games (A, − A) and coordination games (A,A), where A is an m-by-n matrix with entries chosen independently with respect to the Cauchy distribution. In each case, we give an exact formula for the expected number of Nash equilibria with a given support size and payoffs in a given range, and also asymptotic simplications for matrices of a fixed shape and increasing size. We carefully compare our results with recent results of McLennan and Berg on Gaussian random bimatrix games (A,B), and describe how the three situations together shed light on random bimatrix games in general.

Volume

34

Issue

2

First Page

167

Last Page

184

DOI

https://doi.org/10.1007/s00182-006-0016-7

ISSN

1432-1270

Comments

This is a pre-print of an article published in International Journal of Game Theory. The final authenticated version is available online at: https://doi.org/10.1007/s00182-006-0016-7

Rights

© Springer-Verlag 2006

Included in

Mathematics Commons

Share

COinS