Search arXivSearch

arXiv · 2604.07544

Zero-Sum Fictitious Play Cannot Converge to a Point

Abstract

Fictitious play is a history-based learning process in which players best respond to the empirical distribution of their opponents' past play. Although classical results show that fictitious play converges to the set of Nash equilibria in zero-sum games, this set convergence does not imply convergence to a single equilibrium when the equilibrium set is non-singleton. This paper shows that pointwise convergence fails in a strong sense. Suppose the equilibrium set of a player has positive measure and consists only of fully mixed strategies. Then, under any tie-breaking rule, the empirical strategy of that player cannot converge to any equilibrium point, provided it is initialized outside the equilibrium set -- in particular, when the player starts with no prior beliefs. The proof identifies two mechanisms behind this instability. In the interior of the equilibrium set, the dynamics retain inertia that prevents settling. At the boundary, the opponent's deviations from its unique equilibrium action steadily unbalance the cumulative payoffs that drive best responses, so that not all actions can remain competitive, as a fully mixed limit would require. The results clarify the gap between convergence to an equilibrium set and convergence to an equilibrium point in fictitious play.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jaehong Moon. 2026-06-12. Zero-Sum Fictitious Play Cannot Converge to a Point. https://arxiv.org/abs/2604.07544

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Learning in Structured Stackelberg Games

We initiate the study of structured Stackelberg games, a novel form of strategic interaction between a leader and a follower where contextual information can be predictive of the follower's (unknown) type. Motivated by applications such as security games and AI safety, we show how this additional structure can help the leader learn a utility-maximizing policy in both the online and distributional settings. In the online setting, we first prove that standard learning-theoretic measures of complexity do not characterize the difficulty of the leader's learning task. Notably, we find that there exists a learning-theoretic measure of complexity, analogous to the Littlestone dimension in online classification, that tightly characterizes the leader's instance-optimal regret. We term this the Stackelberg-Littlestone dimension, and leverage it to provide a provably optimal online learning algorithm. In the distributional setting, we provide analogous results by showing that two new dimensions control the sample complexity upper- and lower-bound.

cs.GT

Equilibrium and Infeasibility: A new solution concept for games

Addressing infeasibility in non-cooperative games has become an important topic, as many problems across different applications face this issue. In this paper, we propose a new solution concept for generalized games with possibly infeasible individual constraints. A solution is defined as the limit of a sequence of generalized Nash equilibria induced by games with penalty terms relaxing the individual constraints. Existence is established for a broad range of games and we provide conditions allowing to characterize a $ψ$-penalized solution as a strategy profile maximizing every player's utility over all her penalty minimizing strategies. A variation of Divide-the-Dollar serves as an illustrative example. We further establish the compatibility with the GNE and the solution to the Nash bargaining.

cs.GT

Subgame-Perfect Nash Equilibria of Plurality Voting with Abstention: a PSPACE-Completeness Result for Restricted Ballots

We consider sequential Plurality elections in which each voter may abstain or vote for a single candidate. Each voter assigns utilities to all candidates; for each voter, this induces a (weak) order over the candidates. Ties are resolved uniformly at random, and voting has a small positive cost, so that a voter prefers to abstain when their vote cannot change the election outcome. We consider a variant of this model where, for each voter, we additionally specify a prefix of her ranking, so that she is only allowed to vote for a candidate from that prefix (or abstain). We prove that for this variant of the model, deciding whether a designated candidate is among the election winners in a subgame-perfect equilibrium of the associated extensive-form game is PSPACE-complete. This partially resolves an open problem from the work of Desmedt and Elkind [2010].

cs.GT