First-Mover Advantage In Two-Sided Competitions: An Experimental Comparison Of Role-Assignment Rules
Kingston (1976) and Anderson (1977) show that the probability that a given contestant wins a best-of-2k+1 series of asymmetric, zero-sum, binary-outcome games is, for a large class of assignment rules, independent of which contestant is assigned the advantageous role in each component game. We design a laboratory experiment to test this hypothesis for four simple role-assignment rules. Despite the fact that play does not uniformly conform to the equilibrium, our results show that the four assignment rules are observationally equivalent at the series level: the fraction of series won by a given contestant and all other series outcomes do not differ across the four rules.
|Date of creation:||2012|
|Contact details of provider:|| Postal: P.O.B 653, Beer-Sheva 8410501|
Web page: http://www.bgu.ac.il/econ
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.:
- Binmore, Ken, 2007. "Playing for Real: A Text on Game Theory," OUP Catalogue, Oxford University Press, number 9780195300574.
- Wooders, John & Shachat, Jason M., 2001. "On the Irrelevance of Risk Attitudes in Repeated Two-Outcome Games," Games and Economic Behavior, Elsevier, vol. 34(2), pages 342-363, February.
- Urs Fischbacher, 2007. "z-Tree: Zurich toolbox for ready-made economic experiments," Experimental Economics, Springer;Economic Science Association, vol. 10(2), pages 171-178, June.
When requesting a correction, please mention this item's handle: RePEc:bgu:wpaper:1208. 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: (Aamer Abu-Qarn)
If references are entirely missing, you can add them using this form.