Competition for a Majority
We define the class of two-player zero-sum games with payoffs having mild discontinuities, which in applications typically stem from how ties are resolved. For games in this class we establish sufficient conditions for existence of a value of the game and minimax or Nash equilibrium strategies for the players. We prove first that if all discontinuities favor one player then a value exists and that player has a minimax strategy. Then we establish that a general property called payoff approachability implies that the value results from equilibrium. We prove further that this property implies that every modification of the discontinuities yields the same value; in particular, for every modification, epsilon-equilibria exist. We apply these results to models of elections in which two candidates propose policies and a candidate wins election if a weighted majority of voters prefer his policy. We provide tie-breaking rules and assumptions on voters' preferences sufficient to imply payoff approachability, hence existence of equilibria, and each other tie-breaking rule yields the same value and has epsilon-equilibria. These conclusions are also derived for the special case of Colonel Blotto games in which each candidate allocates his available resources among several constituencies and the assumption on voters' preferences is that a candidate gets votes from those constituencies allocated more resources than his opponent offers. Moreover, for the case of simple-majority rule we prove existence of an equilibrium that has zero probability of ties.
|Date of creation:||Jun 2012|
|Date of revision:|
|Contact details of provider:|| Postal: Stanford University, Stanford, CA 94305-5015|
Phone: (650) 723-2146
Web page: http://gsbapps.stanford.edu/researchpapers/
More information through EDIRC
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.:
- Sergiu Hart, 2006.
"Discrete Colonel Blotto and General Lotto Games,"
321307000000000532, UCLA Department of Economics.
- Brian Roberson & Dmitriy Kvasov, 2012.
"The non-constant-sum Colonel Blotto game,"
Springer;Society for the Advancement of Economic Theory (SAET), vol. 51(2), pages 397-433, October.
- Brian Roberson & Dmitriy Kvasov, 2008. "The Non-Constant-Sum Colonel Blotto Game," CESifo Working Paper Series 2378, CESifo Group Munich.
- Brian Roberson & Dmitriy Kvasov, 2010. "The Non-Constant-Sum Colonel Blotto Game," Purdue University Economics Working Papers 1252, Purdue University, Department of Economics.
- Brian Roberson & Dmitriy Kvasov, 2010. "The Non-Constant-Sum Colonel Blotto Game," School of Economics Working Papers 2010-31, University of Adelaide, School of Economics.
- Roger B. Myerson & Daniel Diermeier, 1999. "Bicameralism and Its Consequences for the Internal Organization of Legislatures," American Economic Review, American Economic Association, vol. 89(5), pages 1182-1196, December.
- Kvasov, Dmitriy, 2007. "Contests with limited resources," Journal of Economic Theory, Elsevier, vol. 136(1), pages 738-748, September.
- Duggan, John, 2007. "Equilibrium existence for zero-sum games and spatial models of elections," Games and Economic Behavior, Elsevier, vol. 60(1), pages 52-74, July.
- Philip J. Reny, 1999. "On the Existence of Pure and Mixed Strategy Nash Equilibria in Discontinuous Games," Econometrica, Econometric Society, vol. 67(5), pages 1029-1056, September.
- 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.
When requesting a correction, please mention this item's handle: RePEc:ecl:stabus:2104. 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: ()
If references are entirely missing, you can add them using this form.