3 papers
math.OC2026
On the equivalence of semidefinite programming and zero-sum semidefinite games
Jesse Elliott, Constantin Ickstadt, Thorsten Theobald +1
By results of Dantzig (1951) and Adler (2013), computing the optimal solutions of a linear program is equivalent to finding optimal strategies in zero-sum bimatrix games. Dantzig's…
math.OC2025
Nash equilibria in semidefinite games and Lemke-Howson paths
Constantin Ickstadt, Thorsten Theobald, Elias Tsigaridas +1
We consider an algorithmic framework for two-player non-zero-sum semidefinite games, where each player's strategy is a positive semidefinite matrix with trace one. We formulate the…
cs.GT2024
A Stable-Set Bound and Maximal Numbers of Nash Equilibria in Bimatrix Games
Constantin Ickstadt, Thorsten Theobald, Bernhard von Stengel
Quint and Shubik (1997) conjectured that a non-degenerate n-by-n game has at most 2^n-1 Nash equilibria in mixed strategies. The conjecture is true for n at most 4 but false for n=…