IDEAS home Printed from https://ideas.repec.org/a/spr/sochwe/v57y2021i1d10.1007_s00355-021-01309-y.html
   My bibliography  Save this article

Dynamic communication mechanism design

Author

Listed:
  • Ryuji Sano

    (Yokohama National University)

Abstract

We consider dynamic communication mechanisms in a quasi-linear environment with single-dimensional types. The mechanism designer gradually identifies agents’ valuations by iteratively offering prices to agents at different stages. Agents pay the maximum price they accepted if their desirable decision is made. We show that within weakly tight mechanisms, if a communication mechanism is ex-post incentive compatible, then it is a monotone-price mechanism. English auctions are characterized as a class of mechanisms that satisfy ex-post incentive compatibility and efficiency.

Suggested Citation

  • Ryuji Sano, 2021. "Dynamic communication mechanism design," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 57(1), pages 163-180, July.
    • Handle: RePEc:spr:sochwe:v:57:y:2021:i:1:d:10.1007_s00355-021-01309-y
    DOI: 10.1007/s00355-021-01309-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00355-021-01309-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00355-021-01309-y?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. Alex Gershkov & Benny Moldovanu & Xianwen Shi, 2017. "Optimal Voting Rules," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 84(2), pages 688-717.
    2. Dilip Mookherjee & Masatoshi Tsumagari, 2014. "Mechanism Design with Communication Constraints," Journal of Political Economy, University of Chicago Press, vol. 122(5), pages 1094-1129.
    3. , & ,, 2013. "Implementation in multidimensional dichotomous domains," Theoretical Economics, Econometric Society, vol. 8(2), May.
    4. Fadel, Ronald & Segal, Ilya, 2009. "The communication cost of selfishness," Journal of Economic Theory, Elsevier, vol. 144(5), pages 1895-1920, September.
    5. Green, Jerry & Laffont, Jean-Jacques, 1977. "On the revelation of preferences for public goods," Journal of Public Economics, Elsevier, vol. 8(1), pages 79-93, August.
    6. Green, Jerry & Laffont, Jean-Jacques, 1977. "Characterization of Satisfactory Mechanisms for the Revelation of Preferences for Public Goods," Econometrica, Econometric Society, vol. 45(2), pages 427-438, March.
    7. William Vickrey, 1961. "Counterspeculation, Auctions, And Competitive Sealed Tenders," Journal of Finance, American Finance Association, vol. 16(1), pages 8-37, March.
    8. Lawrence M. Ausubel, 2006. "An Efficient Dynamic Auction for Heterogeneous Commodities," American Economic Review, American Economic Association, vol. 96(3), pages 602-629, June.
    9. Lawrence M. Ausubel, 2004. "An Efficient Ascending-Bid Auction for Multiple Objects," American Economic Review, American Economic Association, vol. 94(5), pages 1452-1475, December.
    10. Ausubel Lawrence M & Milgrom Paul R, 2002. "Ascending Auctions with Package Bidding," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 1(1), pages 1-44, August.
    11. Shengwu Li, 2017. "Obviously Strategy-Proof Mechanisms," American Economic Review, American Economic Association, vol. 107(11), pages 3257-3287, November.
    12. Holmstrom, Bengt, 1979. "Groves' Scheme on Restricted Domains," Econometrica, Econometric Society, vol. 47(5), pages 1137-1144, September.
    13. Elena Grigorieva & P. Herings & Rudolf Müller & Dries Vermeulen, 2007. "The private value single item bisection auction," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 30(1), pages 107-118, January.
    14. Noriaki Okamoto, 2018. "An Efficient Ascending-Bid Auction for Multiple Objects: Comment," American Economic Review, American Economic Association, vol. 108(2), pages 555-560, February.
    15. Rothkopf, Michael H & Teisberg, Thomas J & Kahn, Edward P, 1990. "Why Are Vickrey Auctions Rare?," Journal of Political Economy, University of Chicago Press, vol. 98(1), pages 94-109, February.
    16. Mishra, Debasis & Parkes, David C., 2007. "Ascending price Vickrey auctions for general valuations," Journal of Economic Theory, Elsevier, vol. 132(1), pages 335-366, January.
    17. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    18. Sano, Ryuji, 2011. "Incentives in core-selecting auctions with single-minded bidders," Games and Economic Behavior, Elsevier, vol. 72(2), pages 602-606, June.
    19. Andreas Kleiner & Benny Moldovanu, 2021. "Voting Agendas and Preferences on Trees: Theory and Practice," CRC TR 224 Discussion Paper Series crctr224_2021_289, University of Bonn and University of Mannheim, Germany.
    20. Timothy Van Zandt, 2007. "Communication Complexity and Mechanism Design," Journal of the European Economic Association, MIT Press, vol. 5(2-3), pages 543-553, 04-05.
    21. Paul Milgrom & Ilya Segal, 2020. "Clock Auctions and Radio Spectrum Reallocation," Journal of Political Economy, University of Chicago Press, vol. 128(1), pages 1-31.
    22. Lawrence M. Ausubel, 2018. "An Efficient Ascending-Bid Auction for Multiple Objects: Reply," American Economic Review, American Economic Association, vol. 108(2), pages 561-563, February.
    23. Kos, Nenad, 2012. "Communication and efficiency in auctions," Games and Economic Behavior, Elsevier, vol. 75(1), pages 233-249.
    24. Andreas Kleiner & Benny Moldovanu, 2017. "Content-Based Agendas and Qualified Majorities in Sequential Voting," American Economic Review, American Economic Association, vol. 107(6), pages 1477-1506, June.
    Full references (including those not matched with items on IDEAS)

    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. Mackenzie, Andrew & Zhou, Yu, 2022. "Menu mechanisms," Journal of Economic Theory, Elsevier, vol. 204(C).
    2. Alexander Teytelboym & Shengwu Li & Scott Duke Kominers & Mohammad Akbarpour & Piotr Dworczak, 2021. "Discovering Auctions: Contributions of Paul Milgrom and Robert Wilson," Scandinavian Journal of Economics, Wiley Blackwell, vol. 123(3), pages 709-750, July.
    3. Baranov, Oleg, 2018. "An efficient ascending auction for private valuations," Journal of Economic Theory, Elsevier, vol. 177(C), pages 495-517.
    4. Mishra, Debasis & Parkes, David C., 2007. "Ascending price Vickrey auctions for general valuations," Journal of Economic Theory, Elsevier, vol. 132(1), pages 335-366, January.
    5. Tomoya Kazumura & Shigehiro Serizawa, 2016. "Efficiency and strategy-proofness in object assignment problems with multi-demand preferences," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 47(3), pages 633-663, October.
    6. Andersson, Tommy & Erlanson, Albin, 2013. "Multi-item Vickrey–English–Dutch auctions," Games and Economic Behavior, Elsevier, vol. 81(C), pages 116-129.
    7. Sushil Bikhchandani & Sven de Vries & James Schummer & Rakesh V. Vohra, 2011. "An Ascending Vickrey Auction for Selling Bases of a Matroid," Operations Research, INFORMS, vol. 59(2), pages 400-413, April.
    8. De Liu & Adib Bagh, 2020. "Preserving Bidder Privacy in Assignment Auctions: Design and Measurement," Management Science, INFORMS, vol. 66(7), pages 3162-3182, July.
    9. Yan, Haomin, 2021. "Position auctions with multi-unit demands," Games and Economic Behavior, Elsevier, vol. 127(C), pages 179-193.
    10. Jawad Abrache & Teodor Crainic & Michel Gendreau & Monia Rekik, 2007. "Combinatorial auctions," Annals of Operations Research, Springer, vol. 153(1), pages 131-164, September.
    11. Shengwu Li, 2017. "Obviously Strategy-Proof Mechanisms," American Economic Review, American Economic Association, vol. 107(11), pages 3257-3287, November.
    12. Loertscher, Simon & Marx, Leslie M., 2020. "Asymptotically optimal prior-free clock auctions," Journal of Economic Theory, Elsevier, vol. 187(C).
    13. Blumrosen, Liad & Feldman, Michal, 2013. "Mechanism design with a restricted action space," Games and Economic Behavior, Elsevier, vol. 82(C), pages 424-443.
    14. Jagadeesan, Ravi & Kominers, Scott Duke & Rheingans-Yoo, Ross, 2018. "Strategy-proofness of worker-optimal matching with continuously transferable utility," Games and Economic Behavior, Elsevier, vol. 108(C), pages 287-294.
    15. Paul Milgrom, 2006. "Package Auctions and Package Exchanges: the 2004 Fisher-Schultz Lecture," Levine's Bibliography 321307000000000131, UCLA Department of Economics.
    16. Eric Maskin, 2004. "The Unity of Auction Theory: Paul Milgrom's Masterclass," Economics Working Papers 0044, Institute for Advanced Study, School of Social Science.
    17. Loertscher, Simon & Mezzetti, Claudio, 2021. "A dominant strategy, double clock auction with estimation-based tatonnement," Theoretical Economics, Econometric Society, vol. 16(3), July.
    18. Takehito Masuda & Ryo Mikami & Toyotaka Sakai & Shigehiro Serizawa & Takuma Wakayama, 2022. "The net effect of advice on strategy-proof mechanisms: an experiment for the Vickrey auction," Experimental Economics, Springer;Economic Science Association, vol. 25(3), pages 902-941, June.
    19. Satoru Fujishige & Zaifu Yang, 2020. "A Universal Dynamic Auction for Unimodular Demand Types: An Efficient Auction Design for Various Kinds of Indivisible Commodities," Discussion Papers 20/08, Department of Economics, University of York.
    20. Grigorieva, E. & Strobel, M., 2006. "Bidding behavior in the bisection auction : an experimental investigation," Research Memorandum 026, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).

    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:spr:sochwe:v:57:y:2021:i:1:d:10.1007_s00355-021-01309-y. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.