Cheating Robot Games: A model for insider information

TL;DR

This paper introduces Cheating Robot games, a new class of simultaneous-play combinatorial games with insider information, analyzing their properties and optimal strategies through graph matching techniques.

Contribution

It develops the basic theory of Cheating Robot games, including equivalence relations, partial orders, and strategies, highlighting a subclass with invertible elements and a graph-based solution approach.

Findings

Games are deterministic due to insider moves.

A subclass with inverses for integers is identified.

Optimal strategies are linked to minimum-weight matching problems.

Abstract

Combinatorial games are two-player games of pure strategy where the players, usually called Left and Right, move alternately. In this paper, we introduce Cheating Robot games. These arise from simultaneous-play combinatorial games where one player has insider information ('cheats'). Play occurs in rounds. At the beginning of a round, both players know the moves that are available to them. Left chooses a move. Knowing Left's move, Right then chooses a move. Right's move is not constrained by Left's choice. The round is not completed until both players have made a choice. A game is finished only when one or both players do not have a move at the beginning of a round. Right choosing a move, knowing Left's, makes the games deterministic, distinguishing them from simultaneous games. Also, the ending condition distinguishes this class of games from combinatorial games, since the outcomes are now Left-win, Right-win and draw. The basic theory and properties are developed, including showing that there is an equivalence relation and partial order on the games. Whilst there are no inverses in the class of all games, we show that there is a sub-class, simple hot games, in which the integers have inverses. In this sub-class, the optimal strategies are obtained by the solutions to a minimum-weight matching problem on a graph whose number of vertices equals the number of summands in the disjunctive sum.