Communication Dans Un Congrès Année : 2025

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.

Fichier principal
Vignette du fichier
main_ICALP.pdf (536.68 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-05388185 , version 1 (28-11-2025)

Licence

Identifiants

Citer

Manuel Bodirsky, Georg Loho, Mateusz Skomra. Reducing Stochastic Games to Semidefinite Programming. 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025), Jul 2025, Aarhus, Denmark. pp.145:1-145:15, ⟨10.4230/LIPIcs.ICALP.2025.145⟩. ⟨hal-05388185⟩
295 Consultations
51 Téléchargements

Altmetric

Partager

  • More