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
Han Hong,
Harry Paarsch and
Pai Xu
No 186, Carlo Alberto Notebooks from Collegio Carlo Alberto
Abstract:
Using a clock model of a multi-unit, oral, ascending-price auction, within the commonvalue paradigm, we analyse the asymptotic behaviour of the transaction price as the number of bidders gets large. We find that even though the transaction price is determined by a (potentially small) fraction of losing drop-out bids, that price converges in probability to the ex ante unknown, true value. Subsequently, we derive the asymptotic distribution of the transaction price. Finally, we apply our methods to data from an auction of taxi license plates held in Shenzhen, China.
Keywords: common value; information aggregation; multi-unit auctions; taxis (search for similar items in EconPapers)
JEL-codes: C20 D44 L1 (search for similar items in EconPapers)
Pages: 36 pages
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
https://www.carloalberto.org/wp-content/uploads/2018/11/no.186.pdf (application/pdf)
Related works:
Journal Article: 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 (2013) 
Working Paper: 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 (2010) 
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:cca:wpaper:186
Access Statistics for this paper
More papers in Carlo Alberto Notebooks from Collegio Carlo Alberto Contact information at EDIRC.
Bibliographic data for series maintained by Giovanni Bert (giovanni.bert@carloalberto.org).