Metraipolis › archive › dc_ef1be00ed55b
The Big Match under translation-invariant charges — arXiv:2610.19646
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.19646
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T14:25:32.998Z
- SHA-256 of the archived text
95892233937ae362098f7f809bb4513bb47f2d8dc90cb079bace58c70769f7ee- Stable URL of this page
https://metraipolis.com/documento/dc_ef1be00ed55b
How to cite
The Big Match under translation-invariant charges — arXiv:2610.19646 — arXiv (en), https://arxiv.org/abs/2610.19646 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ef1be00ed55b (Metraipolis archive dc_ef1be00ed55b, sha256 95892233937ae362098f7f809bb4513bb47f2d8dc90cb079bace58c70769f7ee)
BibTeX
@misc{dcef1be00ed55b,
title = {The Big Match under translation-invariant charges — arXiv:2610.19646},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.19646},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ef1be00ed55b; sha256 95892233937ae362098f7f809bb4513bb47f2d8dc90cb079bace58c70769f7ee},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.19646. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study two-player zero-sum stochastic games in which a stream of stage payoffs is evaluated by a translation-invariant charge on the set of stages. Every patient valuation, that is, every diffuse charge that obeys the time value of money principle, is translation-invariant, and by Mertens and Neyman each player has, for every $\varepsilon>0$, a strategy that is $\varepsilon$-optimal for all patient valuations simultaneously. We show that this robustness breaks down for translation-invariant charges. In the Big Match with $0$--$1$ payoffs, whose uniform value is $1/2$, every strategy of Player 1 is worthless: for every strategy of Player 1 and every $\delta>0$, Player 2 has a pure reply, and there is a translation-invariant charge under which Player 1's payoff is less than $\delta$. Consequently, the Big Match has no value with respect to all translation-invariant charges. This contrasts with finite Markov decision processes, where every stationary Blackwell optimal strategy is optimal for every translation-invariant charge. We pose questions on robust guarantees in general stochastic games and on optimality with respect to a fixed translation-invariant charge. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno). Categorie arXiv: Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2610.19646 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-15T13:55:20.322Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).