Proportional resource allocation in dynamic n-player Blotto games
A variety of social, economic, and political interactions have long been modelled after Blotto games. In this paper, we introduce a general model of dynamic $n$-player Blotto contests. The players have asymmetric resources, and the battlefield prizes are not necessarily homogeneous. Each player's probability of winning the prize in a battlefield is governed by a contest success function and players' resource allocation on that battlefield. We show that there exists a subgame perfect equilibrium in which players allocate their resources proportional to the battlefield prizes for every history. This result is robust to exogenous resource shocks throughout the game.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Colonel Blotto Game: An Analysis and Extension to Networks
The Colonel Blotto game, introduced by Borel in the 1920s, is often used for modeling various real-life settings, such as elections, lobbying, etc. The game is based on the allocation of limited resources by players to a…
Online Learning in Budget-Constrained Dynamic Colonel Blotto Games
In this paper, we study the strategic allocation of limited resources using a Colonel Blotto game (CBG) under a dynamic setting and analyze the problem using an online learning approach. In this model, one of the players…
A Genetic Algorithm approach to Asymmetrical Blotto Games with Heterogeneous Valuations
Blotto Games are a popular model of multi-dimensional strategic resource allocation. Two players allocate resources in different battlefields in an auction setting. While competition with equal budgets is well understood…
DiversityA Partial Solution to Continuous Blotto
This paper analyzes the structure of mixed-strategy equilibria for Colonel Blotto games, where the outcome on each battlefield is a polynomial function of the difference between the two players' allocations. This paper s…
Reinforcement Learning for Game-Theoretic Resource Allocation on Graphs
Game-theoretic resource allocation on graphs (GRAG) involves two players competing over multiple steps to control nodes of interest on a graph, a problem modeled as a multi-step Colonel Blotto Game (MCBG). Finding optima…
reinforcement-learningReinforcement LearningReinforcement Learning (RL)valid