(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This
(This abstract was borrowed from another version of this item.)"> (This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This
(This abstract was borrowed from another version of this item.)">
[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
IDEAS home Printed from https://ideas.repec.org/p/ide/wpaper/5301.html
   My bibliography  Save this paper

Optimal Search Auctions

Author

Listed:
  • Crémer, Jacques
  • Spiegel, Yossi
  • Zheng, Charles Z.
Abstract
We study the design of profit maximizing single unit auctions under the assumption that the seller needs to incur costs to contact prospective bidders and inform them about the auction. When bidders' types are independent (with^Mpossibly bidder-specific distributions) and their valuations are possibly interdependent, the seller's problem can be reduced to a (stochastic, history-contingent) search problem in which the surplus is measured in terms of virtual utilities minus search costs. Compared to the socially efficient mechanism, the optimal mechanism features fewer participants, longer search conditional on the same set of participants, and inefficient sequence of entry. When bidders' types are correlated, the seller cannot fully extract the social surplus for sure but can extract it with an arbitrarily high probability.
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Crémer, Jacques & Spiegel, Yossi & Zheng, Charles Z., 2005. "Optimal Search Auctions," IDEI Working Papers 293, Institut d'Économie Industrielle (IDEI), Toulouse.
    • Handle: RePEc:ide:wpaper:5301
    as

    Download full text from publisher

    File URL: http://idei.fr/sites/default/files/medias/doc/wp/2005/optimal_auctions.pdf
    File Function: Full text
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. 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.
    2. Roger B. Myerson, 1978. "Optimal Auction Design," Discussion Papers 362, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    3. Bergemann, Dirk & Pesendorfer, Martin, 2007. "Information structures in optimal auctions," Journal of Economic Theory, Elsevier, vol. 137(1), pages 580-609, November.
    4. Wolfgang Pesendorfer & Asher Wolinsky, 2003. "Second Opinions and Price Competition: Inefficiency in the Market for Expert Advice," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 70(2), pages 417-437.
    5. Asher Wolinsky, 1993. "Competition in a Market for Informed Experts' Services," RAND Journal of Economics, The RAND Corporation, vol. 24(3), pages 380-398, Autumn.
    6. Vishwanath, Tara, 1992. "Parallel Search for the Best Alternative," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 2(4), pages 495-507, October.
    7. Dirk Bergemann & Juuso Valimaki, 2005. "Information in Mechanism Design," Cowles Foundation Discussion Papers 1532R, Cowles Foundation for Research in Economics, Yale University, revised Jan 2006.
    8. Dirk Bergemann & Juuso Valimaki, 2002. "Information Acquisition and Efficient Mechanism Design," Econometrica, Econometric Society, vol. 70(3), pages 1007-1033, May.
    9. Ye Lixin, 2004. "Optimal Auctions with Endogenous Entry," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 4(1), pages 1-29, October.
    10. Paul Milgrom & Ilya Segal, 2002. "Envelope Theorems for Arbitrary Choice Sets," Econometrica, Econometric Society, vol. 70(2), pages 583-601, March.
    11. Charles Zhoucheng Zheng, 2002. "Optimal Auction with Resale," Econometrica, Econometric Society, vol. 70(6), pages 2197-2224, November.
    12. Weitzman, Martin L, 1979. "Optimal Search for the Best Alternative," Econometrica, Econometric Society, vol. 47(3), pages 641-654, May.
    13. Burguet, Roberto, 1996. "Optimal Repeated Purchases When Sellers Are Learning about Costs," Journal of Economic Theory, Elsevier, vol. 68(2), pages 440-455, February.
    14. Preston McAfee, R. & McMillan, John, 1988. "Search mechanisms," Journal of Economic Theory, Elsevier, vol. 44(1), pages 99-123, February.
    15. Stegeman, Mark, 1996. "Participation Costs and Efficient Auctions," Journal of Economic Theory, Elsevier, vol. 71(1), pages 228-259, October.
    16. Crémer, Jacques & Spiegel, Yossi & Zheng, Charles Z., 2003. "Optimal Selling Mechanisms wth Costly Information Acquisition," IDEI Working Papers 205, Institut d'Économie Industrielle (IDEI), Toulouse.
    17. Levin, Dan & Smith, James L, 1994. "Equilibrium in Auctions with Entry," American Economic Review, American Economic Association, vol. 84(3), pages 585-599, June.
    18. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    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. Zhang, Hanzhe, 2021. "The optimal sequence of prices and auctions," European Economic Review, Elsevier, vol. 133(C).
    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. Jeremy Bulow & Paul Klemperer, 2009. "Why Do Sellers (Usually) Prefer Auctions?," American Economic Review, American Economic Association, vol. 99(4), pages 1544-1575, September.
    4. Laurent Lamy, 2013. "“Upping the ante”: how to design efficient auctions with entry?," RAND Journal of Economics, RAND Corporation, vol. 44(2), pages 194-214, June.
    5. Philippe Jehiel & Laurent Lamy, 2020. "On the Benefits of Set-Asides," Journal of the European Economic Association, European Economic Association, vol. 18(4), pages 1655-1696.
    6. Szech, Nora, 2011. "Optimal disclosure of costly information packages in auctions," Journal of Mathematical Economics, Elsevier, vol. 47(4-5), pages 462-469.
    7. Kaplan, Todd R. & Zamir, Shmuel, 2015. "Advances in Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
    8. Shi, Xianwen, 2012. "Optimal auctions with information acquisition," Games and Economic Behavior, Elsevier, vol. 74(2), pages 666-686.
    9. Hedyeh Beyhaghi & Linda Cai, 2023. "Recent Developments in Pandora's Box Problem: Variants and Applications," Papers 2308.12242, arXiv.org.
    10. Hagedorn, Marcus, 2009. "The value of information for auctioneers," Journal of Economic Theory, Elsevier, vol. 144(5), pages 2197-2208, September.
    11. Joosung Lee & Daniel Z. Li, 2018. "Sequential Search Auctions with a Deadline," Working Papers 2018_03, Durham University Business School.
    12. Pancs, Romans, 2013. "Sequential negotiations with costly information acquisition," Games and Economic Behavior, Elsevier, vol. 82(C), pages 522-543.
    13. Stephan Lauermann & Asher Wolinsky, 2024. "Auctions with Frictions: Recruitment, Entry, and Limited Commitment," ECONtribute Discussion Papers Series 288, University of Bonn and University of Cologne, Germany.
    14. Yizhaq Minchuk & Aner Sela, 2018. "Asymmetric sequential search under incomplete information," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 27(2), pages 315-325, June.
    15. Celik Gorkem & Yilankaya Okan, 2009. "Optimal Auctions with Simultaneous and Costly Participation," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 9(1), pages 1-33, July.
    16. 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.
    17. Polanski Arnold & Cardona Daniel, 2012. "Multilevel Mediation in Symmetric Trees," Review of Network Economics, De Gruyter, vol. 11(3), pages 1-23, September.
    18. Jinhyuk Lee & Jaeok Park, 2016. "Second-price auctions with sequential and costly participation," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 62(3), pages 567-586, August.
    19. Stephan Lauermann & Asher Wolinsky, 2024. "Auctions with Frictions: Recruitment, Entry, and Limited Commitment," CRC TR 224 Discussion Paper Series crctr224_2024_519, University of Bonn and University of Mannheim, Germany.
    20. Li, Daniel Z., 2017. "Ranking equilibrium competition in auctions with participation costs," Economics Letters, Elsevier, vol. 153(C), pages 47-50.
    21. Gal, Shmuel & Landsberger, Michael & Nemirovski, Arkadi, 2007. "Participation in auctions," Games and Economic Behavior, Elsevier, vol. 60(1), pages 75-103, July.
    22. Cremer, Jacques & Spiegel, Yossi & Zheng, Charles Z., 2006. "Optimal search auctions with correlated bidder types," Economics Letters, Elsevier, vol. 93(1), pages 94-100, October.

    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. 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.
    2. 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.
    3. Shi, Xianwen, 2012. "Optimal auctions with information acquisition," Games and Economic Behavior, Elsevier, vol. 74(2), pages 666-686.
    4. Lu, Jingfeng & Ye, Lixin, 2013. "Efficient and optimal mechanisms with private information acquisition costs," Journal of Economic Theory, Elsevier, vol. 148(1), pages 393-408.
    5. Xu, Xiaoshu & Levin, Dan & Ye, Lixin, 2013. "Auctions with entry and resale," Games and Economic Behavior, Elsevier, vol. 79(C), pages 92-105.
    6. Crémer, Jacques & Spiegel, Yossi & Zheng, Charles Z., 2003. "Optimal Selling Mechanisms wth Costly Information Acquisition," IDEI Working Papers 205, Institut d'Économie Industrielle (IDEI), Toulouse.
    7. Yunan Li, 2017. "Efficient Mechanisms with Information Acquisition," PIER Working Paper Archive 16-007, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 23 Jun 2017.
    8. Li, Yunan, 2019. "Efficient mechanisms with information acquisition," Journal of Economic Theory, Elsevier, vol. 182(C), pages 279-328.
    9. Jingfeng Lu, 2009. "Why a Simple Second-Price Auction Induces Efficient Endogenous Entry," Theory and Decision, Springer, vol. 66(2), pages 181-198, February.
    10. Jingfeng Lu, 2010. "Entry Coordination And Auction Design With Private Costs Of Information Acquisition," Economic Inquiry, Western Economic Association International, vol. 48(2), pages 274-289, April.
    11. Nikandrova, Arina & Pancs, Romans, 2017. "Conjugate information disclosure in an auction with learning," Journal of Economic Theory, Elsevier, vol. 171(C), pages 174-212.
    12. Cremer, Jacques & Spiegel, Yossi & Zheng, Charles Z., 2006. "Optimal search auctions with correlated bidder types," Economics Letters, Elsevier, vol. 93(1), pages 94-100, October.
    13. 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.
    14. Lorentziadis, Panos L., 2016. "Optimal bidding in auctions from a game theory perspective," European Journal of Operational Research, Elsevier, vol. 248(2), pages 347-371.
    15. Pancs, Romans, 2013. "Sequential negotiations with costly information acquisition," Games and Economic Behavior, Elsevier, vol. 82(C), pages 522-543.
    16. Jehiel, Philippe & Lamy, Laurent, 2014. "On discrimination in procurement auctions," CEPR Discussion Papers 9790, C.E.P.R. Discussion Papers.
    17. Ronald M. Harstad, 2007. "Does a Seller Really Want Another Bidder?," Working Papers 0711, Department of Economics, University of Missouri.
    18. Hernando-Veciana, Ángel, 2009. "Information acquisition in auctions: Sealed bids vs. open bids," Games and Economic Behavior, Elsevier, vol. 65(2), pages 372-405, March.
    19. Dirk Bergemann & Alessandro Pavan, 2015. "Introduction to JET Symposium Issue on "Dynamic Contracts and Mechanism Design"," Cowles Foundation Discussion Papers 2016, Cowles Foundation for Research in Economics, Yale University.
    20. Jeremy Bulow & Paul Klemperer, 2009. "Why Do Sellers (Usually) Prefer Auctions?," American Economic Review, American Economic Association, vol. 99(4), pages 1544-1575, September.

    More about this item

    JEL classification:

    • D44 - Microeconomics - - Market Structure, Pricing, and Design - - - Auctions

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:ide:wpaper:5301. 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: the person in charge (email available below). General contact details of provider: https://edirc.repec.org/data/idtlsfr.html .

    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.