An Objective Improvement Approach to Solving Discounted Payoff Games

October 02, 2023 Β· Declared Dead Β· πŸ› International Symposium on Games, Automata, Logics and Formal Verification

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Daniele Dell'Erba, Arthur Dumas, Sven Schewe arXiv ID 2310.01008 Category cs.DS: Data Structures & Algorithms Citations 2 Venue International Symposium on Games, Automata, Logics and Formal Verification Last Checked 4 months ago
Abstract
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Data Structures & Algorithms

Died the same way β€” πŸ‘» Ghosted