Non-alternating mean payoff games
By: Tom Meyerovitch, Aidan Young
Potential Business Impact:
Helps computers solve tricky math problems faster.
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.
Similar Papers
Playing Markov Games Without Observing Payoffs
CS and Game Theory
Helps players win games without seeing scores.
Playing Markov Games Without Observing Payoffs
CS and Game Theory
Lets computers win games without seeing scores.
Non-Cooperative Games with Uncertainty
Theoretical Economics
Helps players make smart choices with unknown information.