Sequential Search Auctions with a Deadline
(2018)
Preprint / Working Paper
A seller wants to allocate an indivisible product among a number of potential buyers by a finite deadline, and to contact a buyer, she needs to pay a positive search cost. We investigate the optimal mechanism for this problem, and show that its outco... Read More about Sequential Search Auctions with a Deadline.