Cycle Patterns and Mean Payoff Games
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910889493397504 |
|---|---|
| author | Loho, Georg Maat, Matthew Skomra, Mateusz |
| author_facet | Loho, Georg Maat, Matthew Skomra, Mateusz |
| contents | We introduce the concept of a \emph{cycle pattern} for directed graphs as functions from the set of cycles to the set $\{-,0,+\}$. The key example for such a pattern is derived from a weight function, giving rise to the sign of the total weight of the edges for each cycle. Hence, cycle patterns describe a fundamental structure of a weighted digraph, and they arise naturally in games on graphs, in particular parity games, mean payoff games, and energy games.
Our contribution is threefold: we analyze the structure and derive hardness results for the realization of cycle patterns by weight functions. Then we use them to show hardness of solving games given the limited information of a cycle pattern. Finally, we identify a novel geometric hardness measure for solving mean payoff games (MPG) using the framework of linear decision trees, and use cycle patterns to derive lower bounds with respect to this measure, for large classes of algorithms for MPGs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_17294 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Cycle Patterns and Mean Payoff Games Loho, Georg Maat, Matthew Skomra, Mateusz Computer Science and Game Theory Combinatorics We introduce the concept of a \emph{cycle pattern} for directed graphs as functions from the set of cycles to the set $\{-,0,+\}$. The key example for such a pattern is derived from a weight function, giving rise to the sign of the total weight of the edges for each cycle. Hence, cycle patterns describe a fundamental structure of a weighted digraph, and they arise naturally in games on graphs, in particular parity games, mean payoff games, and energy games. Our contribution is threefold: we analyze the structure and derive hardness results for the realization of cycle patterns by weight functions. Then we use them to show hardness of solving games given the limited information of a cycle pattern. Finally, we identify a novel geometric hardness measure for solving mean payoff games (MPG) using the framework of linear decision trees, and use cycle patterns to derive lower bounds with respect to this measure, for large classes of algorithms for MPGs. |
| title | Cycle Patterns and Mean Payoff Games |
| topic | Computer Science and Game Theory Combinatorics |
| url | https://arxiv.org/abs/2503.17294 |