Reproduce “Equilibria in the Tangle” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Serguei Popov, Olivia Saa, Paulo Finardi
This research explores the IOTA Tangle's robustness by modeling selfish node behavior through game theory and simulations, revealing the existence of Nash equilibria. It finds that even when optimizing for personal transaction confirmation, selfish strategies often lead to self-correcting network dynamics, resulting in a limited cost increase (typically under 25%) for honest participants and sometimes even a positive impact.
Key insights
- The Tangle's design inherently supports Nash equilibria, indicating theoretical stability even in the presence of selfish actors optimizing their strategies.
- Widespread adoption of purely 'greedy' strategies by selfish players is often self-defeating due to overcrowding, leading to a self-correcting dynamic that pushes behavior towards more cooperative or mixed strategies.
- The randomness parameter (α) in the tip selection algorithm significantly influences the Tangle's resilience, with higher randomness generally enhancing its robustness against selfish behavior.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.