Budget-constrained multi-battle contests: A new perspective and analysis

Chu Han Cheng, Po-An Chen*, Wing Kai Hon

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


In a multi-battle contest, each time a player competes by investing some of her budgets or resources in a component battle to collect a value if winning the battle. There are multiple battles to fight, and the budgets get consumed over time. The final winner in the overall contest is the one who first reaches some amount of total value. Examples include R & D races, sports competition, elections, and many more. A player needs to make adequate sequential actions to win the contest against dynamic competition over time from the others. We are interested in how much budgets the players would need and what actions they should take in order to perform well. We model and study such budget-constrained multi-battle contests where each component battle is a sequential first-price or all-pay auction. We focus on analyzing the 2-player budget ratio that guarantees a player's winning against the other omnipotent player. In the settings considered, we find the optimal budget ratios and the corresponding bidding strategies. Our definition of game, budget constraints, and emphasis on budget analyses provide a new perspective and analysis for multi-battle contests.

Original languageEnglish
Pages (from-to)16-26
Number of pages11
JournalTheoretical Computer Science
StatePublished - 18 Apr 2018


  • Budget constraints
  • Multi-battle contests
  • Optimal budget ratio


Dive into the research topics of 'Budget-constrained multi-battle contests: A new perspective and analysis'. Together they form a unique fingerprint.

Cite this