CFDP 1095

A Bound on the Number of Nash Equilibria in a Coordination Game

Publication Date: February 1995

Pages: 8

Abstract: 

We prove that a “nondegenerate” m × m coordination game can have at most 2^M - 1 Nash equilibria, where M = min(m,n).