Joseph L. Heyman

According to our database, Joseph L. Heyman authored at least 6 papers between 2018 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

Rank Reduction in Bimatrix Games.

Joseph L. Heyman, Abhishek Gupta

IGTR, March, 2023

2021

Two Algorithms for Computing Exact and Approximate Nash Equilibria in Bimatrix Games.

Jianzong Pi, Joseph L. Heyman, Abhishek Gupta

Proceedings of the Decision and Game Theory for Security - 12th International Conference, 2021

2019

A Manifold of Polynomial Time Solvable Bimatrix Games.

Joseph L. Heyman

CoRR, 2019

On the Computation of Strategically Equivalent Rank-0 Games.

Joseph L. Heyman, Abhishek Gupta

CoRR, 2019

A Fast Algorithm to Reduce 2 × n Bimatrix Games to Rank-1 Games.

Joseph L. Heyman, Abhishek Gupta

Proceedings of the 17th European Control Conference, 2019

2018

Colonel Blotto Game with Coalition Formation for Sharing Resources.

Joseph L. Heyman, Abhishek Gupta

Proceedings of the Decision and Game Theory for Security - 9th International Conference, 2018