CFDP 1095
A Bound on the Number of Nash Equilibria in a Coordination Game
Author(s):Publication Date: February 1995
Pages: 8
Abstract:
We prove that a “nondegenerate” m × m coordination game can have at most 2M - 1 Nash equilibria, where M = min(m,n).