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

We prove that a "nondegenerate" m x m coordination game can have at most 2^{M} - 1 Nash equilibria, where M = min(m,n).

Year of publication:	1995-02
Authors:	Quint, Thomas ; Shubik, Martin
Institutions:	Cowles Foundation for Research in Economics, Yale University

Extent:	application/pdf
Series:	Cowles Foundation Discussion Papers.
Type of publication:	Book / Working Paper
Notes:	The price is None Number 1095 8 pages
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005762572