Pré-Publication, Document De Travail Année : 2024

Reducing Stochastic Games to Semidefinite Programming

Résumé

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.

Dates et versions

hal-04902257 , version 1 (20-01-2025)

Identifiants

Citer

Manuel Bodirsky, Georg Loho, Mateusz Skomra. Reducing Stochastic Games to Semidefinite Programming. 2024. ⟨hal-04902257⟩
103 Consultations
0 Téléchargements

Altmetric

Partager

  • More