Assessing the performance of auctions for the allocation of conservation contracts: Theoretical and computational approaches
There is a growing interest in using auctions for purchasing public goods from private agents. Auctions are being trialed in Australia and elsewhere to allocate conservation contracts. The expectation is that competitive bidding will reduce information rents and increase cost-effectiveness. This paper examines how auctions would perform under different assumptions regarding the rationality of bidders. A theoretical model requires bidders to be rational and use Nash equilibrium strategies, while an agent-based model assumes boundedly rational bidders learning from experience. The study illustrates the synergies between economic theory and agent-based modelling. Our findings provide a cautionary message regarding the performance of conservation auctions.
|Date of creation:||2005|
|Date of revision:|
|Contact details of provider:|| Postal: 555 East Wells Street, Suite 1100, Milwaukee, Wisconsin 53202|
Phone: (414) 918-3190
Fax: (414) 276-3349
Web page: http://www.aaea.org
More information through EDIRC
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.:
- Uwe Latacz-Lohmann & Carel Van der Hamsvoort, 1997. "Auctioning Conservation Contracts: A Theoretical Analysis and an Application," American Journal of Agricultural Economics, Agricultural and Applied Economics Association, vol. 79(2), pages 407-418.
- Hon-Snir, Shlomit & Monderer, Dov & Sela, Aner, 1998.
"A Learning Approach to Auctions,"
Journal of Economic Theory,
Elsevier, vol. 82(1), pages 65-88, September.
- Nicolaisen, James & Petrov, Valentin & Tesfatsion, Leigh S., 2000.
"Market Power and Efficiency in a Computational Electricity Market with Discriminatory Double-Auction Pricing,"
Staff General Research Papers
1952, Iowa State University, Department of Economics.
- Nicolaisen, James & Petrov, Valentin & Tesfatsion, Leigh S., 2001. "Market Power and Efficiency in a Computational Electricity Market with Discriminatory Double-Auction Pricing," Staff General Research Papers 2050, Iowa State University, Department of Economics.
- James Nicolaisen & Valentin Petrov & Leigh Tesfatsion, 2000. "Market Power and Efficiency in a Computational Electricity Market with Discriminatory Double-Auction Pricing," Computational Economics 0004005, EconWPA.
- Cox, James C & Smith, Vernon L & Walker, James M, 1984. " Theory and Behavior of Multiple Unit Discriminative Auctions," Journal of Finance, American Finance Association, vol. 39(4), pages 983-1010, September.
- Paul Milgrom & Robert J. Weber, 1981.
"A Theory of Auctions and Competitive Bidding,"
447R, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Milgrom, Paul & Roberts, John, 1991. "Adaptive and sophisticated learning in normal form games," Games and Economic Behavior, Elsevier, vol. 3(1), pages 82-100, February.
- Jordan J. S., 1995. "Bayesian Learning in Repeated Games," Games and Economic Behavior, Elsevier, vol. 9(1), pages 8-20, April.
- John Ledyard & Jasmina Arifovic, 2003. "Computer Testbeds: The Dynamics of Groves-Ledyard Mechanisms," Computing in Economics and Finance 2003 244, Society for Computational Economics.
- Harris, Milton & Raviv, Artur, 1981. "Allocation Mechanisms and the Design of Auctions," Econometrica, Econometric Society, vol. 49(6), pages 1477-99, November.
- A. Roth & I. Er’ev, 2010. "Learning in Extensive Form Games: Experimental Data and Simple Dynamic Models in the Intermediate Run," Levine's Working Paper Archive 387, David K. Levine.
When requesting a correction, please mention this item's handle: RePEc:ags:aaea05:19478. 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: (AgEcon Search)
If references are entirely missing, you can add them using this form.