Skip to main content
SpringerLink
Log in

Colonel Blotto Game with Coalition Formation for Sharing Resources

  • Conference paper
  • First Online:
Decision and Game Theory for Security (GameSec 2018)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 11199))

Included in the following conference series:

  • 1846 Accesses

Abstract

In this paper, we consider a 4-player, two stage Colonel Blotto game in which one player, the attacker, simultaneously participates in three disjoint Colonel Blotto games against three defenders. During the first stage of the game, the defenders can choose to form independent coalitions by transferring resources (troops, funds, computing resources, etc.) among each other if the transfer benefits the defenders involved. In the second stage, the attacker observes these transfers among defenders and then allocates a portion of his overall resources to fight against each defender. We find that the formation of coalitions depends on both the ratios of resources between the attacker and the defenders and on each defender’s total battlefield value to resource ratio. For one parameter region, we completely characterize the subgame-perfect Nash equilibrium. For another parameter region, we show that there are parameters of the game for which transfers occur and provide a computational method to calculate those transfers.

The first author was fully supported by the United States Military Academy and the Army Advanced Civil Schooling (ACS) program.

The second author gratefully acknowledges support from NSF Grant 1565487.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

  1. Bertsekas, D.P.: Nonlinear Programming, 2nd edn, pp. 196–197. Athena Scientific, Belmont (1999)

    Google Scholar 

  2. Borel, E.: La théorie du jeu et les équations intégrales à noyau symétrique. Comptes rendus de l’Académie des Sciences 173(1304–1308), 58 (1921)

    MATH  Google Scholar 

  3. Borel, E.: The theory of play and integral equations with skew symmetric kernels. Econometrica: J. Econ. S. 97–100 (1953). https://doi.org/10.2307/1906946

    Article  MathSciNet  Google Scholar 

  4. Borel, E., Ville, J.: Applications de la théorie des probabilités aux jeux de hasard. J. Gabay, Paris (1938)

    Google Scholar 

  5. Chia, P.H., Chuang, J.: Colonel Blotto in the phishing war. In: Baras, J.S., Katz, J., Altman, E. (eds.) GameSec 2011. LNCS, vol. 7037, pp. 201–218. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-25280-8_16

    Chapter  Google Scholar 

  6. Ferdowsi, A., Sanjab, A., Saad, W., Başar, T.: Generalized Colonel Blotto game. arXiv preprint arXiv:1710.01381 (2017)

  7. Friedman, L.: Game-theory models in the allocation of advertising expenditures. Oper. Res. 6(5), 699–709 (1958). https://doi.org/10.1287/opre.6.5.699

    Article  MathSciNet  Google Scholar 

  8. Golman, R., Page, S.E.: General Blotto: games of allocative strategic mismatch. Public Choice 138(3–4), 279–299 (2009). https://doi.org/10.1007/s11127-008-9359-x

    Article  Google Scholar 

  9. Gross, O., Wagner, R.: A continuous Colonel Blotto game. Technical report. Rand Project Air Force, Santa Monica, CA (1950)

    Google Scholar 

  10. Gupta, A., Başar, T., Schwartz, G.A.: A three-stage Colonel Blotto game: when to provide more information to an adversary. In: Poovendran, R., Saad, W. (eds.) GameSec 2014. LNCS, vol. 8840, pp. 216–233. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-12601-2_12

    Chapter  MATH  Google Scholar 

  11. Gupta, A., Schwartz, G., Langbort, C., Sastry, S.S., Başar, T.: A three-stage Colonel Blotto game with applications to cyberphysical security. In: American Control Conference, ACC, pp. 3820–3825. IEEE (2014). https://doi.org/10.1109/acc.2014.6859164

  12. Hajimirsaadeghi, M., Mandayam, N.B.: A dynamic Colonel Blotto game model for spectrum sharing in wireless networks. In: 2017 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton, pp. 287–294. IEEE (2017). https://doi.org/10.1109/ALLERTON.2017.8262750

  13. Kovenock, D., Mauboussin, M.J., Roberson, B.: Asymmetric conflicts with endogenous dimensionality. Korean Econ. Rev. 26, 287–305 (2010)

    Google Scholar 

  14. Kovenock, D., Roberson, B.: Coalitional Colonel Blotto games with application to the economics of alliances. J. Public Econ. Theory 14(4), 653–676 (2012). https://doi.org/10.1111/j.1467-9779.2012.01556.x

    Article  Google Scholar 

  15. Kvasov, D.: Contests with limited resources. J. Econ. Theory 136(1), 738–748 (2007). https://doi.org/10.1016/j.jet.2006.06.007

    Article  MathSciNet  MATH  Google Scholar 

  16. Labib, M., Ha, S., Saad, W., Reed, J.H.: A Colonel Blotto game for anti-jamming in the Internet of Things. In: 2015 IEEE Global Communications Conference, GLOBECOM, pp. 1–6. IEEE (2015). https://doi.org/10.1109/GLOCOM.2015.7417437

  17. Roberson, B.: The Colonel Blotto game. Econ. Theory 29(1), 1–24 (2006). https://doi.org/10.1007/s00199-005-0071-5

    Article  MathSciNet  MATH  Google Scholar 

  18. Roberson, B.: Errata: the Colonel Blotto game. Technical report. Purdue’s Krannert School (2010). Working paper

    Google Scholar 

  19. Snyder, J.M.: Election goals and the allocation of campaign resources. Econometrica: J. Econ. Soc. 637–660 (1989). https://doi.org/10.2307/1911056

    Article  MathSciNet  Google Scholar 

  20. Wu, Y., Wang, B., Liu, K.R.: Optimal power allocation strategy against jamming attacks using the Colonel Blotto game. In: Global Telecommunications Conference, GLOBECOM 2009, pp. 1–5. IEEE (2009). https://doi.org/10.1109/GLOCOM.2009.5425760

Download references

Author information

Authors and Affiliations

  1. The Ohio State University, Columbus, OH, 43210, USA

    Joseph L. Heyman & Abhishek Gupta

Authors
  1. Joseph L. Heyman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Abhishek Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Joseph L. Heyman .

Editor information

Editors and Affiliations

  1. University of Washington, Seattle, WA, USA

    Linda Bushnell

  2. University of Washington, Seattle, WA, USA

    Radha Poovendran

  3. University of Illinois at Urbana–Champaign, Urbana, IL, USA

    Tamer Başar

Rights and permissions

Reprints and permissions

Copyright information

© 2018 This is a U.S. government work and not under copyright protection in the U.S.; foreign copyright protection may apply 2018

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Heyman, J.L., Gupta, A. (2018). Colonel Blotto Game with Coalition Formation for Sharing Resources. In: Bushnell, L., Poovendran, R., Başar, T. (eds) Decision and Game Theory for Security. GameSec 2018. Lecture Notes in Computer Science(), vol 11199. Springer, Cham. https://doi.org/10.1007/978-3-030-01554-1_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-01554-1_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-01553-4

  • Online ISBN: 978-3-030-01554-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation