[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/3366423.3380276acmconferencesArticle/Chapter ViewAbstractPublication PagesthewebconfConference Proceedingsconference-collections
research-article

Liquidity in Credit Networks with Constrained Agents

Published: 20 April 2020 Publication History

Abstract

In order to scale transaction rates for deployment across the global web, many cryptocurrencies have deployed so-called ”Layer-2” networks of private payment channels. An idealized payment network behaves like a Credit Network, a model for transactions across a network of bilateral trust relationships. Credit Networks capture many aspects of traditional currencies as well as new virtual currencies and payment mechanisms. In the traditional credit network model, if an agent defaults, every other node that trusted it is vulnerable to loss. In a cryptocurrency context, trust is manufactured by capital deposits, and thus there arises a natural tradeoff between network liquidity (i.e. the fraction of transactions that succeed) and the cost of capital deposits.
In this paper, we introduce constraints that bound the total amount of loss that the rest of the network can suffer if an agent (or a set of agents) were to default - equivalently, how the network changes if agents can support limited solvency guarantees.
We show that these constraints preserve the analytical structure of a credit network. Furthermore, we show that aggregate borrowing constraints greatly simplify the network structure and in the payment network context achieve the optimal tradeoff between liquidity and amount of escrowed capital.

References

[1]
2011. SplitWise. http://www.splitwise.com
[2]
Hans L Bodlaender. 1998. A partial k-arboretum of graphs with bounded treewidth. Theoretical computer science 209, 1-2 (1998), 1–45.
[3]
Dietrich Braess, Anna Nagurney, and Tina Wakolbinger. 2005. On a paradox of traffic planning. Transportation science 39, 4 (2005), 446–450.
[4]
Simina Brânzei, Erel Segal-Halevi, and Aviv Zohar. 2017. How to charge lightning. arXiv preprint arXiv:1712.10222(2017).
[5]
Youngbin Choe and David G Wagner. 2006. Rayleigh matroids. Combinatorics, Probability and Computing 15, 5 (2006), 765–781.
[6]
Pranav Dandekar, Ashish Goel, Ramesh Govindan, and Ian Post. 2011. Liquidity in credit networks: A little trust goes a long way. In Proceedings of the 12th ACM conference on Electronic commerce. ACM, 147–156.
[7]
Pranav Dandekar, Ashish Goel, Michael P Wellman, and Bryce Wiedenbeck. 2015. Strategic formation of credit networks. ACM Transactions on Internet Technology (TOIT) 15, 1 (2015), 3.
[8]
Dd B DeFigueiredo and Earl T Barr. 2005. Trustdavis: A non-exploitable online reputation system. In E-Commerce Technology, 2005. CEC 2005. Seventh IEEE International Conference on. IEEE, 274–283.
[9]
Arpita Ghosh, Mohammad Mahdian, Daniel M Reeves, David M Pennock, and Ryan Fugger. 2007. Mechanism design on trust networks. In International Workshop on Web and Internet Economics. Springer, 257–268.
[10]
Ashish Goel, Sanjeev Khanna, Sharath Raghvendra, and Hongyang Zhang. 2015. Connectivity in random forests and credit networks. In Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, 2037–2048.
[11]
Dean Karlan, Markus Mobius, Tanya Rosenblat, and Adam Szeidl. 2009. Trust and social collateral. The Quarterly Journal of Economics 124, 3 (2009), 1307–1361.
[12]
Daniel J Kleitman and Kenneth J Winston. 1981. Forests and score vectors. Combinatorica 1, 1 (1981), 49–54.
[13]
Zhengye Liu, Hao Hu, Yong Liu, Keith W Ross, Yao Wang, and Markus Mobius. 2010. P2P trading in social networks: The value of staying connected. In 2010 Proceedings IEEE INFOCOM. IEEE, 1–9.
[14]
David Mazières. 2015. The stellar consensus protocol: A federated model for internet-level consensus. (2015).
[15]
Alan Mislove, Ansley Post, Peter Druschel, and P Krishna Gummadi. 2008. Ostra: Leveraging Trust to Thwart Unwanted Communication.
[16]
Steven D Noble. 1998. Evaluating the Tutte polynomial for graphs of bounded tree-width. Combinatorics, probability and computing 7, 3 (1998), 307–321.
[17]
Joseph Poon and Thaddeus Dryja. 2016. The bitcoin lightning network: Scalable off-chain instant payments. (2016).
[18]
Daniel M Reeves, Bethany M Soule, and Tejaswi Kasturi. 2007. Yootopia!ACM SIGecom Exchanges 6, 2 (2007), 1–26.
[19]
Charles Semple and Dominic Welsh. 2008. Negative correlation in graphs and matroids. Combinatorics, Probability and Computing 17, 3 (2008), 423–435.

Cited By

View all
  • (2022)Learning-Based Off-Chain Transaction Scheduling in Prioritized Payment Channel NetworksIEEE Journal on Selected Areas in Communications10.1109/JSAC.2022.321333340:12(3589-3599)Online publication date: Dec-2022
  • (2021)The effect of network topology on credit network throughputPerformance Evaluation10.1016/j.peva.2021.102235151:COnline publication date: 1-Nov-2021
  • (2020)Continuous Credit Networks and Layer 2 Blockchains: Monotonicity and SamplingProceedings of the 21st ACM Conference on Economics and Computation10.1145/3391403.3399533(613-635)Online publication date: 13-Jul-2020

Index Terms

  1. Liquidity in Credit Networks with Constrained Agents
    Index terms have been assigned to the content through auto-classification.

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    WWW '20: Proceedings of The Web Conference 2020
    April 2020
    3143 pages
    ISBN:9781450370233
    DOI:10.1145/3366423
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 20 April 2020

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. Credit Networks
    2. Electronic Fund Transfer
    3. Trust

    Qualifiers

    • Research-article
    • Research
    • Refereed limited

    Conference

    WWW '20
    Sponsor:
    WWW '20: The Web Conference 2020
    April 20 - 24, 2020
    Taipei, Taiwan

    Acceptance Rates

    Overall Acceptance Rate 1,899 of 8,196 submissions, 23%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)15
    • Downloads (Last 6 weeks)1
    Reflects downloads up to 09 Dec 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2022)Learning-Based Off-Chain Transaction Scheduling in Prioritized Payment Channel NetworksIEEE Journal on Selected Areas in Communications10.1109/JSAC.2022.321333340:12(3589-3599)Online publication date: Dec-2022
    • (2021)The effect of network topology on credit network throughputPerformance Evaluation10.1016/j.peva.2021.102235151:COnline publication date: 1-Nov-2021
    • (2020)Continuous Credit Networks and Layer 2 Blockchains: Monotonicity and SamplingProceedings of the 21st ACM Conference on Economics and Computation10.1145/3391403.3399533(613-635)Online publication date: 13-Jul-2020

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    HTML Format

    View this article in HTML Format.

    HTML Format

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media