Self interest cumulative subtraction games
By: Anjali Bhagat , Tanmay Kulkarni , Urban Larsson and more
Potential Business Impact:
Makes games fairer by stopping players from being selfish.
Subtraction games have a rich literature as normal-play combinatorial games (e.g., Berlekamp, Conway, and Guy, 1982). Recently, the theory has been extended to zero-sum scoring play (Cohensius et al. 2019). Here, we take the approach of cumulative self-interest games, as introduced in a recent framework preprint by Larsson, Meir, and Zick. By adapting standard Pure Subgame Perfect Equilibria (PSPE) from classical game theory, players must declare and commit to acting either ``friendly'' or ``antagonistic'' in case of indifference. Whenever the subtraction set has size two, we establish a tie-breaking rule monotonicity: a friendly player can never benefit by a deterministic deviation to antagonistic play. This type of terminology is new to both ``economic'' and ``combinatorial'' games, but it becomes essential in the self-interest cumulative setting. The main result is an immediate consequence of the tie-breaking rule's monotonicity; in the case of two-action subtraction sets, two antagonistic players are never better off than two friendly players, i.e., their PSPE utilities are never greater. For larger subtraction sets, we conjecture that the main result continues to hold, while tie-breaking monotonicity may fail, and we provide empirical evidence in support of both statements.
Similar Papers
On Altruism and Spite in Bimatrix Games
CS and Game Theory
Helps computers understand if players are kind or mean.
Monotone Near-Zero-Sum Games: A Generalization of Convex-Concave Minimax
CS and Game Theory
Makes computer games easier to solve.
Strategyproof Tournament Rules for Teams with a Constant Degree of Selfishness
CS and Game Theory
Makes sports fair, stopping cheating for wins.