2 citations · 3 across the 3 of their papers we have counts for
Showing cs.GTShow all
3 papers · 1 filter
cs.GT2019★ 2 cited
A Manifold of Polynomial Time Solvable Bimatrix Games
Joseph L. Heyman
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…
cs.GT2019
Rank Reduction in Bimatrix Games
Joseph L. Heyman, Abhishek Gupta
The rank of a bimatrix game is defined as the rank of the sum of the payoff matrices of the two players. The rank of a game is known to impact both the most suitable computation me…
cs.GT2019★ 1 cited
Two Algorithms for Computing Exact and Approximate Nash Equilibria in Bimatrix Games
Jianzong Pi, Joseph L. Heyman, Abhishek Gupta
In this paper, we first devise two algorithms to determine whether or not a bimatrix game has a strategically equivalent zero-sum game. If so, we propose an algorithm that computes…