DeepAI AI Chat
Log In Sign Up

A Manifold of Polynomial Time Solvable Bimatrix Games

by   Joseph L. Heyman, et al.

This paper identifies a manifold in the space of bimatrix games which contains games that are strategically equivalent to rank-1 games through a positive affine transformation. It also presents an algorithm that can compute, in polynomial time, one such rank-1 game which is strategically equivalent to the original game. Through this approach, we substantially expand the class of games that are solvable in polynomial time. It is hoped that this approach can be further developed in conjunction with other notions of strategic equivalence to compute exact or approximate Nash equilibria in a wide variety of bimatrix games.


page 1

page 2

page 3

page 4


Fast Algorithms for Rank-1 Bimatrix Games

The rank of a bimatrix game is the matrix rank of the sum of the two pay...

Solving the General Case of Rank-3 Maker-Breaker Games in Polynomial Time

A rank-3 Maker-Breaker game is played on a hypergraph in which all hyper...

Game Transformations that preserve Nash Equilibrium sets and/or Best Response sets

In the literature on simultaneous non-cooperative games, it is well-know...

Manipulating Tournaments in Cup and Round Robin Competitions

In sports competitions, teams can manipulate the result by, for instance...

A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games

Since the celebrated PPAD-completeness result for Nash equilibria in bim...

Winning the War by (Strategically) Losing Battles: Settling the Complexity of Grundy-Values in Undirected Geography

We settle two long-standing complexity-theoretical questions-open since ...

Approximate Solutions to a Class of Reachability Games

In this paper, we present a method for finding approximate Nash equilibr...