Approximate Equilibria in Non-constant-sum Colonel Blotto and Lottery Blotto Games with Large Numbers of Battlefields

by   Dong Quan Vu, et al.

In the Colonel Blotto game, two players with a fixed budget simultaneously allocate their resources across n battlefields to maximize the aggregate value gained from the battlefields where they have the higher allocation. Despite its long-standing history and important applicability, the Colonel Blotto game still lacks a complete Nash equilibrium characterization in its most general form-the non-constant-sum version with asymmetric players and heterogeneous battlefields. In this work, we propose a simply-constructed class of strategies-the independently uniform strategies-and we prove them to be approximate equilibria of the non-constant-sum Colonel Blotto game; moreover, we also characterize the approximation error according to the game's parameters. We also introduce an extension called the Lottery Blotto game, with stochastic winner-determination rules allowing more flexibility in modeling practical contexts. We prove that the proposed strategies are also approximate equilibria of the Lottery Blotto game.



There are no comments yet.


page 1

page 2

page 3

page 4


On approximate pure Nash equilibria in weighted congestion games with polynomial latencies

We consider the problem of the existence of natural improvement dynamics...

Computing Stackelberg Equilibria of Large General-Sum Games

We study the computational complexity of finding Stackelberg Equilibria ...

NP-hardness of Computing Uniform Nash Equilibria on Planar Bimatrix Game

We study the complexity of computing a uniform Nash equilibrium on a bim...

An algorithmic solution to the Blotto game using multi-marginal couplings

We describe an efficient algorithm to compute solutions for the general ...

Colonel Blotto Games with Favoritism: Competitions with Pre-allocations and Asymmetric Effectiveness

We introduce the Colonel Blotto game with favoritism, an extension of th...

Learning Convex Partitions and Computing Game-theoretic Equilibria from Best Response Queries

Suppose that an m-simplex is partitioned into n convex regions having di...

An Improved Bound for the Tree Conjecture in Network Creation Games

We study Nash equilibria in the network creation game of Fabrikant et al...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.