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

[1]  R. Selten,et al.  Experimental Sealed Bid First Price Auctions with Directly Observed Bid Functions , 1994 .

[2]  R. Rosenthal A class of games possessing pure-strategy Nash equilibria , 1973 .

[3]  Roy Radner,et al.  Introduction: Symposium on Noncooperative Bargaining , 1989 .

[4]  Implicit Coalitions in a Generalized Prisoner's Dilemma , 1988 .

[5]  Darryl A. Seale,et al.  Strategic Play and Adaptive Learning in the Sealed-Bid Bargaining Mechanism. , 1998, Journal of mathematical psychology.

[6]  Mark A. Fuller,et al.  Bidding strategies in a bilateral monopoly with two-sided incomplete information , 1995 .

[7]  W. Hamilton,et al.  The Evolution of Cooperation , 1984 .

[8]  Werner Güth,et al.  Equilibrium Point Selection in a Class of Market Entry Games , 1982 .

[9]  Igal Milchtaich Crowding games are sequentially solvable , 1998, Int. J. Game Theory.

[10]  I. Milchtaich,et al.  Congestion Games with Player-Specific Payoff Functions , 1996 .

[11]  Richard J. Gilbert,et al.  Investment and Coordination in Oligopolistic Industries , 1987 .

[12]  R. Nagel,et al.  Experimental results on ultimatum games with incomplete information , 1993 .

[13]  Amnon Rapoport,et al.  Coordination in market entry games with symmetric players , 1995 .

[14]  Eyal Winter,et al.  Coordination and Learning Behavior in Large Groups with Asymmetric Players , 2002, Games Econ. Behav..

[15]  R. Radner,et al.  The Sealed-Bid Mechanism: An Experimental Study* , 1989 .

[16]  Andrew Schotter,et al.  Behavior And Efficiency In The Sealed-Bid Mechanism , 1990 .

[17]  J. Kagel,et al.  Handbook of Experimental Economics , 1997 .

[18]  Ido Erev,et al.  Equilibrium Play in Large Group Market Entry Games , 1998 .

[19]  R. Selten,et al.  Duopoly Strategies Programmed by Experienced Players , 1997 .

[20]  Darryl A. Seale,et al.  Reinforcement-Based Adaptive Learning in Asymmetric Two-Person Bargaining with Incomplete Information , 1998 .