An Objective Improvement Approach to Solving Discounted Payoff Games

Daniele Dell'Erba
(University of Liverpool)
Arthur Dumas
(ENS Rennes)
Sven Schewe
(University of Liverpool)

While discounted payoff games and classic games that reduce to them, like parity and mean-payoff games, are symmetric, their solutions are not. We have taken a fresh view on the constraints that optimal solutions need to satisfy, and devised a novel way to converge to them, which is entirely symmetric. It also challenges the gospel that methods for solving payoff games are either based on strategy improvement or on value iteration.

In Antonis Achilleos and Dario Della Monica: Proceedings of the Fourteenth International Symposium on Games, Automata, Logics, and Formal Verification (GandALF 2023), Udine, Italy, 18-20th September 2023, Electronic Proceedings in Theoretical Computer Science 390, pp. 203–219.
Published: 30th September 2023.

ArXived at: https://dx.doi.org/10.4204/EPTCS.390.13 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org