Title

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

Document Type

Discussion Paper

Publication Date

2-1-1995

CFDP Number

1095

CFDP 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 ).

This document is currently not available here.

Share

COinS