Papers
Topics
Authors
Recent
Search
2000 character limit reached

Rank-1 Games With Exponentially Many Nash Equilibria

Published 11 Nov 2012 in cs.GT | (1211.2405v1)

Abstract: The rank of a bimatrix game (A,B) is the rank of the matrix A+B. We give a construction of rank-1 games with exponentially many equilibria, which answers an open problem by Kannan and Theobald (2010).

Citations (8)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (1)

  1. Bernhard von Stengel 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up