New Evidence on Price Anomalies in Sequential Auctions: Used Cars in New Jersey
AbstractNo abstract is available for this item.
Download InfoIf 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.
Bibliographic InfoArticle provided by American Statistical Association in its journal Journal of Business and Economic Statistics.
Volume (Year): 24 (2006)
Issue (Month): (July)
Contact details of provider:
Web page: http://www.amstat.org/publications/jbes/index.cfm?fuseaction=main
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Johannes Horner & Julian Jamison, 2006. "Private Information in Sequential Common-Value Auctions," Discussion Papers 1422, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Yaron Raviv, 2009. "Uncertainty and Auction Outcomes: Evidence from Used Car Actions," Review of Industrial Organization, Springer, vol. 34(4), pages 327-347, June.
- Verwer, S. & Zhang, Y., 2011. "Revenue Prediction in Budget-constrained Sequential Auctions with Complementarities," ERIM Report Series Research in Management ERS-2011-020-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
- Grether, David M. & Plott, Charles R., 2009.
"Sequencing strategies in large, competitive, ascending price automobile auctions: An experimental examination,"
Journal of Economic Behavior & Organization,
Elsevier, vol. 71(2), pages 75-88, August.
- Grether, David M. & Plott, Charles R., . "Sequencing strategies in large, competitive, ascending price automobile auctions: An experimental examination," Working Papers 1253, California Institute of Technology, Division of the Humanities and Social Sciences.
- Archishman Chakraborty & Nandini Gupta & Rick Harbaugh, 2004.
"Best Foot Forward or Best for Last in a Sequential Auction?,"
2004-07, Indiana University, Kelley School of Business, Department of Business Economics and Public Policy.
- Archishman Chakraborty & Nandini Gupta & Rick Harbaugh, 2006. "Best foot forward or best for last in a sequential auction?," RAND Journal of Economics, RAND Corporation, vol. 37(1), pages 176-194, 03.
- Archishman Chakraborty & Nandini Gupta & Rick Harbaugh, 2000. "Best Foot Forward or Best for Last in a Sequential Auction?," Claremont Colleges Working Papers 2000-43, Claremont Colleges.
- Sherstyuk, Katerina & Dulatre, Jeremy, 2008. "Market performance and collusion in sequential and simultaneous multi-object auctions: Evidence from an ascending auctions experiment," International Journal of Industrial Organization, Elsevier, vol. 26(2), pages 557-572, March.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christopher F. Baum).
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.