Game Theory for Crypto
Strategic analysis framework for understanding and designing incentive systems in web3.
"Every protocol is a game. Every token is an incentive. Every user is a player. Understand the rules, or become the played."
When to Use This Skill
- - Analyzing tokenomics for exploits or misaligned incentives
- Evaluating governance proposals and voting mechanisms
- Understanding MEV and adversarial transaction ordering
- Designing auction mechanisms (NFT drops, token sales, liquidations)
- Predicting how rational actors will behave in a system
- Identifying attack vectors in DeFi protocols
- Modeling liquidity provision strategies
- Assessing protocol sustainability
Core Framework
The Five Questions
For any protocol or mechanism, ask:
- 1. Who are the players? (Users, LPs, validators, searchers, governance token holders)
- What are their strategies? (Actions available to each player)
- What are the payoffs? (How does each outcome affect each player?)
- What information do they have? (Complete, incomplete, asymmetric?)
- What's the equilibrium? (Where do rational actors end up?)
Analysis Template
CODEBLOCK0
Reference Documents
Designing systems with desired equilibria |
|
Auction Theory | Token sales, NFT drops, liquidations |
|
MEV Game Theory | Adversarial transaction ordering |
|
Tokenomics Analysis | Evaluating token incentive structures |
|
Governance Attacks | Voting manipulation and capture |
|
Liquidity Games | LP strategies and impermanent loss |
|
Information Economics | Asymmetric information and signaling |
Quick Concepts
Nash Equilibrium
A state where no player can improve their payoff by unilaterally changing strategy. The "stable" outcome of a game.
Crypto application: In a staking system, Nash equilibrium determines the stake distribution across validators.
Dominant Strategy
A strategy that's optimal regardless of what others do.
Crypto application: In a second-price auction, bidding your true value is dominant.
Pareto Efficiency
An outcome where no one can be made better off without making someone worse off.
Crypto application: AMM fee structures try to be Pareto efficient for traders and LPs.
Mechanism Design
"Reverse game theory" - designing rules to achieve desired outcomes.
Crypto application: Designing token vesting schedules to align long-term incentives.
Schelling Point
A solution people converge on without communication.
Crypto application: Why certain price levels act as psychological support/resistance.
Incentive Compatibility
When truthful behavior is optimal for participants.
Crypto application: Oracle designs where honest reporting is the dominant strategy.
Common Knowledge
Everyone knows X, everyone knows everyone knows X, infinitely recursive.
Crypto application: Public blockchain state creates common knowledge of balances/positions.
Analysis Patterns
Pattern 1: The Tragedy of the Commons
Structure: Shared resource, individual incentive to overuse, collective harm.
Crypto examples:
- - Gas price bidding during congestion
- Governance token voting apathy
- MEV extraction degrading UX
Solution approaches:
- - Harberger taxes
- Quadratic mechanisms
- Commitment schemes
Pattern 2: The Prisoner's Dilemma
Structure: Individual rationality leads to collective irrationality.
Crypto examples:
- - Liquidity mining mercenaries (farm and dump)
- Race-to-bottom validator fees
- Bridge security (each chain wants others to secure)
Solution approaches:
- - Repeated games (reputation)
- Commitment mechanisms (staking/slashing)
- Mechanism redesign
Pattern 3: The Coordination Game
Structure: Multiple equilibria, players want to coordinate but may fail.
Crypto examples:
- - Which L2 to use?
- Token standard adoption
- Hard fork coordination
Solution approaches:
- - Focal points (Schelling points)
- Sequential moves (first mover advantage)
- Communication mechanisms
Pattern 4: The Principal-Agent Problem
Structure: One party acts on behalf of another with misaligned incentives.
Crypto examples:
- - Protocol team vs token holders
- Delegates in governance
- Fund managers
Solution approaches:
- - Incentive alignment (token vesting)
- Monitoring (transparency)
- Bonding (skin in game)
Pattern 5: Adverse Selection
Structure: Information asymmetry leads to market breakdown.
Crypto examples:
- - Token launches (team knows more than buyers)
- Insurance protocols (risky users more likely to buy)
- Lending (borrowers know their risk better)
Solution approaches:
- - Signaling (lock-ups, audits)
- Screening (credit scores, history)
- Pooling equilibria
Pattern 6: Moral Hazard
Structure: Hidden action after agreement leads to risk-taking.
Crypto examples:
- - Protocols with insurance may take more risk
- Bailout expectations encourage leverage
- Anonymous teams may rug
Solution approaches:
- - Monitoring and transparency
- Incentive alignment
- Reputation systems
Common Crypto Games
The MEV Game
Players: Users, searchers, builders, validators
Key insight: Transaction ordering is a game; users are often the losers
See: MEV Strategies
The Liquidity Game
Players: LPs, traders, arbitrageurs
Key insight: Impermanent loss is the cost of being adversely selected against
See: Liquidity Games
The Governance Game
Players: Token holders, delegates, protocol team
Key insight: Rational apathy + concentrated interests = capture
See: Governance Attacks
The Staking Game
Players: Stakers, validators, delegators
Key insight: Security budget must exceed attack profit
See: Tokenomics Analysis
The Oracle Game
Players: Data providers, consumers, attackers
Key insight: Profit from manipulation must be less than cost
See: Mechanism Design
Red Flags in Protocol Design
Tokenomics Red Flags
- - Insiders can sell before others (vesting asymmetry)
- Inflation benefits few, dilutes many
- No sink mechanisms (perpetual selling pressure)
- Rewards without risk (free money = someone else paying)
Governance Red Flags
- - Low quorum thresholds (minority capture)
- No time delay (flash loan attacks)
- Token voting only (plutocracy)
- Delegates with no skin in game
Mechanism Red Flags
- - First-come-first-served (bot advantage)
- Sealed bids without commitment (frontrunning)
- Rebates/refunds (MEV extraction)
- Complex formulas (hidden exploits)
Advanced Topics
Repeated Games and Reputation
Single-shot games often have bad equilibria. Repetition enables cooperation through:
- - Trigger strategies (cooperate until defection)
- Reputation building (costly to destroy)
- Future value (patient players cooperate more)
Crypto application: Why anonymous actors behave worse than doxxed teams.
Evolutionary Game Theory
Strategies that survive competitive selection. Relevant for:
- - Which protocols survive long-term
- Memetic competition between narratives
- Bot strategy evolution
Bayesian Games
Games with incomplete information. Players have beliefs about others' types.
Crypto application: Trading with unknown counterparties, evaluating anonymous teams.
Cooperative Game Theory
When players can form binding coalitions.
Crypto application: MEV extraction coalitions, validator cartels, governance blocs.
Algorithmic Game Theory
Computational aspects of game theory.
Crypto application: On-chain game computation limits, gas-efficient mechanism design.
Methodology
Step 1: Model the Game
- - Identify all players (including those not obvious)
- Map complete strategy spaces
- Define payoff functions precisely
- Specify information structure
Step 2: Find Equilibria
- - Check for dominant strategies
- Compute Nash equilibria
- Identify Pareto improvements
- Consider trembling-hand perfection
Step 3: Stress Test
- - What if players collude?
- What if new players enter?
- What if information leaks?
- What if parameters change?
Step 4: Recommend
- - Mechanism changes to improve equilibrium
- Monitoring to detect deviations
- Parameter bounds to maintain stability
Resources
Foundational Texts
- - "Theory of Games and Economic Behavior" - von Neumann & Morgenstern
- "A Beautiful Mind" (Nash's life, accessible intro)
- "The Strategy of Conflict" - Schelling
- "Mechanism Design Theory" - Myerson (Nobel lecture)
Crypto-Specific
- - "Flash Boys 2.0" - MEV paper
- "SoK: DeFi Attacks" - Systemization of DeFi exploits
- "Clockwork Finance" - MEV and mechanism design
- Paradigm research blog
Tools
- - Nashpy (Python game theory library)
- Gambit (game theory software)
- Agent-based modeling frameworks
加密领域的博弈论
用于理解和设计Web3激励系统的战略分析框架。
每个协议都是一场博弈。每个代币都是一种激励。每个用户都是一名玩家。要么理解规则,要么成为被玩弄的对象。
何时使用此技能
- - 分析代币经济模型中的漏洞或错位的激励
- 评估治理提案和投票机制
- 理解MEV和对抗性交易排序
- 设计拍卖机制(NFT发售、代币销售、清算)
- 预测理性行为者在系统中的行为
- 识别DeFi协议中的攻击向量
- 建模流动性提供策略
- 评估协议的可持续性
核心框架
五个问题
对于任何协议或机制,需要问:
- 1. 玩家是谁?(用户、LP、验证者、搜索者、治理代币持有者)
- 他们的策略是什么?(每个玩家可采取的行动)
- 收益是什么?(每个结果如何影响每个玩家?)
- 他们拥有什么信息?(完全信息、不完全信息、非对称信息?)
- 均衡是什么?(理性行为者最终会达到什么状态?)
分析模板
markdown
协议:[名称]
玩家
- - 玩家A:[角色、目标、约束]
- 玩家B:[角色、目标、约束]
- ...
策略空间
- - 玩家A可以:[列出可能的行动]
- 玩家B可以:[列出可能的行动]
收益结构
- - 如果(A做X,B做Y):A获得[收益],B获得[收益]
- ...
信息结构
- - 公共信息:[每个人都知道的信息]
- 私有信息:[只有部分玩家知道的信息]
- 可观察行动:[链上可见的信息]
均衡分析
- - 纳什均衡:[没有玩家愿意偏离的稳定结果]
- 占优策略:[无论他人如何行动都是最优的策略]
- 潜在漏洞:[有利于攻击者的偏离行为]
建议
参考文档
设计具有理想均衡的系统 |
|
拍卖理论 | 代币销售、NFT发售、清算 |
|
MEV博弈论 | 对抗性交易排序 |
|
代币经济模型分析 | 评估代币激励结构 |
|
治理攻击 | 投票操纵和捕获 |
|
流动性博弈 | LP策略和无常损失 |
|
信息经济学 | 非对称信息和信号传递 |
快速概念
纳什均衡
没有玩家可以通过单方面改变策略来改善收益的状态。博弈的稳定结果。
加密应用: 在质押系统中,纳什均衡决定了验证者之间的质押分布。
占优策略
无论他人如何行动都是最优的策略。
加密应用: 在第二价格拍卖中,出价真实价值是占优策略。
帕累托效率
没有人可以在不使他人变差的情况下变得更好的结果。
加密应用: AMM费用结构试图对交易者和LP实现帕累托效率。
机制设计
逆向博弈论——设计规则以实现期望的结果。
加密应用: 设计代币解锁时间表以对齐长期激励。
谢林点
人们无需沟通就能趋同的解决方案。
加密应用: 为什么某些价格水平充当心理支撑/阻力位。
激励相容性
当诚实行为对参与者来说是最优的。
加密应用: 预言机设计中,诚实报告是占优策略。
共同知识
每个人都知道X,每个人都知道每个人都知道X,无限递归。
加密应用: 公共区块链状态创造了关于余额/头寸的共同知识。
分析模式
模式1:公地悲剧
结构: 共享资源,个人过度使用的激励,集体损害。
加密示例:
- - 拥堵期间的气价竞标
- 治理代币投票冷漠
- MEV提取降低用户体验
解决方案:
模式2:囚徒困境
结构: 个体理性导致集体非理性。
加密示例:
- - 流动性挖矿雇佣兵(挖矿即抛售)
- 验证者费用的逐底竞争
- 桥接安全(每条链都希望其他链来保障安全)
解决方案:
- - 重复博弈(声誉)
- 承诺机制(质押/罚没)
- 机制重新设计
模式3:协调博弈
结构: 多重均衡,玩家想要协调但可能失败。
加密示例:
解决方案:
模式4:委托-代理问题
结构: 一方代表另一方行事,但激励不一致。
加密示例:
- - 协议团队 vs 代币持有者
- 治理中的代表
- 基金经理
解决方案:
- - 激励对齐(代币解锁)
- 监督(透明度)
- 保证金(利益绑定)
模式5:逆向选择
结构: 信息不对称导致市场崩溃。
加密示例:
- - 代币发行(团队比买家了解更多)
- 保险协议(风险用户更可能购买)
- 借贷(借款人更了解自己的风险)
解决方案:
- - 信号传递(锁仓、审计)
- 筛选(信用评分、历史记录)
- 混合均衡
模式6:道德风险
结构: 协议后的隐藏行动导致冒险行为。
加密示例:
- - 有保险的协议可能承担更多风险
- 救助预期鼓励杠杆
- 匿名团队可能跑路
解决方案:
常见加密博弈
MEV博弈
玩家: 用户、搜索者、构建者、验证者
关键洞察: 交易排序是一场博弈;用户往往是输家
参见:MEV策略
流动性博弈
玩家: LP、交易者、套利者
关键洞察: 无常损失是被逆向选择的代价
参见:流动性博弈
治理博弈
玩家: 代币持有者、代表、协议团队
关键洞察: 理性冷漠 + 集中利益 = 捕获
参见:治理攻击
质押博弈
玩家: 质押者、验证者、委托者
关键洞察: 安全预算必须超过攻击利润
参见:代币经济模型分析
预言机博弈
玩家: 数据提供者、消费者、攻击者
关键洞察: 操纵利润必须低于成本
参见:机制设计
协议设计中的危险信号
代币经济模型危险信号
- - 内部人士可以比其他人先卖出(解锁不对称)
- 通胀使少数人受益,稀释多数人
- 没有消耗机制(持续的卖压)
- 无风险的奖励(免费资金 = 别人在买单)
治理危险信号
- - 低法定人数门槛(少数派捕获)
- 没有时间延迟(闪电贷攻击)
- 仅代币投票(富豪统治)
- 没有利益绑定的代表
机制危险信号
- - 先到先得(机器人优势)
- 无承诺的密封投标(抢先交易)
- 返利/退款(MEV提取)
- 复杂公式(隐藏漏洞)
高级主题
重复博弈与声誉
单次博弈往往有糟糕的均衡。重复通过以下方式实现合作:
- - 触发策略(合作直到背叛)
- 声誉建立(破坏成本高)
- 未来价值(耐心玩家更合作)
加密应用: 为什么匿名行为者比实名团队表现更差。
演化博弈论
在竞争选择中存活的策略。相关于:
- - 哪些协议能长期存活
- 叙事之间的模因竞争
- 机器人策略演化
贝叶斯博弈
不完全信息博弈。玩家对其他人的类型有信念。
加密应用: 与未知对手方交易,评估匿名团队。
合作博弈论
当玩家可以形成有约束力的联盟时。
加密应用: MEV提取联盟、验证者卡特尔、治理集团。
算法博弈论
博弈论的计算方面。
加密应用: 链上博弈计算限制、gas高效的机制设计。
方法论
步骤1:建模博弈