IDEAS home Printed from https://ideas.repec.org/a/eee/gamebe/v82y2013icp522-543.html
   My bibliography  Save this article

Sequential negotiations with costly information acquisition

Author

Listed:
  • Pancs, Romans

Abstract

Negotiations about a merger or acquisition are often sequential and only partially disclose to bidders information about each otherʼs bids. This paper explains the seller optimality of partial disclosure in a single-item private-value auction with two bidders. Each bidder can inspect the item at a nonprohibitive cost. If a revenue-maximizing seller cannot charge bidders for the information about the otherʼs bid, then the seller optimally runs a sequential second-price auction with a reserve price and a buy-now price. The seller prefers to keep the bids confidential and, sometimes, to hide the order in which he approaches the bidders.

Suggested Citation

  • Pancs, Romans, 2013. "Sequential negotiations with costly information acquisition," Games and Economic Behavior, Elsevier, vol. 82(C), pages 522-543.
  • Handle: RePEc:eee:gamebe:v:82:y:2013:i:c:p:522-543
    DOI: 10.1016/j.geb.2013.08.007
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0899825613001243
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.geb.2013.08.007?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Obara Ichiro, 2008. "The Full Surplus Extraction Theorem with Hidden Actions," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 8(1), pages 1-28, March.
    2. Cremer, Jacques & Spiegel, Yossi & Zheng, Charles Zhoucheng, 2007. "Optimal search auctions," Journal of Economic Theory, Elsevier, vol. 134(1), pages 226-248, May.
    3. Gershkov, Alex & Szentes, Balázs, 2009. "Optimal voting schemes with costly information acquisition," Journal of Economic Theory, Elsevier, vol. 144(1), pages 36-68, January.
    4. Jeremy Bulow & Paul Klemperer, 2009. "Why Do Sellers (Usually) Prefer Auctions?," American Economic Review, American Economic Association, vol. 99(4), pages 1544-1575, September.
    5. Bernard Caillaud & Jean Tirole, 2007. "Consensus Building: How to Persuade a Group," American Economic Review, American Economic Association, vol. 97(5), pages 1877-1900, December.
    6. Bergemann, Dirk & Pesendorfer, Martin, 2007. "Information structures in optimal auctions," Journal of Economic Theory, Elsevier, vol. 137(1), pages 580-609, November.
    7. Péter Eső & Balázs Szentes, 2007. "Optimal Information Disclosure in Auctions and the Handicap Auction," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 74(3), pages 705-731.
    8. Cyrus Derman & Gerald J. Lieberman & Sheldon M. Ross, 1972. "A Sequential Stochastic Assignment Problem," Management Science, INFORMS, vol. 18(7), pages 349-355, March.
    9. Alex Gershkov & Benny Moldovanu, 2009. "Dynamic Revenue Maximization with Heterogeneous Objects: A Mechanism Design Approach," American Economic Journal: Microeconomics, American Economic Association, vol. 1(2), pages 168-198, August.
    10. Baron, David P & Myerson, Roger B, 1982. "Regulating a Monopolist with Unknown Costs," Econometrica, Econometric Society, vol. 50(4), pages 911-930, July.
    11. Cremer, Jacques & Khalil, Fahad & Rochet, Jean-Charles, 1998. "Contracts and Productive Information Gathering," Games and Economic Behavior, Elsevier, vol. 25(2), pages 174-193, November.
    12. Calzolari, Giacomo & Pavan, Alessandro, 2006. "On the optimality of privacy in sequential contracting," Journal of Economic Theory, Elsevier, vol. 130(1), pages 168-204, September.
    13. Thomas H. Noe & Jun Wang, 2004. "Fooling All of the People Some of the Time: A Theory of Endogenous Sequencing in Confidential Negotiations," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 71(3), pages 855-881.
    14. Aumann, Robert J., 1974. "Subjectivity and correlation in randomized strategies," Journal of Mathematical Economics, Elsevier, vol. 1(1), pages 67-96, March.
    15. Shi, Xianwen, 2012. "Optimal auctions with information acquisition," Games and Economic Behavior, Elsevier, vol. 74(2), pages 666-686.
    16. Cramton, Peter & Gibbons, Robert & Klemperer, Paul, 1987. "Dissolving a Partnership Efficiently," Econometrica, Econometric Society, vol. 55(3), pages 615-632, May.
    17. Giacomo Calzolari & Alessandro Pavan, 2006. "Monopoly with Resale," RAND Journal of Economics, The RAND Corporation, vol. 37(2), pages 362-375, Summer.
    18. Myerson, Roger B., 1982. "Optimal coordination mechanisms in generalized principal-agent problems," Journal of Mathematical Economics, Elsevier, vol. 10(1), pages 67-81, June.
    19. Myerson, Roger B, 1986. "Multistage Games with Communication," Econometrica, Econometric Society, vol. 54(2), pages 323-358, March.
    20. Giacomo Calzolari & Alessandro Pavan, 2006. "Monopoly with resale," RAND Journal of Economics, RAND Corporation, vol. 37(2), pages 362-375, June.
    21. Paul Milgrom & Ilya Segal, 2002. "Envelope Theorems for Arbitrary Choice Sets," Econometrica, Econometric Society, vol. 70(2), pages 583-601, March.
    22. Jeremy Bulow & Paul Klemperer, 2009. "Why Do Sellers (Usually) Prefer Auctions?," American Economic Review, American Economic Association, vol. 99(4), pages 1544-75, September.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Lester, Benjamin & Visschers, Ludo & Wolthoff, Ronald, 2015. "Dynamic Relational Contracts under Complete Information," SIRE Discussion Papers 2015-51, Scottish Institute for Research in Economics (SIRE).
    2. Lester, Benjamin & Visschers, Ludo & Wolthoff, Ronald, 2017. "Competing with asking prices," Theoretical Economics, Econometric Society, vol. 12(2), May.
    3. Negin Golrezaei & Hamid Nazerzadeh, 2017. "Auctions with Dynamic Costly Information Acquisition," Operations Research, INFORMS, vol. 65(1), pages 130-144, February.
    4. Lester, Benjamin & Visschers, Ludo & Wolthoff, Ronald, 2014. "Competing with Asking Prices," 2007 Annual Meeting, July 29-August 1, 2007, Portland, Oregon TN 2015-37, American Agricultural Economics Association (New Name 2008: Agricultural and Applied Economics Association).
    5. Benjamin Lester & Ludo Visschers & Ronald Wolthoff, 2014. "Competing with Asking Prices (first version)," Edinburgh School of Economics Discussion Paper Series 243, Edinburgh School of Economics, University of Edinburgh.
    6. Negin Golrezaei & Hamid Nazerzadeh, 2017. "Auctions with Dynamic Costly Information Acquisition," Operations Research, INFORMS, vol. 65(1), pages 130-144, February.
    7. Lester, Benjamin & Visschers, Ludo & Wolthoff, Ronald, 2015. "Dynamic Relational Contracts under Complete Information," 2007 Annual Meeting, July 29-August 1, 2007, Portland, Oregon TN 2015-51, American Agricultural Economics Association (New Name 2008: Agricultural and Applied Economics Association).
    8. McAdams, David, 2015. "On the benefits of dynamic bidding when participation is costly," Journal of Economic Theory, Elsevier, vol. 157(C), pages 959-972.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Nikandrova, Arina & Pancs, Romans, 2017. "Conjugate information disclosure in an auction with learning," Journal of Economic Theory, Elsevier, vol. 171(C), pages 174-212.
    2. Jacques Crémer & Yossi Spiegel & Charles Zheng, 2009. "Auctions with costly information acquisition," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 38(1), pages 41-72, January.
    3. Shi, Xianwen, 2012. "Optimal auctions with information acquisition," Games and Economic Behavior, Elsevier, vol. 74(2), pages 666-686.
    4. Vasiliki Skreta, 2011. "On the informed seller problem: optimal information disclosure," Review of Economic Design, Springer;Society for Economic Design, vol. 15(1), pages 1-36, March.
    5. James W. Roberts & Andrew Sweeting, 2013. "When Should Sellers Use Auctions?," American Economic Review, American Economic Association, vol. 103(5), pages 1830-1861, August.
    6. Lester, Benjamin & Visschers, Ludo & Wolthoff, Ronald, 2017. "Competing with asking prices," Theoretical Economics, Econometric Society, vol. 12(2), May.
    7. Lang, Ruitian, 2019. "Try before you buy: A theory of dynamic information acquisition," Journal of Economic Theory, Elsevier, vol. 183(C), pages 1057-1093.
    8. Hagedorn, Marcus, 2009. "The value of information for auctioneers," Journal of Economic Theory, Elsevier, vol. 144(5), pages 2197-2208, September.
    9. Bergemann, Dirk & Pavan, Alessandro, 2015. "Introduction to Symposium on Dynamic Contracts and Mechanism Design," Journal of Economic Theory, Elsevier, vol. 159(PB), pages 679-701.
    10. Dirk Bergemann & Stephen Morris, 2019. "Information Design: A Unified Perspective," Journal of Economic Literature, American Economic Association, vol. 57(1), pages 44-95, March.
    11. Iossa, Elisabetta & Martimort, David, 2015. "Pessimistic information gathering," Games and Economic Behavior, Elsevier, vol. 91(C), pages 75-96.
    12. Lester, Benjamin & Visschers, Ludo & Wolthoff, Ronald, 2015. "Dynamic Relational Contracts under Complete Information," SIRE Discussion Papers 2015-51, Scottish Institute for Research in Economics (SIRE).
    13. Jacques Cremer & Yossi Spiegel & Charles Z. Zheng, 2004. "Auctions with costly information acquisition Constrained Bidders," Discussion Papers 1420, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    14. Romans Pancs, 2015. "Efficient dark markets," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 59(3), pages 605-624, August.
    15. Xiaogang Che & Tilman Klumpp, 2023. "Auctions versus sequential mechanisms when resale is allowed," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 75(4), pages 1207-1245, May.
    16. Terstiege, Stefan, 2012. "Endogenous information and stochastic contracts," Games and Economic Behavior, Elsevier, vol. 76(2), pages 535-547.
    17. Cremer, Jacques & Spiegel, Yossi & Zheng, Charles Zhoucheng, 2007. "Optimal search auctions," Journal of Economic Theory, Elsevier, vol. 134(1), pages 226-248, May.
    18. Jeremy Bulow & Paul Klemperer, 2009. "Why Do Sellers (Usually) Prefer Auctions?," American Economic Review, American Economic Association, vol. 99(4), pages 1544-1575, September.
    19. Krähmer, Daniel, 2020. "Information disclosure and full surplus extraction in mechanism design," Journal of Economic Theory, Elsevier, vol. 187(C).
    20. Lester, Benjamin & Visschers, Ludo & Wolthoff, Ronald, 2015. "Dynamic Relational Contracts under Complete Information," 2007 Annual Meeting, July 29-August 1, 2007, Portland, Oregon TN 2015-51, American Agricultural Economics Association (New Name 2008: Agricultural and Applied Economics Association).

    More about this item

    Keywords

    Sequential negotiations; Buy-now price; Strategic bid disclosure;
    All these keywords.

    JEL classification:

    • D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design
    • D83 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Search; Learning; Information and Knowledge; Communication; Belief; Unawareness
    • D44 - Microeconomics - - Market Structure, Pricing, and Design - - - Auctions

    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:eee:gamebe:v:82:y:2013:i:c:p:522-543. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/622836 .

    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.