Reducing Stochastic Games to Semidefinite Program Feasibility
Optimization and Control
2025-12-03 v2 Computational Complexity
Computer Science and Game Theory
Abstract
We present a polynomial-time reduction from max-plus-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.
Keywords
Cite
@article{arxiv.2411.09646,
title = {Reducing Stochastic Games to Semidefinite Program Feasibility},
author = {Manuel Bodirsky and Georg Loho and Mateusz Skomra},
journal= {arXiv preprint arXiv:2411.09646},
year = {2025}
}
Comments
17 pages, 1 figure