IDEAS home Printed from
   My bibliography  Save this paper

Optimal Auction with Resale


  • Zheng, Charles Zhoucheng


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.)

Suggested Citation

  • Zheng, Charles Zhoucheng, 2002. "Optimal Auction with Resale," Staff General Research Papers Archive 12664, Iowa State University, Department of Economics.
  • Handle: RePEc:isu:genres:12664

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below 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.

    Other versions of this item:

    References listed on IDEAS

    1. Cremer, Jacques & Spiegel, Yossi & Zheng, Charles Zhoucheng, 2007. "Optimal search auctions," Journal of Economic Theory, Elsevier, vol. 134(1), pages 226-248, May.
    2. Bergemann, Dirk & Pesendorfer, Martin, 2007. "Information structures in optimal auctions," Journal of Economic Theory, Elsevier, vol. 137(1), pages 580-609, November.
    3. Dirk Bergemann & Juuso Valimaki, 2002. "Information Acquisition and Efficient Mechanism Design," Econometrica, Econometric Society, vol. 70(3), pages 1007-1033, May.
    4. Ye Lixin, 2004. "Optimal Auctions with Endogenous Entry," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 4(1), pages 1-29, October.
    5. Burguet, Roberto, 1996. "Optimal Repeated Purchases When Sellers Are Learning about Costs," Journal of Economic Theory, Elsevier, vol. 68(2), pages 440-455, February.
    6. Preston McAfee, R. & McMillan, John, 1988. "Search mechanisms," Journal of Economic Theory, Elsevier, vol. 44(1), pages 99-123, February.
    7. Cremer, Jacques & McLean, Richard P, 1985. "Optimal Selling Strategies under Uncertainty for a Discriminating Monopolist When Demands Are Interdependent," Econometrica, Econometric Society, vol. 53(2), pages 345-361, March.
    8. Cremer, Jacques & McLean, Richard P, 1988. "Full Extraction of the Surplus in Bayesian and Dominant Strategy Auctions," Econometrica, Econometric Society, vol. 56(6), pages 1247-1257, November.
    Full references (including those not matched with items on IDEAS)

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:


    Access and download statistics


    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: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). General contact details of provider: .

    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 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.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.