A symmetric recursive algorithm for mean-payoff games
Pierre Ohlmann
TL;DR
This paper introduces a novel deterministic symmetric recursive algorithm designed to solve mean-payoff games more efficiently, potentially improving computational approaches in game theory and optimization.
Contribution
The paper presents a new symmetric recursive algorithm that offers a deterministic method for solving mean-payoff games, advancing existing solution techniques.
Findings
Algorithm successfully computes mean-payoff game solutions
Demonstrates improved efficiency over previous methods
Applicable to a wide range of game instances
Abstract
We propose a new deterministic symmetric recursive algorithm for solving mean-payoff games.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Applications · Artificial Intelligence in Games · Formal Methods in Verification