arXiv (All)
open access
Strategy recovery for Mean-Payoff Games is as hard as solving them from scratch
Mean-Payoff Games (MPGs) form an interesting family of deterministic, infinite-duration, zero-sum, turn-based games played by two players on a finite weighted directed graph. The goal of the players is to minimize, respectively maximize, the $\textit{limiting average}$ of the costs of the edges on a
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Constructions for positional games and applications to domination games / Ali Deniz Bagdas, Dennis Clemens, Fabian Hamann, Yannick Mogge#921993
- Combinatorial games and the golden ratio on digraphs#617862
- Combinatorial games and the golden ratio on digraphs#617362
- Pricing of graph-based quantum portfolios from first principles#1187957
- Efficiency and fairness trade-offs in two player bargaining games#730811
Record · ID 1400021
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive