Colonel Blotto Game with Coalition Formation for Sharing Resources. - Joseph L. Heyman; Abhishek Gupta 002 (GameSec, 2018)

A Fast Algorithm to Reduce 2 × n Bimatrix Games to Rank-1 Games. - Joseph L. Heyman; Abhishek Gupta 002 (ECC, 2019)

On the Computation of Strategically Equivalent Rank-0 Games. - Joseph L. Heyman; Abhishek Gupta 002 (CoRR, 2019)

A Manifold of Polynomial Time Solvable Bimatrix Games. - Joseph L. Heyman (CoRR, 2019)

Two Algorithms for Computing Exact and Approximate Nash Equilibria in Bimatrix Games. - Jianzong Pi; Joseph L. Heyman; Abhishek Gupta 002 (GameSec, 2021)

Rank Reduction in Bimatrix Games. - Joseph L. Heyman; Abhishek Gupta 002 (IGTR, 2023)