Please use this identifier to cite or link to this item: https://hdl.handle.net/2440/74031
Citations
Scopus Web of Science® Altmetric
?
?
Full metadata record
DC FieldValueLanguage
dc.contributor.authorRoberson, B.-
dc.contributor.authorKvasov, D.-
dc.date.issued2012-
dc.identifier.citationEconomic Theory, 2012; 51(2):397-433-
dc.identifier.issn0938-2259-
dc.identifier.issn1432-0479-
dc.identifier.urihttp://hdl.handle.net/2440/74031-
dc.description.abstractThe Colonel Blotto game is a two-player constant-sum game in which each player simultaneously distributes his fixed level of resources across a set of contests. In the traditional formulation of the Colonel Blotto game, the players’ resources are “use it or lose it” in the sense that any resources that are not allocated to one of the contests are forfeited. This article examines a non-constant-sum version of the Colonel Blotto game that relaxes this use it or lose it feature. We find that if the level of asymmetry between the players’ budgets is below a threshold, then there exists a one-to-one mapping from the unique set of equilibrium univariate marginal distribution functions in the constant-sum game to those in the non-constant-sum game. Once the asymmetry of the players’ budgets exceeds the threshold, this relationship breaks down and we construct a new equilibrium.-
dc.description.statementofresponsibilityBrian Roberson and Dmitriy Kvasov-
dc.language.isoen-
dc.publisherSpringer-Verlag-
dc.rights© Springer-Verlag 2011-
dc.source.urihttp://dx.doi.org/10.1007/s00199-011-0673-z-
dc.subjectColonel Blotto game-
dc.subjectall-pay auction-
dc.subjectcontests-
dc.subjectmixed strategies-
dc.subjectmulti-dimensional contest-
dc.titleThe non-constant-sum Colonel Blotto game-
dc.typeJournal article-
dc.identifier.doi10.1007/s00199-011-0673-z-
pubs.publication-statusPublished-
Appears in Collections:Aurora harvest 4
Economics publications

Files in This Item:
File Description SizeFormat 
RA_hdl_74031.pdf
  Restricted Access
Restricted Access559.67 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.