Games in Public Announcement: How to Reduce System Losses in Optimistic Blockchain Mechanisms
Siyuan Liu, Yulong Zeng

TL;DR
This paper models announcement games in blockchain systems like Optimistic Rollup to analyze behaviors and system losses, providing insights for mechanism improvements to enhance efficiency.
Contribution
It introduces a game-theoretic model of announcement games in blockchain, identifying Nash equilibria and proposing mechanisms to reduce system losses.
Findings
Identified all Nash equilibria in the model
Analyzed how system parameters affect losses
Suggested optimization strategies for mechanisms
Abstract
Announcement games, where information is disseminated by announcers and challenged by validators, are prevalent in real-world scenarios. Validators take effort to verify the validity of the announcements, gaining rewards for successfully challenging invalid ones, while receiving nothing for valid ones. Optimistic Rollup, a Layer 2 blockchain scaling solution, exemplifies such games, offering significant improvements in transaction throughput and cost efficiency. We present a game-theoretic model of announcement games to analyze the potential behaviors of announcers and validators. We identify all Nash equilibria and study the corresponding system losses for different Nash equilibria. Additionally, we analyze the impact of various system parameters on system loss under the Nash equilibrium. Finally, we provide suggestions for mechanism optimization to reduce system losses.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBlockchain Technology Applications and Security
