IDEAS home Printed from https://ideas.repec.org/a/kap/compec/v59y2022i2d10.1007_s10614-021-10108-7.html
   My bibliography  Save this article

The Benefits of Fractionation in Competitive Resource Allocation

Author

Listed:
  • Jonathan Lamb

    (Pardee RAND Graduate School)

  • Justin Grana

    (Microsoft Corporation and Pardee RAND Graduate School)

  • Nicholas O’Donoughue

    (RAND Corporation)

Abstract

We leverage a new algorithm for numerically solving Colonel Blotto games to gain insight into a version of the game where players have different types of resources. Specifically, the winner of a battlefield is a function of a multi-dimensional allocation vector of each player. Our main focus is on the potential benefits of fractionation, which we define as the degree to which a player can quantize its resources. When players only have one type of resource, we show that the benefits to fractionation are in general, greatest in resource poor environments and against aggregated adversaries. We then extend the model to include random dropout and show that fractionation increases robustness to failure in resource poor environments but not resource rich environments. Finally, we show that when players have different types of resources, the benefits of fractionation are no longer mitigated by an increase in the total force size. Since many real-world resource allocation problems are multi-dimensional, our results illustrate the importance of analyzing multi-resource Blotto games in tandem with the traditional specification.

Suggested Citation

  • Jonathan Lamb & Justin Grana & Nicholas O’Donoughue, 2022. "The Benefits of Fractionation in Competitive Resource Allocation," Computational Economics, Springer;Society for Computational Economics, vol. 59(2), pages 831-852, February.
    • Handle: RePEc:kap:compec:v:59:y:2022:i:2:d:10.1007_s10614-021-10108-7
    DOI: 10.1007/s10614-021-10108-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10614-021-10108-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10614-021-10108-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Weinstein Jonathan, 2012. "Two Notes on the Blotto Game," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 12(1), pages 1-13, March.
    2. Brian Roberson & Dmitriy Kvasov, 2012. "The non-constant-sum Colonel Blotto game," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 51(2), pages 397-433, October.
    3. Maria Arbatskaya & Hugo M. Mialon, 2012. "Dynamic Multi‐Activity Contests," Scandinavian Journal of Economics, Wiley Blackwell, vol. 114(2), pages 520-538, June.
    4. Yosef Rinott & Marco Scarsini & Yaming Yu, 2012. "A Colonel Blotto Gladiator Game," Mathematics of Operations Research, INFORMS, vol. 37(4), pages 574-590, November.
    5. Lawrence Friedman, 1958. "Game-Theory Models in the Allocation of Advertising Expenditures," Operations Research, INFORMS, vol. 6(5), pages 699-709, October.
    6. Sergiu Hart, 2008. "Discrete Colonel Blotto and General Lotto games," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 441-460, March.
    7. Russell Golman & Scott Page, 2009. "General Blotto: games of allocative strategic mismatch," Public Choice, Springer, vol. 138(3), pages 279-299, March.
    8. Crutzen, Benoît S.Y. & Sahuguet, Nicolas, 2009. "Redistributive politics with distortionary taxation," Journal of Economic Theory, Elsevier, vol. 144(1), pages 264-279, January.
    9. Brian Roberson, 2006. "The Colonel Blotto game," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 29(1), pages 1-24, September.
    10. Maria Arbatskaya & Hugo Mialon, 2010. "Multi-activity contests," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 43(1), pages 23-43, April.
    11. Caroline Thomas, 2018. "N-dimensional Blotto game with heterogeneous battlefield values," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 65(3), pages 509-544, May.
    12. Snyder, James M, 1989. "Election Goals and the Allocation of Campaign Resources," Econometrica, Econometric Society, vol. 57(3), pages 637-660, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Dan Kovenock & Brian Roberson, 2021. "Generalizations of the General Lotto and Colonel Blotto games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 71(3), pages 997-1032, April.
    2. Subhasish M Chowdhury & Dan Kovenock & David Rojo Arjona & Nathaniel T Wilcox, 2021. "Focality and Asymmetry in Multi-Battle Contests," The Economic Journal, Royal Economic Society, vol. 131(636), pages 1593-1619.
    3. Dan Kovenock & Brian Roberson, 2018. "The Optimal Defense Of Networks Of Targets," Economic Inquiry, Western Economic Association International, vol. 56(4), pages 2195-2211, October.
    4. Duffy, John & Matros, Alexander, 2017. "Stochastic asymmetric Blotto games: An experimental study," Journal of Economic Behavior & Organization, Elsevier, vol. 139(C), pages 88-105.
    5. Dan Kovenock & Brian Roberson & Roman M. Sheremeta, 2019. "The attack and defense of weakest-link networks," Public Choice, Springer, vol. 179(3), pages 175-194, June.
    6. Dan Kovenock & Sudipta Sarangi & Matt Wiser, 2015. "All-pay 2 $$\times $$ × 2 Hex: a multibattle contest with complementarities," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(3), pages 571-597, August.
    7. Boix-Adserà, Enric & Edelman, Benjamin L. & Jayanti, Siddhartha, 2021. "The multiplayer Colonel Blotto game," Games and Economic Behavior, Elsevier, vol. 129(C), pages 15-31.
    8. Subhasish Chowdhury & Dan Kovenock & Roman Sheremeta, 2013. "An experimental investigation of Colonel Blotto games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 52(3), pages 833-861, April.
    9. David Rietzke & Brian Roberson, 2013. "The robustness of ‘enemy-of-my-enemy-is-my-friend’ alliances," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 40(4), pages 937-956, April.
    10. Dan J. Kovenock & Brian Roberson, 2015. "The Optimal Defense of Network Connectivity," CESifo Working Paper Series 5653, CESifo.
    11. Deck, Cary & Sarangi, Sudipta & Wiser, Matt, 2017. "An experimental investigation of simultaneous multi-battle contests with strategic complementarities," Journal of Economic Psychology, Elsevier, vol. 63(C), pages 117-134.
    12. Boyer, Pierre C. & Konrad, Kai A. & Roberson, Brian, 2017. "Targeted campaign competition, loyal voters, and supermajorities," Journal of Mathematical Economics, Elsevier, vol. 71(C), pages 49-62.
    13. Deck, Cary & Hao, Li & Porter, David, 2015. "Do prediction markets aid defenders in a weak-link contest?," Journal of Economic Behavior & Organization, Elsevier, vol. 117(C), pages 248-258.
    14. Kimbrough, Erik O. & Laughren, Kevin & Sheremeta, Roman, 2020. "War and conflict in economics: Theories, applications, and recent trends," Journal of Economic Behavior & Organization, Elsevier, vol. 178(C), pages 998-1013.
    15. Cortes-Corrales, Sebastián & Gorny, Paul M., 2018. "Generalising Conflict Networks," MPRA Paper 90001, University Library of Munich, Germany.
    16. John Duffy & Alexander Matros, 2013. "Stochastic Asymmetric Blotto Games: Theory and Experimental Evidence," Working Paper 509, Department of Economics, University of Pittsburgh, revised Nov 2013.
    17. Daniel Rehsmann, 2023. "The Sumo coach problem," Review of Economic Design, Springer;Society for Economic Design, vol. 27(3), pages 669-700, September.
    18. Enric Boix-Adser`a & Benjamin L. Edelman & Siddhartha Jayanti, 2020. "The Multiplayer Colonel Blotto Game," Papers 2002.05240, arXiv.org, revised May 2021.
    19. Aner Sela, 2022. "Ineffective Prizes In Multi-Dimensional Contests," Working Papers 2205, Ben-Gurion University of the Negev, Department of Economics.
    20. Yosef Rinott & Marco Scarsini & Yaming Yu, 2012. "A Colonel Blotto Gladiator Game," Mathematics of Operations Research, INFORMS, vol. 37(4), pages 574-590, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:kap:compec:v:59:y:2022:i:2:d:10.1007_s10614-021-10108-7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.