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

    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. Dan Kovenock & Michael R. Baye & Casper G. de Vries, 1996. "The all-pay auction with complete information (*)," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 8(2), pages 291-305.
    4. Dan Kovenock & Brian Roberson, 2010. "The Optimal Defense of Networks of Targets," Purdue University Economics Working Papers 1251, Purdue University, Department of Economics.
    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)

    More about this item

    Keywords

    Tullock contests; All-pay auctions; Assortative matching;

    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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu). General contact details of provider: http://www.elsevier.com/locate/ecolet .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.