Optimal Search Auctions
Jacques Crémer (),
Yossi Spiegel and
No 1421, Discussion Papers from Northwestern University, Center for Mathematical Studies in Economics and Management Science
We study the design of profit maximizing single unit auctions under the assumption that the seller needs to incur costs to contact prospective bidders and inform them about the auction. With independent bidders’ types and possibly interdependent valuations, the seller’s problem can be reduced to a search problem in which the surplus is measured in terms of virtual utilities minus search costs. Compared to the socially efficient mechanism, the optimal mechanism features fewer participants, longer search conditional on the same set of participants, and inefficient sequence of entry.
Keywords: optimal auctions; search cost; search mechanism (search for similar items in EconPapers)
New Economics Papers: this item is included in nep-gth
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1) Track citations by RSS feed
Downloads: (external link)
http://www.kellogg.northwestern.edu/research/math/papers/1421.pdf main text (application/pdf)
Journal Article: Optimal search auctions (2007)
Working Paper: Optimal Search Auctions (2007)
Working Paper: Optimal Search Auctions (2005)
Working Paper: Optimal search auctions (2004)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:nwu:cmsems:1421
Ordering information: This working paper can be ordered from
Access Statistics for this paper
More papers in Discussion Papers from Northwestern University, Center for Mathematical Studies in Economics and Management Science Center for Mathematical Studies in Economics and Management Science, Northwestern University, 580 Jacobs Center, 2001 Sheridan Road, Evanston, IL 60208-2014. Contact information at EDIRC.
Bibliographic data for series maintained by Fran Walker ( this e-mail address is bad, please contact ).