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

Matching of Users and Creators in Two-Sided Markets with Departures

Author

Listed:
  • Daniel Huttenlocher
  • Hannah Li
  • Liang Lyu
  • Asuman Ozdaglar
  • James Siderius

Abstract

Many online platforms of today, including social media sites, are two-sided markets bridging content creators and users. Most of the existing literature on platform recommendation algorithms largely focuses on user preferences and decisions, and does not simultaneously address creator incentives. We propose a model of content recommendation that explicitly focuses on the dynamics of user-content matching, with the novel property that both users and creators may leave the platform permanently if they do not experience sufficient engagement. In our model, each player decides to participate at each time step based on utilities derived from the current match: users based on alignment of the recommended content with their preferences, and creators based on their audience size. We show that a user-centric greedy algorithm that does not consider creator departures can result in arbitrarily poor total engagement, relative to an algorithm that maximizes total engagement while accounting for two-sided departures. Moreover, in stark contrast to the case where only users or only creators leave the platform, we prove that with two-sided departures, approximating maximum total engagement within any constant factor is NP-hard. We present two practical algorithms, one with performance guarantees under mild assumptions on user preferences, and another that tends to outperform algorithms that ignore two-sided departures in practice.

Suggested Citation

  • Daniel Huttenlocher & Hannah Li & Liang Lyu & Asuman Ozdaglar & James Siderius, 2023. "Matching of Users and Creators in Two-Sided Markets with Departures," Papers 2401.00313, arXiv.org, revised Jan 2024.
  • Handle: RePEc:arx:papers:2401.00313
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Banghua Zhu & Sai Praneeth Karimireddy & Jiantao Jiao & Michael I. Jordan, 2023. "Online Learning in a Creator Economy," Papers 2305.11381, arXiv.org.
    2. Hector Chade & Jan Eeckhout & Lones Smith, 2017. "Sorting through Search and Matching Models in Economics," Journal of Economic Literature, American Economic Association, vol. 55(2), pages 493-544, June.
    3. Lauermann, Stephan & Nöldeke, Georg, 2014. "Stable marriages and search frictions," Journal of Economic Theory, Elsevier, vol. 151(C), pages 163-195.
    4. Hemant K. Bhargava, 2022. "The Creator Economy: Managing Ecosystem Supply, Revenue Sharing, and Platform Design," Management Science, INFORMS, vol. 68(7), pages 5233-5251, July.
    5. Lones Smith, 2006. "The Marriage Model with Search Frictions," Journal of Political Economy, University of Chicago Press, vol. 114(6), pages 1124-1146, December.
    6. Bezalel Gavish & Hasan Pirkul, 1991. "Algorithms for the Multi-Resource Generalized Assignment Problem," Management Science, INFORMS, vol. 37(6), pages 695-713, June.
    7. Meena Jagadeesan & Nikhil Garg & Jacob Steinhardt, 2022. "Supply-Side Equilibria in Recommender Systems," Papers 2206.13489, arXiv.org, revised Dec 2023.
    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. Yann Bramoullé & Brian W. Rogers & Erdem Yenerdag, 2022. "Matching with Recall," AMSE Working Papers 2203, Aix-Marseille School of Economics, France.
    2. Stephan Lauermann & Georg Nöldeke & Thomas Tröger, 2020. "The Balance Condition in Search‐and‐Matching Models," Econometrica, Econometric Society, vol. 88(2), pages 595-618, March.
    3. Günnur Ege Bilgin, 2024. "Decentralized Many-to-One Matching With Random Search," CRC TR 224 Discussion Paper Series crctr224_2024_541, University of Bonn and University of Mannheim, Germany.
    4. Roberto Bonilla & Alberto Trejos, 2021. "Marriage and employment participation with wage bargaining in search equilibrium," Scottish Journal of Political Economy, Scottish Economic Society, vol. 68(4), pages 517-533, September.
    5. Nicole Immorlica & Brendan Lucier & Vahideh Manshadi & Alexander Wei, 2023. "Designing Approximately Optimal Search on Matching Platforms," Management Science, INFORMS, vol. 69(8), pages 4609-4626, August.
    6. Cheremukhin, Anton & Restrepo-Echavarria, Paulina & Tutino, Antonella, 2020. "Targeted search in matching markets," Journal of Economic Theory, Elsevier, vol. 185(C).
    7. Lauermann, Stephan & Nöldeke, Georg, 2015. "Existence of steady-state equilibria in matching models with search frictions," Economics Letters, Elsevier, vol. 131(C), pages 1-4.
    8. Itai Ashlagi & Mark Braverman & Yash Kanoria & Peng Shi, 2020. "Clearing Matching Markets Efficiently: Informative Signals and Match Recommendations," Management Science, INFORMS, vol. 66(5), pages 2163-2193, May.
    9. Nicolas Bonneton & Christopher Sandmann, 2023. "Non-Stationary Search and Assortative Matching," CRC TR 224 Discussion Paper Series crctr224_2023_465, University of Bonn and University of Mannheim, Germany.
    10. Wu, Qinggong, 2015. "A finite decentralized marriage market with bilateral search," Journal of Economic Theory, Elsevier, vol. 160(C), pages 216-242.
    11. Jia, Hao, 2020. "The even split rule for (concave) symmetric supermodular functions," Economics Letters, Elsevier, vol. 186(C).
    12. Jia, Hao, 2019. "The even split rule in positive assortative matching," Journal of Mathematical Economics, Elsevier, vol. 81(C), pages 57-61.
    13. Antler, Yair & Bachi, Benjamin, 2019. "Searching Forever After," CEPR Discussion Papers 14103, C.E.P.R. Discussion Papers.
    14. Lones Smith & Axel Anderson, 2002. "Assortative Matching, Reputation, and the Beatles Break-Up," Game Theory and Information 0201002, University Library of Munich, Germany.
    15. Herrenbrueck, Lucas & Xia, Xiaoyu & Eastwick, Paul & Hui, Chin Ming, 2018. "Smart-dating in speed-dating: How a simple Search model can explain matching decisions," European Economic Review, Elsevier, vol. 106(C), pages 54-76.
    16. Li, Zhan, 2017. "Shareholder Activism Externalities," MPRA Paper 91635, University Library of Munich, Germany, revised 21 Jan 2019.
    17. Mattfeld, D. C. & Kopfer, H., 2003. "Terminal operations management in vehicle transshipment," Transportation Research Part A: Policy and Practice, Elsevier, vol. 37(5), pages 435-452, June.
    18. Domenico Tabasso, 2011. "With or Without You: Hazard of Divorce and Intra-household Allocation of Time," Melbourne Institute Working Paper Series wp2011n07, Melbourne Institute of Applied Economic and Social Research, The University of Melbourne.
    19. Davi B. Costa, 2021. "Benefits of marriage as a search strategy," Papers 2108.04885, arXiv.org, revised Aug 2021.
    20. Kirill Rudov, 2024. "Fragile Stable Matchings," Papers 2403.12183, arXiv.org.

    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:2401.00313. 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.