Title: Generic 4 x 4 Two Person Games Have at Most 15 Nash Equilibria
Abstract:The maximal generic number of Nash equilibria for two person games in which the two agents each have four pure strategies is shown to be 15. In contrast to Keiding (1995), who arrives at this result b...The maximal generic number of Nash equilibria for two person games in which the two agents each have four pure strategies is shown to be 15. In contrast to Keiding (1995), who arrives at this result by computer enumeration, our argument is based on a collection of lemmas that constrain the set of equilibria. Several of these pertain to any common number d of pure strategies for the two agents.Read More
Publication Year: 1997
Publication Date: 1997-01-01
Language: en
Type: preprint
Access and Citation
Cited By Count: 3
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot