IDEAS home Printed from https://ideas.repec.org/a/eee/ecolet/v117y2012i1p272-275.html
   My bibliography  Save this article

The assortative matching scheme in a survival battle

Author

Listed:
  • Aloni, Elad
  • Sela, Aner

Abstract

We consider a battle between two groups D (defenders) and A (attackers). Each group has the same number of agents, but they differ by their abilities. Every agent confronts only one opponent from the other group once in either an all-pay contest or a Tullock contest such that the number of the contests is identical to the number of the agents in each group. The object of group D is to win all the contests in order to survive, or else it will be defeated by group A. We analyze the optimal matching scheme for group D and show that the assortative matching scheme, in which the two agents with the highest ability from each group confront each other, the two agents with the second highest ability from each group confront each other, and so on, is the optimal matching scheme for maximizing group D’s probability to survive the battle.

Suggested Citation

  • Aloni, Elad & Sela, Aner, 2012. "The assortative matching scheme in a survival battle," Economics Letters, Elsevier, vol. 117(1), pages 272-275.
    • Handle: RePEc:eee:ecolet:v:117:y:2012:i:1:p:272-275
    DOI: 10.1016/j.econlet.2012.05.038
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165176512003060
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.econlet.2012.05.038?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. Konrad, Kai A., 2009. "Strategy and Dynamics in Contests," OUP Catalogue, Oxford University Press, number 9780199549603.
    2. Arye L. Hillman & John G. Riley, 1989. "Politically Contestable Rents And Transfers," Economics and Politics, Wiley Blackwell, vol. 1(1), pages 17-39, March.
    3. Michael R. Baye & Dan Kovenock & Casper G. Vries, 1996. "The all-pay auction with complete information," Springer Books, in: Roger D. Congleton & Arye L. Hillman & Kai A. Konrad (ed.), 40 Years of Research on Rent Seeking 1, pages 209-223, Springer.
    4. 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.
    5. 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.
    6. Klumpp, Tilman & Polborn, Mattias K., 2006. "Primaries and the New Hampshire Effect," Journal of Public Economics, Elsevier, vol. 90(6-7), pages 1073-1114, August.
    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. Emmanuel Dechenaux & Dan Kovenock & Roman Sheremeta, 2015. "A survey of experimental research on contests, all-pay auctions and tournaments," Experimental Economics, Springer;Economic Science Association, vol. 18(4), pages 609-669, December.
    2. 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.
    3. 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.
    4. Konrad, Kai A. & Morath, Florian, 2023. "How to preempt attacks in multi-front conflict with limited resources," European Journal of Operational Research, Elsevier, vol. 305(1), pages 493-500.
    5. Häfner, Samuel, 2017. "A tug-of-war team contest," Games and Economic Behavior, Elsevier, vol. 104(C), pages 372-391.
    6. Subhasish M. Chowdhury & Patricia Esteve‐González & Anwesha Mukherjee, 2023. "Heterogeneity, leveling the playing field, and affirmative action in contests," Southern Economic Journal, John Wiley & Sons, vol. 89(3), pages 924-974, January.
    7. Aner Sela, 2016. "Two Stage Contests With Effort-Dependent Rewards," Working Papers 1612, Ben-Gurion University of the Negev, Department of Economics.
    8. Gilat Levy & Ronnie Razin, 2009. "Gradualism in Dynamic Agenda Formation," STICERD - Theoretical Economics Paper Series 543, Suntory and Toyota International Centres for Economics and Related Disciplines, LSE.
    9. 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.
    10. 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.
    11. Subhasish M. Chowdhury & Dongryul Lee & Iryna Topolyan, 2013. "The Max-Min Group Contest," University of East Anglia Applied and Financial Economics Working Paper Series 050, School of Economics, University of East Anglia, Norwich, UK..
    12. Ewerhart, Christian, 2017. "Contests with small noise and the robustness of the all-pay auction," Games and Economic Behavior, Elsevier, vol. 105(C), pages 195-211.
    13. Shakun D. Mago & Roman M. Sheremeta, 2017. "Multi‐battle Contests: An Experimental Study," Southern Economic Journal, John Wiley & Sons, vol. 84(2), pages 407-425, October.
    14. Aner Sela, 2017. "Two-stage contests with effort-dependent values of winning," Review of Economic Design, Springer;Society for Economic Design, vol. 21(4), pages 253-272, December.
    15. Kaplan, Todd R. & Zamir, Shmuel, 2015. "Advances in Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
    16. 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.
    17. Konrad, Kai A., 2010. "Dynamic contests," Discussion Papers, Research Professorship & Project "The Future of Fiscal Federalism" SP II 2010-10, WZB Berlin Social Science Center.
    18. Tilman Klumpp & Xuejuan Su, 2013. "A theory of perceived discrimination," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 53(1), pages 153-180, May.
    19. Konrad, Kai A., 2007. "Strategy in contests: an introduction [Strategie in Turnieren – eine Einführung]," Discussion Papers, Research Unit: Market Processes and Governance SP II 2007-01, WZB Berlin Social Science Center.
    20. Klumpp, Tilman & Konrad, Kai A. & Solomon, Adam, 2019. "The dynamics of majoritarian Blotto games," Games and Economic Behavior, Elsevier, vol. 117(C), pages 402-419.

    More about this item

    Keywords

    Tullock contests; All-pay auctions; Assortative matching;
    All these keywords.

    JEL classification:

    • D44 - Microeconomics - - Market Structure, Pricing, and Design - - - Auctions
    • D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design

    Statistics

    Access and download statistics

    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:eee:ecolet:v:117:y:2012:i:1:p:272-275. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ecolet .

    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.