Resource allocation is a fundamental challenge in control theory, with applications spanning security, surveillance, network control, and market strategy. These problems are often associated with decision-making in adversarial environments, where players compete for control over valued contests. When adversaries are strategic themselves, how should one allocate limited resources to maximize their individual objectives? This tutorial session will examine the emergence of “Colonel Blotto games”, a class of game-theoretic models that aptly represents such scenarios, in the controls literature. In this tutorial session, we will showcase the work of several researchers that have made fundamental contributions in the analysis of Blotto games and their variants. Their work has enabled versatile applications to networked control, cybersecurity, economic competitions, political contests, and defense. We highlight the development of state-of-the-art techniques and discuss emerging directions for researchers to enhance the reach and applicability of these models across diverse problem domains.


Schedule of Talks

0:00-0:30Introduction to Colonel Blotto GamesKeith Paarporn
0:30-0:50The Value of Compromising Strategic Intent in General Lotto GamesGilberto Diaz-Garcia
0:50-1:10The Optimal Defense of Networks of TargetsDan Kovenock
1:10-1:30Dynamic Defender-Attacker Blotto GameDaigo Shishika
  • Keith Paarporn

    University of Colorado, Colorado Springs

  • Jason R. Marden

    University of California, Santa Barbara