Elicitation of Strategy Profiles in Large Group Coordination Games
The strategy method is an experimental procedure for eliciting a complete strategy of play for all information sets, not only the ones that happen to be reached during the course of a play of a game. We use it to elicit individual strategy profiles for a class of large group, market entry games in which the payoff for a player who enters on a given market capacity value decreases linearly in the difference between the capacity value and the corresponding number of entrants. Our results show that the aggregate frequencies of entry do not differ from previous results obtained under the more common decision method. Under both methods, the number of entrants across a large set of market capacity values is organized remarkably well by the equilibrium solution. In contrast, theindividual profiles do not support mixed equilibrium play; only three of the sixty profiles suggest attempts at randomization or “mixing” between periods. About half of the individual profiles appear to converge, albeit slowly, to cutoff decision policies and more than a quarter of the profiles exhibit a variety of patterns that defy classification. Copyright Kluwer Academic Publishers 2000
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.
Volume (Year): 3 (2000)
Issue (Month): 2 (October)
|Contact details of provider:|| Web page: http://www.springer.com|
More information through EDIRC
|Order Information:||Web: http://www.springer.com/economics/economic+theory/journal/10683/PS2|
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.:
- Reinhard Selten & Michael Mitzkewitz & Gerald R. Uhlich, 1997.
"Duopoly Strategies Programmed by Experienced Players,"
Econometric Society, vol. 65(3), pages 517-556, May.
- Selten,Reinhard & Mitzkewitz,Michael & Uhlich,Gerald, . "Duopoly strategies programmed by experienced players," Discussion Paper Serie B 106, University of Bonn, Germany.
- Mitzkewitz, Michael & Nagel, Rosemarie, 1993. "Experimental Results on Ultimatum Games with Incomplete Information," International Journal of Game Theory, Springer;Game Theory Society, vol. 22(2), pages 171-98.
- Radner, Roy & Schotter, Andrew, 1987.
"The Sealed-Bid Mechanism: An Experimental Study,"
87-41, C.V. Starr Center for Applied Economics, New York University.
- Richard J. Gilbert and Marvin Lieberman., 1987.
"Investment and Coordination in Oligopolistic Industries,"
Economics Working Papers
8730, University of California at Berkeley.
- Richard J. Gilbert & Marvin Lieberman, 1987. "Investment and Coordination in Oligopolistic Industries," RAND Journal of Economics, The RAND Corporation, vol. 18(1), pages 17-33, Spring.
- Gilbert, Richard J., 1987. "Investment and Coordination in Oligopolistic Industries," Department of Economics, Working Paper Series qt51b0f7sq, Department of Economics, Institute for Business and Economic Research, UC Berkeley.
- Milchtaich, Igal, 1996. "Congestion Games with Player-Specific Payoff Functions," Games and Economic Behavior, Elsevier, vol. 13(1), pages 111-124, March.
- Linhart, Peter & Radner, Roy & Schotter, Andrew, 1990. "Behavior And Efficiency In The Sealed-Bid Mechanism," Working Papers 90-51, C.V. Starr Center for Applied Economics, New York University.
- Amnon Rapoport & Terry Daniel & Darryl Seale, 1998. "Reinforcement-Based Adaptive Learning in Asymmetric Two-Person Bargaining with Incomplete Information," Experimental Economics, Springer;Economic Science Association, vol. 1(3), pages 221-253, December.
- Igal Milchtaich, 1998. "Crowding games are sequentially solvable," International Journal of Game Theory, Springer;Game Theory Society, vol. 27(4), pages 501-509.
- Sundali, James A. & Rapoport, Amnon & Seale, Darryl A., 1995. "Coordination in Market Entry Games with Symmetric Players," Organizational Behavior and Human Decision Processes, Elsevier, vol. 64(2), pages 203-218, November.
- Rapoport, Amnon & Seale, Darryl A. & Winter, Eyal, 2002. "Coordination and Learning Behavior in Large Groups with Asymmetric Players," Games and Economic Behavior, Elsevier, vol. 39(1), pages 111-136, April.
- Linhart, Peter & Radner, Roy & Satterthwaite, Mark, 1989. "Introduction: Symposium on Noncooperative Bargaining," Journal of Economic Theory, Elsevier, vol. 48(1), pages 1-17, June.
- Selten, Reinhard & Joachim Buchta, 1994. "Experimental Sealed Bid First Price Auctions with Directly Observed Bid Functions," Discussion Paper Serie B 270, University of Bonn, Germany.
When requesting a correction, please mention this item's handle: RePEc:kap:expeco:v:3:y:2000:i:2:p:153-179. 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: (Sonal Shukla)or (Rebekah McClure)
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.