2025/05/04 by Meyerovitch, Tom, Young, Aidan
#Computer Science and Game Theory (cs.GT) #Dynamical Systems (math.DS) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT)
paper · doi:10.48550/arxiv.2505.02183
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.