The Derby Game: An Ordering-based Colonel Blotto Game

Akash Gaonkar, Divya Raghunathan, S. Matthew Weinberg

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

The Colonel Blotto game and its variants are a common approach to study competitive allocation of interchangeable resources (e.g., soldiers, money, or votes). We introduce a new variant of Blotto, which we call the Derby game, to study competitive allocation of non-interchangeable resources, such as campaign surrogates in politics or skilled workers in companies, and analyze its Nash equilibria. While Derby games unsurprisingly admit no pure Nash equilibria, our main results surprisingly show that Nash equilibria generically exist where one player plays a pure strategy, and we give necessary and sufficient conditions for such equilibria.

Original languageEnglish (US)
Title of host publicationEC 2022 - Proceedings of the 23rd ACM Conference on Economics and Computation
PublisherAssociation for Computing Machinery, Inc
Pages184-207
Number of pages24
ISBN (Electronic)9781450391504
DOIs
StatePublished - Jul 12 2022
Event23rd ACM Conference on Economics and Computation, EC 2022 - Boulder, United States
Duration: Jul 11 2022Jul 15 2022

Publication series

NameEC 2022 - Proceedings of the 23rd ACM Conference on Economics and Computation

Conference

Conference23rd ACM Conference on Economics and Computation, EC 2022
Country/TerritoryUnited States
CityBoulder
Period7/11/227/15/22

All Science Journal Classification (ASJC) codes

  • Computer Science (miscellaneous)
  • Economics and Econometrics
  • Computational Mathematics
  • Statistics and Probability

Keywords

  • Colonel Blotto games
  • Nash equilibria
  • resource allocation games

Fingerprint

Dive into the research topics of 'The Derby Game: An Ordering-based Colonel Blotto Game'. Together they form a unique fingerprint.

Cite this