Non-alternating mean payoff games

TL;DR

This paper introduces a new variant of mean payoff games where the second player moves after the first, relevant for coding theory applications like computing the covering radius of constrained systems.

Contribution

It defines and analyzes a novel non-alternating mean payoff game model with implications for coding theory.

Findings

The game variant models real-world coding problems.

Analysis reveals unique strategic properties.

Potential applications in coding theory and system analysis.

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.