2020/12/12 by Nicolás Ariel Capitelli, Capitelli, Nicolas, Melina Privitelli +1
Computer Science · Decision Sciences · #91A46 (Primary) 91A05 #91A60 (Secondary) #Advanced Bandit Algorithms Research #Combinatorics (math.CO) #FOS: Mathematics #Game Theory and Applications #Optimization and Search Problems
paper · pdf · doi:10.48550/arxiv.2012.06768
openalex publication_date 2020/12/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this note we discuss a theory of combinatorial games that involve transmitting the moves through a noisy channel that can introduce errors during the transmission. Players are aware of this interference and incorporate this variable into the game: the valid move is the received one, regardless of whether it is the other player's sent move (as long as it is a valid move in the original game; otherwise, a retransmission is requested). Players know the probability of introducing an error through communication and can play a non-optimal (but valid) move that maximizes their chances of winning. We present some examples and provide the basic definitions and results of this type of games.