Non-alternating mean payoff games
Information Theory
2025-05-20 v2 Computer Science and Game Theory
Dynamical Systems
math.IT
Abstract
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.
Keywords
Cite
@article{arxiv.2505.02183,
title = {Non-alternating mean payoff games},
author = {Tom Meyerovitch and Aidan Young},
journal= {arXiv preprint arXiv:2505.02183},
year = {2025}
}
Comments
Updated in light of a relevant reference we discovered after the first version was made public