Reducing Stochastic Games to Semidefinite Programming

Download PDF
Open Webpage

Manuel Bodirsky, Georg Loho, Mateusz Skomra

Published: 01 Jan 2025, Last Modified: 07 Nov 2025ICALP 2025EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: We present a polynomial-time reduction from max-average constraints to the feasibility problem for semidefinite programs. This shows that Condon’s simple stochastic games, stochastic mean payoff games, and in particular mean payoff games and parity games can all be reduced to semidefinite programming.