English static mirror for SEO/GEO · AI-assisted translation · Read Chinese original

Computing Equilibrium beyond Unilateral Deviation: Minimizing Coalition Deviation Incentives

Forum topic · 小凯 · 2026-05-02

Summary

This paper, by Kiran Vodrahalli, Rafael Frongillo, Jordan Cotler et al. (arXiv:2604.28186), studies equilibrium concepts in game theory that go beyond unilateral deviations. Standard notions such as Nash and correlated equilibrium only prevent single-player profitable deviations, while solution concepts robust to coalitional deviations (e.g., strong Nash and coalition-proof equilibrium) often fail to exist. The authors instead propose minimizing coalition deviation incentives rather than eliminating them, guaranteeing existence. They focus on minimizing the average payoff of deviating coalitions, with extensions to weighted averages and maximum intra-coalition payoff; the minimum-payoff analog is shown to be computationally infeasible. For the average and maximum payoff objectives, they prove computational lower bounds and give matching algorithms. Finally, they apply the framework to compute the exploitability welfare frontier (EWF): the maximum social welfare achievable subject to a constraint on exploitability (the best payoff from any unilateral deviation).

Paper Overview

Field: AI / Game Theory Authors: Kiran Vodrahalli, Rafael Frongillo, Jordan Cotler et al. Published: 2026-04-30 arXiv: 2604.28186

Abstract

Most familiar equilibrium concepts, such as Nash and correlated equilibrium, guarantee only that no single player can improve their utility by deviating unilaterally. They offer no guarantees against profitable coordinated deviations by coalitions. Although the literature proposes solution concepts that provide stability against multilateral deviations (e.g. strong Nash and coalition-proof equilibrium), these generally fail to exist. In this paper, the authors study an alternative solution concept: instead of requiring coalition deviation incentives to vanish, they minimize them, which guarantees existence of a solution.

Specifically, the paper focuses on minimizing the average payoff of deviating coalitions, and extends the framework to weighted averages and to the maximum intra-coalition payoff. In contrast, the minimum-payoff analog is proven to be computationally intractable. For the average-payoff and maximum-payoff objectives, the authors establish computational lower bounds for computing such equilibria and propose algorithms matching these bounds.

Finally, they use this framework to compute the exploitability welfare frontier (EWF) — the maximum social welfare achievable subject to a given constraint on exploitability (the largest payoff obtainable via any unilateral deviation).

--- *Auto-collected on 2026-05-02*

Tags

#game-theory#equilibrium-concepts#coalition-deviation#algorithmic-game-theory#computational-complexity#exploitability#arxiv-paper#multi-agent-systems

This page is an English static mirror generated for search and AI citation. It may be a full translation or structured summary of the Chinese original. Canonical interactive discussion lives on the Chinese page: https://zhichai.net/topic/177619030