On the Lowest-Winning-Bid and the Highest-Losing-Bid Auctions
Author
Abstract
Suggested Citation
Download full text from publisher
Other versions of this item:
- Mezzetti, Claudio & Tsetlin, Ilia, 2008. "On the lowest-winning-bid and the highest-losing-bid auctions," Journal of Mathematical Economics, Elsevier, vol. 44(9-10), pages 1040-1048, September.
- Mezzetti, Claudio & Tsetlin, Ilia, "undated". "On the Lowest-Winning-Bid and the Highest-Losing-Bid Auctions," Economic Research Papers 269781, University of Warwick - Department of Economics.
- Mezzetti, Claudio & Tsetlin, Ilia, 2007. "On the Lowest-Winning-Bid and the Highest-Losing-Bid Auctions," The Warwick Economics Research Paper Series (TWERPS) 832, University of Warwick, Department of Economics.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Han Hong & Harry J. Paarsch & Pai Xu, 2013.
"On the asymptotic distribution of the transaction price in a clock model of a multi-unit, oral, ascending-price auction within the common-value paradigm,"
RAND Journal of Economics, RAND Corporation, vol. 44(4), pages 664-685, December.
- Han Hong & Harry J. Paarsch & Pai Xu, 2010. "On the Asymptotic Distribution of the Transaction Price in a Clock Model of a Multi-Unit, Oral, Ascending-Price Auction within the Common-Value Paradigm," Carlo Alberto Notebooks 186, Collegio Carlo Alberto.
- Hong, Han & Paarsch, Harry J. & Xu, Pai, 2010. "On the Asymptotic Distribution of the Transaction Price in a Clock Model of a Multi-Unit, Oral, Ascending-Price Auction within the Common-Value Paradigm," CEI Working Paper Series 2010-8, Center for Economic Institutions, Institute of Economic Research, Hitotsubashi University.
- Muto, Nozomu & Shirata, Yasuhiro, 2017. "Manipulation via endowments in auctions with multiple goods," Mathematical Social Sciences, Elsevier, vol. 87(C), pages 75-84.
- Mezzetti, Claudio & Pekec, Aleksandar Sasa & Tsetlin, Ilia, 2008.
"Sequential vs. single-round uniform-price auctions,"
Games and Economic Behavior, Elsevier, vol. 62(2), pages 591-609, March.
- Claudio Mezzetti & Aleksandar Pekec & Ilia Tsetlin, 2004. "Sequential vs. Single-Round Uniform-Price Auctions," Working Papers 2004.147, Fondazione Eni Enrico Mattei.
- Claudio Mezzetti & Aleksandar Pekec & Ilia Tsetlin, 2005. "Sequential vs. Single-Round Uniform-Price Auctions," Discussion Papers in Economics 05/26, Division of Economics, School of Business, University of Leicester, revised Apr 2007.
More about this item
Keywords
; ; ; ; ;JEL classification:
- D44 - Microeconomics - - Market Structure, Pricing, and Design - - - Auctions
- D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:lec:leecon:06/16. See general information about how to correct material in RePEc.
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.
We have no bibliographic references for this item. You can help adding them by using 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Abbie Sleath (email available below). General contact details of provider: https://edirc.repec.org/data/deleiuk.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.
Printed from https://ideas.repec.org/p/lec/leecon/06-16.html