纠结中的平衡
Equilibria in the Tangle
摘要:
我们分析了缠结-一个DAG值的随机过程,其中新的顶点得到附加到图在泊松时间,和附件的位置选择通过随机游动在该图上。这些新的顶点,也被认为是“交易”,由许多参与者(网络的节点)独立发布。该模型的主要应用是它被用作IOTA加密货币系统(www.iota.org)的基础。我们证明了存在的“几乎对称”的纳什均衡的系统中的一部分球员试图优化他们的附件策略。然后,我们还提出了模拟表明,“自私”的球员仍然会与网络合作,选择附件的策略,类似于“推荐”的。
英文摘要:
We analyse the Tangle --- a DAG-valued stochastic process where new vertices get attached to the graph at Poissonian times, and the attachment's locations are chosen by means of random walks on that graph. These new vertices, also thought of as "transactions", are issued by many players (which are the nodes of the network), independently. The main application of this model is that it is used as a base for the IOTA cryptocurrency system (www.iota.org). We prove existence of "almost symmetric" Nash equilibria for the system where a part of players tries to optimize their attachment strategies. Then, we also present simulations that show that the "selfish" players will nevertheless cooperate with the network by choosing attachment strategies that are similar to the "recommended" one.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。