Blotto Games with Costly Winnings

MaRDI QIDQ4556112zbMATH OpenFDO

Authors Irit Nowik, Tahl Nowik

Publication date 23 November 2018

Full work available at URL https://arxiv.org/abs/1510.05841

zbMATH Keywords

Colonel Blotto gameslimited resources of playersrepeated gamesstochastic asymmetric games

Mathematics Subject Classification ID

2-person games (91A05) Stochastic games, stochastic differential games (91A15)

Abstract: We introduce a new variation of the m-player asymmetric Colonel Blotto game, where the n battles occur as sequential stages of the game, and the winner of each stage needs to spend resources for maintaining his win. The limited resources of the players are thus needed both for increasing the probability of winning and for the maintenance costs. We show that if the initial resources of the players are not too small, then the game has a unique Nash equilibrium, and the given equilibrium strategies guarantee the given expected payoff for each player.

Recommendations

• Games with costly winnings
• The lottery Blotto game
• A Blotto game with incomplete information
• scientific article; zbMATH DE number 592680
• scientific article; zbMATH DE number 874564
• A Blotto game with multi-dimensional incomplete information
• A lottery Blotto game with heterogeneous items of asymmetric valuations

Cited in

(8)

• The multiplayer Colonel Blotto game
• The dynamics of Majoritarian Blotto games
• A three-stage Colonel Blotto game: when to provide more information to an adversary
• Games with costly winnings
• From battlefields to elections: winning strategies of Blotto and auditing games
• On the impossibility of deterrence in sequential Colonel Blotto games
• A generalized model of the Colonel Blotto stochastic game
• Online learning in budget-constrained dynamic Colonel Blotto games

This page was built for publication: Blotto Games with Costly Winnings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4556112)