The assortative matching scheme in a survival battle
AbstractWe 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal Economics Letters.
Volume (Year): 117 (2012)
Issue (Month): 1 ()
Contact details of provider:
Web page: http://www.elsevier.com/locate/ecolet
Tullock contests; All-pay auctions; Assortative matching;
Find related papers by JEL classification:
- D44 - Microeconomics - - Market Structure and Pricing - - - Auctions
- D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Brian Roberson, 2006. "The Colonel Blotto game," Economic Theory, Springer, vol. 29(1), pages 1-24, September.
- Kovenock, D. & de Vries, C.G., 1995.
"The All-Pay Auction with Complete Information,"
UFAE and IAE Working Papers
311.95, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
- Baye, M.R. & Kovenock, D. & De Vries, C., 1992. "The All-Pay Auction with Complete Information," Papers 8-92-1, Pennsylvania State - Department of Economics.
- Baye, M.R. & Kovenock, D. & De Varies, C.G., 1990. "The All-Pay Auction With Complete Information," Papers 9051, Tilburg - Center for Economic Research.
- Baye, M.R. & Kovenock, D. & De Vries, C.G., 1991. "The All-Pay Auction With Complete Information," Purdue University Economics Working Papers 1007, Purdue University, Department of Economics.
- Baye, M. & Kovenock, D. & Vries, C. de, 1990. "The All-Pay Auction with Complete Information," Discussion Paper 1990-51, Tilburg University, Center for Economic Research.
- Dan Kovenock & Brian Roberson, 2010. "The Optimal Defense of Networks of Targets," Purdue University Economics Working Papers 1251, Purdue University, Department of Economics.
- Konrad, Kai A., 2009. "Strategy and Dynamics in Contests," OUP Catalogue, Oxford University Press, number 9780199549603.
- Arye L. Hillman & John G. Riley, 1987.
"Politically Contestable Rents and Transfers,"
UCLA Economics Working Papers
452, UCLA Department of Economics.
- 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.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
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 references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link 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 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.