Discussion Paper A Bound on the Number of Nash Equilibria in a Coordination Game We prove that a “nondegenerate” m × m coordination game can have at most 2M - 1 Nash equilibria, where M = min(m,n). Abstract We prove that a “nondegenerate” m × m coordination game can have at most 2M - 1 Nash equilibria, where M = min(m,n). DocumentControlNumber(s) CFDP 1095 Author(s) Martin Shubik Publication Link A Bound on the Number of Nash Equilibria in a Coordination Game Page Count 8 Publication Date February 1995 Revision Date May 2022