IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2402.06459.html

Maximizing NFT Incentives: References Make You Rich

Author

Listed:
  • Guangsheng Yu
  • Qin Wang
  • Caijun Sun
  • Lam Duc Nguyen
  • H. M. N. Dilum Bandara
  • Shiping Chen

Abstract

In this paper, we study how to optimize existing Non-Fungible Token (NFT) incentives. Upon exploring a large number of NFT-related standards and real-world projects, we come across an unexpected finding. That is, the current NFT incentive mechanisms, often organized in an isolated and one-time-use fashion, tend to overlook their potential for scalable organizational structures. We propose, analyze, and implement a novel reference incentive model, which is inherently structured as a Directed Acyclic Graph (DAG)-based NFT network. This model aims to maximize connections (or references) between NFTs, enabling each isolated NFT to expand its network and accumulate rewards derived from subsequent or subscribed ones. We conduct both theoretical and practical analyses of the model, demonstrating its optimal utility.

Suggested Citation

  • Guangsheng Yu & Qin Wang & Caijun Sun & Lam Duc Nguyen & H. M. N. Dilum Bandara & Shiping Chen, 2024. "Maximizing NFT Incentives: References Make You Rich," Papers 2402.06459, arXiv.org.
    • Handle: RePEc:arx:papers:2402.06459
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Bao, Te & Ma, Mengzhong & Wen, Yonggang, 2023. "Herding in the non-fungible token (NFT) market," Journal of Behavioral and Experimental Finance, Elsevier, vol. 39(C).
    2. Philip J. Reny, 1999. "On the Existence of Pure and Mixed Strategy Nash Equilibria in Discontinuous Games," Econometrica, Econometric Society, vol. 67(5), pages 1029-1056, September.
    3. Arthur Charpentier & Romuald Élie & Carl Remlinger, 2023. "Reinforcement Learning in Economics and Finance," Computational Economics, Springer;Society for Computational Economics, vol. 62(1), pages 425-462, 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. Philippe Bich & Rida Laraki, 2017. "Externalities in Economies with Endogenous Sharing Rules," PSE-Ecole d'économie de Paris (Postprint) halshs-01437507, HAL.
    2. Giacomo Lanzani, 2025. "Dynamic Concern for Misspecification," Econometrica, Econometric Society, vol. 93(4), pages 1333-1370, July.
    3. Allison, Blake A. & Bagh, Adib & Lepore, Jason J., 2018. "Sufficient conditions for weak reciprocal upper semi-continuity in mixed extensions of games," Journal of Mathematical Economics, Elsevier, vol. 74(C), pages 99-107.
    4. Oriol Carbonell-Nicolau, 2021. "Equilibria in infinite games of incomplete information," International Journal of Game Theory, Springer;Game Theory Society, vol. 50(2), pages 311-360, June.
    5. Philippe Bich & Rida Laraki, 2015. "Abstract Economies with Endogenous Sharing Rules," Documents de travail du Centre d'Economie de la Sorbonne 15058, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    6. Jacobovic, Royi & Levy, Yehuda John & Solan, Eilon, 0. "Bayesian games with nested information," Theoretical Economics, Econometric Society.
    7. Pak Hung Au & Mark Whitmeyer, 2018. "Attraction versus Persuasion: Information Provision in Search Markets," Papers 1802.09396, arXiv.org, revised May 2022.
    8. Blake A. Allison & Jason J. Lepore, 2025. "A General Model of Bertrand–Edgeworth Duopoly," Games, MDPI, vol. 16(3), pages 1-37, May.
    9. Paulo k. Monteiro & Jaime Orrillo & Rudy Rosas, 2019. "Hyperopic Topologies Once Again," Economics Bulletin, AccessEcon, vol. 39(4), pages 2706-2710.
    10. repec:eid:wpaper:58137 is not listed on IDEAS
    11. Guilherme Carmona, 2011. "Symposium on: Existence of Nash equilibria in discontinuous games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 48(1), pages 1-4, September.
    12. Pálvölgyi, Dénes & Peters, Hans & Vermeulen, Dries, 2014. "A strategic approach to multiple estate division problems," Games and Economic Behavior, Elsevier, vol. 88(C), pages 135-152.
    13. Philippe Bich, 2016. "Prudent Equilibria and Strategic Uncertainty in Discontinuous Games," Working Papers halshs-01337293, HAL.
    14. Rabia Nessah & Guoqiang Tian, 2013. "Existence of Solution of Minimax Inequalities, Equilibria in Games and Fixed Points Without Convexity and Compactness Assumptions," Journal of Optimization Theory and Applications, Springer, vol. 157(1), pages 75-95, April.
    15. Jonathan Vogel, 2008. "Spatial Competition with Heterogeneous Firms," Journal of Political Economy, University of Chicago Press, vol. 116(3), pages 423-466, June.
    16. He, Wei & Yannelis, Nicholas C., 2016. "Existence of equilibria in discontinuous Bayesian games," Journal of Economic Theory, Elsevier, vol. 162(C), pages 181-194.
    17. Erik Balder, 2011. "An equilibrium closure result for discontinuous games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 48(1), pages 47-65, September.
    18. Au, Pak Hung & Kawai, Keiichi, 2020. "Competitive information disclosure by multiple senders," Games and Economic Behavior, Elsevier, vol. 119(C), pages 56-78.
    19. Page, Frank Jr. & Monteiro, Paulo K., 2003. "Three principles of competitive nonlinear pricing," Journal of Mathematical Economics, Elsevier, vol. 39(1-2), pages 63-109, February.
    20. Plan, Asaf, 2023. "Symmetry in n-player games," Journal of Economic Theory, Elsevier, vol. 207(C).
    21. Bertrand Crettez & Rabia Nessah & Tarik Tazdaït, 2025. "Nash Equilibrium in Discontinuous Games: A Weakening of Reny’s Robust Better-Reply Correspondence Property," Post-Print hal-05305754, HAL.

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