Skip to main content

Blotto Games

  • Chapter
  • First Online:
Two-Person Zero-Sum Games

Part of the book series: International Series in Operations Research & Management Science ((ISOR,volume 201))

  • 1973 Accesses

Abstract

Colonel Blotto made his first appearance in Caliban's Weekend Book of 1924, where he faced the problem of trying to capture as many forts as possible with a limited number of divisions. Blotto’s problem was made difficult because an opposing commander was at the same time distributing defensive forces among the forts in an effort to frustrate him. The class of games where each player must divide an aggregate force among several areas of contention has since been named after the Colonel.

Another such victory over the Romans, and we are undone.

Pyrrhus

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 119.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Beale, E., & Heselden, G. (1962). An approximate method of solving Blotto Games. Naval Research Logistics, 9(2), 65–79.

    Article  Google Scholar 

  • Bracken, J., Brooks, P., & Falk, J. (1987). Robust preallocated preferential defense. Naval Research Logistics, 34(1), 1–22.

    Article  Google Scholar 

  • Croucher, J. (1975). Application of the fundamental theory of games to an example concerning antiballistic missile defense. Naval Research Logistics, 22(1), 197–203.

    Article  Google Scholar 

  • Eckler, A., & Burr, S. (1972). Mathematical models of target coverage and missile allocation. Arlington, VA: Military Operations Research Society.

    Google Scholar 

  • Galiano, R. (1969). A simple analytic model for preallocated defense. Paper 30, Lambda Corporation, Arlington, VA.

    Google Scholar 

  • Matheson, J. (1967). Preferential strategies with imperfect weapons. Report AR67-1, Analytical Services Corporation, Falls Church, VA.

    Google Scholar 

  • McGarvey, D. (1987). Mixed strategy solutions to integer Prim-Read defense problems. Report P-7302, RAND Corporation, Santa Monica, CA.

    Google Scholar 

  • Washburn, A. (2013). Blotto politics. to appear in Operations Research 61(4)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Science+Business Media New York

About this chapter

Cite this chapter

Washburn, A. (2014). Blotto Games. In: Two-Person Zero-Sum Games. International Series in Operations Research & Management Science, vol 201. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-9050-0_6

Download citation

Publish with us

Policies and ethics