IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2102.10347.html
   My bibliography  Save this paper

Mechanism Design Powered by Social Interactions

Author

Listed:
  • Dengji Zhao

Abstract

Mechanism design has traditionally assumed that the set of participants are fixed and known to the mechanism (the market owner) in advance. However, in practice, the market owner can only directly reach a small number of participants (her neighbours). Hence the owner often needs costly promotions to recruit more participants in order to get desirable outcomes such as social welfare or revenue maximization. In this paper, we propose to incentivize existing participants to invite their neighbours to attract more participants. However, they would not invite each other if they are competitors. We discuss how to utilize the conflict of interest between the participants to incentivize them to invite each other to form larger markets. We will highlight the early solutions and open the floor for discussing the fundamental open questions in the settings of auctions, coalitional games, matching and voting.

Suggested Citation

  • Dengji Zhao, 2021. "Mechanism Design Powered by Social Interactions," Papers 2102.10347, arXiv.org.
    • Handle: RePEc:arx:papers:2102.10347
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2102.10347
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Tayfun Sönmez & M. Utku Ünver & M. Bumin Yenmez, 2020. "Incentivized Kidney Exchange," American Economic Review, American Economic Association, vol. 110(7), pages 2198-2224, July.
    2. Alvin E. Roth & Tayfun Sönmez & M. Utku Ünver, 2004. "Kidney Exchange," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 119(2), pages 457-488.
    3. Bin Li & Dong Hao & Dengji Zhao & Tao Zhou, 2018. "Customer Sharing in Economic Networks with Costs," Papers 1807.06822, arXiv.org.
    4. Benjamin Edelman & Michael Ostrovsky & Michael Schwarz, 2007. "Internet Advertising and the Generalized Second-Price Auction: Selling Billions of Dollars Worth of Keywords," American Economic Review, American Economic Association, vol. 97(1), pages 242-259, March.
    5. William Vickrey, 1961. "Counterspeculation, Auctions, And Competitive Sealed Tenders," Journal of Finance, American Finance Association, vol. 16(1), pages 8-37, March.
    6. Shapley, Lloyd & Scarf, Herbert, 1974. "On cores and indivisibility," Journal of Mathematical Economics, Elsevier, vol. 1(1), pages 23-37, March.
    7. Bulow, Jeremy I. & Klemperer, Paul, 1994. "Auctions vs. Negotiations," CEPR Discussion Papers 924, C.E.P.R. Discussion Papers.
    8. Satterthwaite, Mark Allen, 1975. "Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions," Journal of Economic Theory, Elsevier, vol. 10(2), pages 187-217, April.
    9. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    10. Edward Clarke, 1971. "Multipart pricing of public goods," Public Choice, Springer, vol. 11(1), pages 17-33, September.
    11. Gibbard, Allan, 1973. "Manipulation of Voting Schemes: A General Result," Econometrica, Econometric Society, vol. 41(4), pages 587-601, July.
    12. Groves, Theodore, 1973. "Incentives in Teams," Econometrica, Econometric Society, vol. 41(4), pages 617-631, July.
    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. Yuhang Guo & Dong Hao & Bin Li, 2022. "Combinatorial Procurement Auction in Social Networks," Papers 2208.14591, arXiv.org.
    2. Matthew Olckers & Toby Walsh, 2022. "Manipulation and Peer Mechanisms: A Survey," Papers 2210.01984, arXiv.org, revised May 2024.

    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. Marek Pycia & Peter Troyan, 2023. "A Theory of Simplicity in Games and Mechanism Design," Econometrica, Econometric Society, vol. 91(4), pages 1495-1526, July.
    2. Atila Abdulkadiroglu & Parag A. Pathak & Alvin E. Roth & Tayfun Sönmez, 2006. "Changing the Boston School Choice Mechanism," Levine's Bibliography 122247000000001022, UCLA Department of Economics.
    3. Philippe Jehiel & Laurent Lamy, 2018. "A Mechanism Design Approach to the Tiebout Hypothesis," Journal of Political Economy, University of Chicago Press, vol. 126(2), pages 735-760.
    4. repec:cte:werepe:we081207 is not listed on IDEAS
    5. Debasis Mishra & Abdul Quadir, 2012. "Deterministic single object auctions with private values," Discussion Papers 12-06, Indian Statistical Institute, Delhi.
    6. 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.
    7. Ning Chen & Nick Gravin & Pinyan Lu, 2014. "Truthful Generalized Assignments via Stable Matching," Mathematics of Operations Research, INFORMS, vol. 39(3), pages 722-736, August.
    8. , & , & ,, 2007. "Secure implementation," Theoretical Economics, Econometric Society, vol. 2(3), September.
    9. Thierry Marchant & Debasis Mishra, 2015. "Mechanism design with two alternatives in quasi-linear environments," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 44(2), pages 433-455, February.
    10. Ezzat Elokda & Saverio Bolognani & Andrea Censi & Florian Dorfler & Emilio Frazzoli, 2022. "A self-contained karma economy for the dynamic allocation of common resources," Papers 2207.00495, arXiv.org, revised May 2023.
    11. Dilip Mookherjee, 2008. "The 2007 Nobel Memorial Prize in Mechanism Design Theory," Scandinavian Journal of Economics, Wiley Blackwell, vol. 110(2), pages 237-260, June.
    12. Miralles, Antonio, 2012. "Cardinal Bayesian allocation mechanisms without transfers," Journal of Economic Theory, Elsevier, vol. 147(1), pages 179-206.
    13. James Schummer, 1999. "Almost-dominant Strategy Implementation," Discussion Papers 1278, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    14. Mizukami, Hideki & Saijo, Tatsuyoshi & Wakayama, Takuma, 2003. "Strategy-Proof Sharing," Working Papers 1170, California Institute of Technology, Division of the Humanities and Social Sciences.
    15. Maskin, Eric & Sjostrom, Tomas, 2002. "Implementation theory," Handbook of Social Choice and Welfare,in: K. J. Arrow & A. K. Sen & K. Suzumura (ed.), Handbook of Social Choice and Welfare, edition 1, volume 1, chapter 5, pages 237-288 Elsevier.
    16. Yuji Fujinaka & Takuma Wakayama, 2011. "Secure implementation in Shapley–Scarf housing markets," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 48(1), pages 147-169, September.
    17. Michael Ostrovsky & Michael Schwarz, 2023. "Reserve Prices in Internet Advertising Auctions: A Field Experiment," Journal of Political Economy, University of Chicago Press, vol. 131(12), pages 3352-3376.
    18. Yuhang Guo & Dong Hao & Bin Li, 2022. "Combinatorial Procurement Auction in Social Networks," Papers 2208.14591, arXiv.org.
    19. Philippe Jehiel & Moritz Meyer-ter-Vehn & Benny Moldovanu & William R. Zame, 2006. "The Limits of ex post Implementation," Econometrica, Econometric Society, vol. 74(3), pages 585-610, May.
    20. Committee, Nobel Prize, 2020. "Improvements to auction theory and inventions of new auction formats," Nobel Prize in Economics documents 2020-2, Nobel Prize Committee.
    21. Jeong, Seungwon (Eugene) & Lee, Joosung, 2024. "The groupwise-pivotal referral auction: Core-selecting referral strategy-proof mechanism," Games and Economic Behavior, Elsevier, vol. 143(C), pages 191-203.

    More about this item

    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:arx:papers:2102.10347. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.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.