Optimal Auction with Resale
This paper investigates the design of seller-optimal auctions when winning bidders can attempt to resell the good. In that case, the optimal allocation characterized by Myerson (1981) cannot be achieved without resale. I find a sufficient and necessary condition for sincere bidding given the possibility of resale. In two-bidder cases, I prove that the Myerson allocation can be achieved under standard conditions supplemented with two assumptions. With three or more bidders, achieving the Myerson allocation is more difficult. I prove that it can be implemented in special cases. In those cases, the Myerson allocation is generated through a sequence of resale auctions, each optimally chosen by a reseller. (This paper was not from my dissertation.)
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||01 Nov 2002|
|Date of revision:|
|Publication status:||Published in Econometrica, November 2002, vol. 70 no. 6, pp. 2197-2224|
|Contact details of provider:|| Postal: |
Phone: +1 515.294.6741
Fax: +1 515.294.0221
Web page: http://www.econ.iastate.edu
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:isu:genres:12664. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Curtis Balmer)
If references are entirely missing, you can add them using this form.