Computer Testbeds and Mechanism Design

We develop a behavioral model as a a computer testbed we can use to study the probable performance of a wide range of mechanisms prior to testing them in a laboratory or using them in practice. In this paper, we describe an implementation of our model and the computer testbed methodology to Groves-Ledyard (1977) mechanisms for provision of public goods. Previous experimental evidence, and some theory, strongly suggest that the value of a free mechanism parameter is important for the dynamic performance of the mechanism (when it is simulated as a repeated game). In our model messages converge to the Nash Equilibrium for all of the values of the mechanism parameter that we studied. However, the convergence times depend on the value of the parameter. Our analysis suggests there are values of the free parameter that result in the fastest convergence. The range of values is robust with respect to the changes in the behavioral model’s parameter values and details of the updating procedures. This prediction is validated with data from experiments with human subjects. JEL classification: D83, C63, C92, H41

[1]  Marco Casari Can Genetic Algorithms Explain Experimental Anomalies? , 2004 .

[2]  Jasmina Arifovic EVOLUTIONARY ALGORITHMS IN MACROECONOMIC MODELS , 2000, Macroeconomic Dynamics.

[3]  Yan Chen,et al.  When Does Learning in Games Generate Convergence to Nash Equilibria? The Role of Supermodularity in an Experimental Setting ⁄ , 2004 .

[4]  L. Hurwicz Studies in Resource Allocation Processes: Optimality and informational efficiency in resource allocation processes , 1977 .

[5]  Blake LeBaron,et al.  Agent-based computational finance : Suggested readings and early research , 2000 .

[6]  Ellen R. McGrattan,et al.  Money as a medium of exchange in an economy with artificially intelligent agents , 1990 .

[7]  A. Roth,et al.  Learning in Extensive-Form Games: Experimental Data and Simple Dynamic Models in the Intermediate Term* , 1995 .

[8]  Marco Casari Does bounded rationality lead to individual heterogeneity? The impact of the experimentation process and of memory constraints , 2003 .

[9]  John O. Ledyard,et al.  Scaling Up Learning Models in Public Good Games , 2004 .

[10]  T. Groves,et al.  Optimal Allocation of Public Goods: A Solution to the 'Free Rider Problem' , 1977 .

[11]  Mark A Walker,et al.  Are Groves-Ledyard Equilibria Attainable? , 1983 .

[12]  Herbert Dawid,et al.  Adaptive Learning by Genetic Algorithms, Analytical Results and Applications to Economic Models, 2nd extended and revised edition , 1999 .

[13]  F. Tang,et al.  Learning and incentive‐Compatible Mechanisms for Public Goods Provision: An Experimental Study , 1998, Journal of Political Economy.

[14]  Charles R. Plott,et al.  The Groves-Ledyard mechanism: An experimental study of institutional design , 1996 .

[15]  J. Ledyard Public Goods: A Survey of Experimental Research , 1994 .

[16]  Jasmina Arifovic Genetic algorithm learning and the cobweb model , 1994 .

[17]  Colin Camerer,et al.  Experience‐weighted Attraction Learning in Normal Form Games , 1999 .

[18]  R. McKelvey,et al.  Quantal Response Equilibria for Normal Form Games , 1995 .