Strategic Formation of Credit Networks

被引:13
作者
Dandekar, Pranav [1 ]
Goel, Ashish [1 ]
Wellman, Michael P. [2 ]
Wiedenbeck, Bryce [2 ]
机构
[1] Stanford Univ, Dept Management Sci & Engn, Stanford, CA 94305 USA
[2] Univ Michigan, Div Comp Sci & Engn, Ann Arbor, MI 48109 USA
基金
美国国家科学基金会;
关键词
Theory; Economics; Trust; credit networks; strategic network formation; empirical game-theoretic analysis; TRUST;
D O I
10.1145/2700058
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Credit networks are an abstraction for modeling trust among agents in a network. Agents who do not directly trust each other can transact through exchange of IOUs (obligations) along a chain of trust in the network. Credit networks are robust to intrusion, can enable transactions between strangers in exchange economies, and have the liquidity to support a high rate of transactions. We study the formation of such networks when agents strategically decide how much credit to extend each other. We find strong positive network formation results for the simplest theoretical model. When each agent trusts a fixed set of other agents and transacts directly only with those it trusts, all pure-strategy Nash equilibria are social optima. However, when we allow transactions over longer paths, the price of anarchy may be unbounded. On the positive side, when agents have a shared belief about the trustworthiness of each agent, simple greedy dynamics quickly converge to a star-shaped network, which is a social optimum. Similar star-like structures are found in equilibria of heuristic strategies found via simulation studies. In addition, we simulate environments where agents may have varying information about each others' trustworthiness based on their distance in a social network. Empirical game analysis of these scenarios suggests that star structures arise only when defaults are relatively rare, and otherwise, credit tends to be issued over short social distances conforming to the locality of information. Overall, we find that networks formed by self-interested agents achieve a high fraction of available value, as long as this potential value is large enough to enable any network to form.
引用
收藏
页码:51 / 91
页数:41
相关论文
共 26 条
[1]  
[Anonymous], P IEEE INFOCOM
[2]  
[Anonymous], P 12 WORKSH EC INF S
[3]  
[Anonymous], 2008, NSDI
[4]  
[Anonymous], 2012, P 7 ACM EUROPEAN C C
[5]   Contribution Games in Networks [J].
Anshelevich, Elliot ;
Hoefer, Martin .
ALGORITHMICA, 2012, 63 (1-2) :51-90
[6]   A noncooperative model of network formation [J].
Bala, V ;
Goyal, S .
ECONOMETRICA, 2000, 68 (05) :1181-1229
[7]  
Blume L, 2011, P 12 ACM C EL COMM, P1, DOI DOI 10.1145/1993574.1993576
[8]  
Cassell Ben-Alexander., 2013, Multi-Agent-Based Simulation XIII, P85
[9]   A study of nash equilibrium in contribution games for peer-to-peer networks [J].
Corbo, Jacomo ;
Calvó-Armengol, Antoni ;
Parkes, David .
Operating Systems Review (ACM), 2006, 40 (03) :61-66
[10]  
Dandekar Pranav., 2011, P 12 ACM C ELECT COM, P147