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

Collective Upkeep

Author

Listed:
  • Erik Madsen
  • Eran Shmaya

Abstract

We design mechanisms for maintaining public goods which require periodic non-monetary contributions. Utilitarian welfare is maximized by concentrating contributions among low-cost group members, but such policies generally induce some members to leave the group or misreport their preferences. To forestall exit, contributions must be shifted from members with intermediate costs to some high-cost members. To deter misreporting, members must be screened using up to two membership tiers, which reward larger contributions with increased access to the good. We apply our results to the design of platforms such as Netflix and TikTok hosting crowd-sourced recommendation engines, which function as public goods supported by user feedback about new content.

Suggested Citation

  • Erik Madsen & Eran Shmaya, 2024. "Collective Upkeep," Papers 2407.05196, arXiv.org.
    • Handle: RePEc:arx:papers:2407.05196
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. , A., 2013. "Achievable outcomes of dynamic contribution games," Theoretical Economics, Econometric Society, vol. 8(2), May.
    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. Matros, Alexander & Smirnov, Vladimir, 2016. "Duplicative search," Games and Economic Behavior, Elsevier, vol. 99(C), pages 1-22.
    2. Tajika, Tomoya, 2020. "Contribute once! Full efficiency in a dynamic contribution game," Games and Economic Behavior, Elsevier, vol. 123(C), pages 228-239.
    3. Cason, Timothy N. & Zubrickas, Robertas, 2019. "Donation-based crowdfunding with refund bonuses," European Economic Review, Elsevier, vol. 119(C), pages 452-471.
    4. Harstad, Bård, 2023. "Pledge-and-review bargaining," Journal of Economic Theory, Elsevier, vol. 207(C).
    5. de Roos, Nicolas & Matros, Alexander & Smirnov, Vladimir & Wait, Andrew, 2018. "Shipwrecks and treasure hunters," Journal of Economic Dynamics and Control, Elsevier, vol. 90(C), pages 259-283.
    6. Chen, Yi, 2020. "A revision game of experimentation on a common threshold," Journal of Economic Theory, Elsevier, vol. 186(C).
    7. Harstad, Bård, 2021. "A Theory of Pledge-and-Review Bargaining," Memorandum 5/2022, Oslo University, Department of Economics, revised 21 Jun 2021.
    8. Marco Battaglini & Salvatore Nunnari & Thomas R. Palfrey, 2016. "The Dynamic Free Rider Problem: A Laboratory Study," American Economic Journal: Microeconomics, American Economic Association, vol. 8(4), pages 268-308, November.
    9. Matros, Alexander & Ponomareva, Natalia & Smirnov, Vladimir & Wait, Andrew, 2019. "Search without observability," Working Papers 2019-04, University of Sydney, School of Economics.
    10. Matros, Alexander & Ponomareva, Natalia & Smirnov, Vladimir & Wait, Andrew, 2022. "Search without looking," Journal of Economic Dynamics and Control, Elsevier, vol. 139(C).
    11. Gregorio Curello, 2021. "Incentives for Collective Innovation," Papers 2109.01885, arXiv.org, revised May 2023.
    12. Ryota Iijima & Akitada Kasahara, 2016. "Gradual Adjustment and Equilibrium Uniqueness under Noisy Monitoring," ISER Discussion Paper 0965, Institute of Social and Economic Research, Osaka University.

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