A Blotto game with multi-dimensional incomplete information
We examine a multi-dimensional incomplete information Colonel Blotto game in which each player’s n-tuple of battlefield valuations is drawn from a common n-variate joint distribution function that is uniform on the non-negative orthant of the surface of a sphere.
If 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.
References listed on IDEAS
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.:
- repec:pit:wpaper:332 is not listed on IDEAS
- 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.
- Dan Kovenock J. & Brian Roberson, 2010.
"Conflicts with Multiple Battlefields,"
CESifo Working Paper Series
3165, CESifo Group Munich.
- Dan Kovenock & Brian Roberson, 2010. "Conflicts with Multiple Battlefields," Purdue University Economics Working Papers 1246, Purdue University, Department of Economics.
- Pitchik, Carolyn, 2009. "Budget-constrained sequential auctions with incomplete information," Games and Economic Behavior, Elsevier, vol. 66(2), pages 928-949, July.
- Carolyn Pitchik, 1989. "Budget-Constrained Sequential Auctions With Incomplete Information," STICERD - Theoretical Economics Paper Series 201, Suntory and Toyota International Centres for Economics and Related Disciplines, LSE.
- Carolyn Pitchik, 2008. "Budget-Constrained Sequential Auctions with Incomplete Information," Working Papers tecipa-342, University of Toronto, Department of Economics.
- Carolyn Pitchik, 2006. "Budget-Constrained Sequential Auctions with Incomplete Information," Working Papers tecipa-230, University of Toronto, Department of Economics.
- Amann, Erwin & Leininger, Wolfgang, 1996. "Asymmetric All-Pay Auctions with Incomplete Information: The Two-Player Case," Games and Economic Behavior, Elsevier, vol. 14(1), pages 1-18, May.
- Yeon-Koo Che & Ian Gale, 1998. "Standard Auctions with Financially Constrained Bidders," Review of Economic Studies, Oxford University Press, vol. 65(1), pages 1-21.
- Adamo, Tim & Matros, Alexander, 2009. "A Blotto game with Incomplete Information," Economics Letters, Elsevier, vol. 105(1), pages 100-102, October.
- Krishna, Vijay & Morgan, John, 1997. "An Analysis of the War of Attrition and the All-Pay Auction," Journal of Economic Theory, Elsevier, vol. 72(2), pages 343-362, February.
- Vijay Krishna & John Morgan, 1994. "An Analysis of the War of Attrition and the All-Pay Auction," Game Theory and Information 9409002, EconWPA.
When requesting a correction, please mention this item's handle: RePEc:eee:ecolet:v:113:y:2011:i:3:p:273-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)
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.