IDEAS home Printed from https://ideas.repec.org/a/rje/randje/v37y20062p362-375.html
   My bibliography  Save this article

Monopoly with Resale

Author

Listed:
  • Giacomo Calzolari

    (University of Bologna)

  • Alessandro Pavan

    (Northwestern University)

Abstract

We examine the intricacies associated with the design of revenue-maximizing mechanisms for a monopolist who expects her buyers to resell. We consider two cases: resale to a third party who does not participate in the primary market and interbidder resale, where the winner resells to the losers. To influence the resale outcome, the monopolist must design an allocation rule and a disclosure policy that optimally fashion the beliefs of the participants in the secondary market. Our results show that the revenue-maximizing mechanism may require a stochastic selling procedure and a disclosure policy richer than the simple announcement of the decision to sell to a particular buyer.

Suggested Citation

  • Giacomo Calzolari & Alessandro Pavan, 2006. "Monopoly with Resale," RAND Journal of Economics, The RAND Corporation, vol. 37(2), pages 362-375, Summer.
  • Handle: RePEc:rje:randje:v:37:y:2006:2:p:362-375
    as

    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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Sui, Yong, 2006. "All-pay auctions with resale," MPRA Paper 11463, University Library of Munich, Germany, revised Oct 2007.
    2. Zhang, Jun, 2013. "Revenue maximizing with return policy when buyers have uncertain valuations," International Journal of Industrial Organization, Elsevier, vol. 31(5), pages 452-461.
    3. Pancs, Romans, 2013. "Sequential negotiations with costly information acquisition," Games and Economic Behavior, Elsevier, vol. 82(C), pages 522-543.
    4. Daley, Brendan & Schwarz, Michael & Sonin, Konstantin, 2012. "Efficient investment in a dynamic auction environment," Games and Economic Behavior, Elsevier, vol. 75(1), pages 104-119.
    5. Zhang, Jun & Wang, Ruqu, 2013. "Optimal mechanism design with resale via bargaining," Journal of Economic Theory, Elsevier, vol. 148(5), pages 2096-2123.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    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:rje:randje:v:37:y:2006:2:p:362-375. See general information about how to correct material in RePEc.

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

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: the person in charge (email available below). General contact details of provider: https://www.rje.org .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.