Non-alternating mean payoff games
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866918023205486592 |
|---|---|
| author | Meyerovitch, Tom Young, Aidan |
| author_facet | Meyerovitch, Tom Young, Aidan |
| contents | We present and study a variant of the mean payoff games introduced by A. Ehrenfeucht and J. Mycielski. In this version, the second player makes an infinite sequence of moves only after the first player's sequence of moves has been decided and revealed. Such games occur in the computation of the covering radius of constrained systems, a quantity of interest in coding theory. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_02183 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Non-alternating mean payoff games Meyerovitch, Tom Young, Aidan Information Theory Computer Science and Game Theory Dynamical Systems We present and study a variant of the mean payoff games introduced by A. Ehrenfeucht and J. Mycielski. In this version, the second player makes an infinite sequence of moves only after the first player's sequence of moves has been decided and revealed. Such games occur in the computation of the covering radius of constrained systems, a quantity of interest in coding theory. |
| title | Non-alternating mean payoff games |
| topic | Information Theory Computer Science and Game Theory Dynamical Systems |
| url | https://arxiv.org/abs/2505.02183 |