Paths to Equilibrium in Games

Authors: bora  yongacoglu
gürdal  arslan
lacra  pavel
serdar  yüksel
Venue: NeurIPS_cc_2024_Conference
Published: 2024-05-15 20:56:17

Abstract: In multi-agent reinforcement learning (MARL) and game theory, agents repeatedly interact and revise their strategies as new data arrives, producing a sequence of strategy profiles. This paper studies sequences of strategies satisfying a pairwise constraint inspired by policy updating in reinforcement learning, where an agent who is best responding in one period does not switch its strategy in the next period. This constraint merely requires that optimizing agents do not switch strategies, but does not constrain the non-optimizing agents in any way, and thus allows for exploration. Sequences with this property are called satisficing paths, and arise naturally in many MARL algorithms.  A fundamental question about strategic dynamics is such: for a given game and initial strategy profile, is it always possible to construct a satisficing path that terminates at an equilibrium? The resolution of this question has implications about the capabilities or limitations of a class of MARL algorithms. We answer this question in the affirmative for normal-form games. Our analysis reveals a counterintuitive insight that suboptimal, and perhaps even reward deteriorating, strategic updates are key to driving play to equilibrium along a satisficing path.

Main paper: 
 introduction: 
 Game theory is a mathematical framework for studying strategic interaction between self-interested agents, called players. In an n-player normal-form game, each player i = 1, • • • , n, selects a strategy x i ∈ X i and receives a reward R i (x 1 , . . . , x n ), which depends on the collective strategy profile x = (x 1 , . . . , x n ) =: (x i , x -i ). Player i's optimization problem is to best respond to the strategy x -i of its counterparts, choosing x i ∈ X i to maximize R i (x i , x -i ). Game theoretic models are pervasive in machine learning, appearing in fields such as multi-agent systems [21] , multi-objective reinforcement learning [24] , and adversarial model training [7] , among many others.In multi-agent reinforcement learning (MARL), players use learning algorithms to revise their strategies in response to the observed history of play, producing a sequence { x t } t≥1 in the set of strategy profiles X := X 1 × • • • × X n . Due to the coupled reward structure of multi-agent systems, each player's learning problem involves a moving target: since an individual's reward function depends on the strategies of the others, strategy revision by one agent prompts other agents to revise their own strategies. Convergence analysis of MARL algorithms can therefore be difficult, and the development of tools for such analysis is an important aspect of multi-agent learning theory. A strategy profile (x i * ) n i=1 is called a Nash equilibrium if all players simultaneously best respond to one another. Nash equilibrium is a concept of central importance in game theory, and the tasks of computing, approximating, and learning Nash equilibrium have attracted enduring attention in theoretical machine learning [47, 27, 14, 42, 17, 26, 31] . Convergence to equilibrium strategies has long been a predominant, but not unique, design goal in MARL [53] . In this paper, we study mathematical structure of normal-form games with the twin objectives of (i) better understanding the capabilities or limitations of existing MARL algorithms and (ii) producing insights for the design of new MARL algorithms.A number of MARL algorithms approximate dynamical systems {x t } t≥1 on the set of strategy profiles X in which the next strategy for player i is selected as x i t+1 = f i (x t ), where x t = (x 1 t , . . . , x n t ) is the strategy profile in period t. A sampling of such algorithms will be offered shortly. This approach facilitates analysis of the algorithm, as one separately considers the convergence of {x t } t≥1 induced by the update functions {f i } n i=1 , on one hand, and the approximation of {x t } t≥1 by the algorithm's iterates { x t } t≥1 on the other. In this work, we consider update functions that satisfy a quasi-rationality condition called satisficing: when an agent is best responding, the update rule instructs the agent to continue using this strategy. That is, if x i is a best response to x -i , then f i (x i , x -i ) = x i . This quasi-rationality constraint generalizes the best response update and is desirable for stability of the resulting dynamics, as it guarantees that Nash equilibria are invariant under the dynamics. Moreover, the satisficing condition is only quasi-rational, in that it imposes no constraint on strategy updates when an agent is not best responding, and so allows for exploratory strategy updates. Update rules that incorporate exploratory random search when a strategy is deemed unsatisfactory are common in MARL theory [6, 32, 11, 34] .Our goal is to better understand the capabilities/limitations of MARL algorithms that use the satisficing principle to select successive strategies, potentially augmented with random exploration when an agent is not best responding. Examples include [19, 20, 33, 12, 10, 1] and [52] . Instead of studying a particular collection of strategy update functions, we abstract the problem to the level of sequences in X, which allows us to implicitly account for experimental strategy updates. A sequence (x t ) t≥1 of strategy profiles is called a satisficing path if, for each player i and time t, one has that x i t+1 = x i t whenever x i t is a best response to x -i t . The central research question of this paper is such:For a normal-form game Γ and an initial strategy profile x 1 , is it always possible to construct a satisficing path from x 1 to a Nash equilibrium of the game Γ?Since many MARL algorithms operate using the satisficing principle (or otherwise approximate processes that involve satisficing update rules, e.g. [48] ), the resolution of this question has implications for the effectiveness of such MARL algorithms. Indeed, the question has been answered in the affirmative for two-player normal-form games by [19] and for n-player symmetric Markov games by [52] , and in both classes of games this has directly lead to MARL algorithms with convergence guarantees for approximating equilibria. In addition to removing a theoretical obstacle, positive resolution of this question would establish that uncoordinated, distributed random search can effectively assist Nash-seeking algorithms to achieve last-iterate convergence guarantees in a more general class of games than previously possible.Contributions. We give a positive answer to the question above: for any finite n-player game Γ and any initial strategy profile x 1 , there exists a satisficing path beginning at x 1 and ending at a Nash equilibrium of Γ. This partially answers an open question posed by [52] . We prove this result by analytically constructing a satisficing path from an arbitrary initial strategy profile to a Nash equilibrium. Our approach is somewhat counterintuitive, in that it does not attempt to seek Nash equilibrium by improving the performance of unsatisfied players (players who are not best responding at a given strategy profile), but by updating strategies in a way that increases the number of unsatisfied players at each round. This tactic leverages the freedom afforded to unsatisfied players to explore their strategy space and avoids the challenge of cyclical strategy revision that occurs when agents attempt to best respond to their counterparts [37] . This insight provides a new approach to MARL algorithm design beyond the well-structured settings considered in prior work.Notation. We let ∆ A denote the set of probability measures over a set A. For n ∈ N, we let[n] := {1, 2, . . . , n}. For a point x, the Dirac measure centered at x is denoted δ x . When discussing a fixed agent i, the remaining collection of agents are called i's counterparts or counterplayers.A vast number of MARL algorithms have been proposed for iterative strategy adjustment while playing a game. The most widely studied class of algorithms of this type involve each player running a no-regret algorithm on its own stream of rewards. The celebrated fictitious play algorithm [9] and its descendants are special cases of this class. Although the convergence behavior of fictitious play and its variants has been studied extensively, convergence results are typically available only for games exhibiting special structural properties amenable to analysis [25, 29, 4, 45, 46] . Indeed, the convergence properties of fictitious play are intimately connected to those of best response dynamics, a full information dynamical system evolving in continuous time where the evolution rule for player i's strategy is governed by its best response multi-function. By harnessing such connections, convergence results for fictitious play and a number of other MARL algorithms have been obtained by analyzing the dynamical systems induced by specific update rules [5, 28, 49] .A related line of research considers strategic dynamics defined by strategy update functions, taking the form x i t+1 = f i (x t ) in discrete time or an analogous form in continuous time. In the case of deterministic strategy updates, [22] studied strategic dynamics in continuous time and showed that if the strategy update functions, analogous to f i above, satisfy regularity conditions as well as a desirable property called uncoupledness, by which f i cannot depend on the reward functions of i's counterplayers, then the resulting dynamics are not Nash convergent in general. These results were recently generalized by [38] . Additional possibility and impossibility results were presented by [2] , who studied strategic dynamics in a different setting, where players do not observe counterplayer strategies. Under stochastic strategic dynamics, a number of positive results were obtained by incorporating exogenous randomness into one's strategy update, along with finite recall of recent play [23, 19, 20] . In the regret testing algorithm of [19] , players revise their strategies according to whether or not their most recent strategy met a satisfaction criterion: if x i t performed within ϵ of the optimal performance against x -i t , player i continues using it and picks x i t+1 = x i t . Otherwise, player i experiments and selects x i t+1 according to a probability distribution over X i . Conditional strategy updates similar to this have appeared in several other works, such as [12, 10, 11] , and the regret testing algorithm has been extended in several ways [20, 1] .A game is said to have the satisficing paths property if every initial strategy profile is connected to some equilibrium by a satisficing path. As we discuss in the next section, satisficing paths can be interpreted as a natural generalization of best response paths. Consequently, the problem of identifying games that have the satisficing paths property is a theoretically relevant question analogous to characterizing potential games [41] or determining when a game has the fictitious play property [39, 40] . The concept of satisficing paths was first formalized in [52] in the context of multi-state Markov games, where it was shown that n-player symmetric Markov games have the satisficing paths property and this fact could be used to produce a convergent MARL algorithm. However, the core idea of satisficing paths appeared earlier, before this formalization: in the convergence analysis of the regret testing algorithm in [19] , it was shown that two-player normal-form games have the satisficing paths property, though this terminology was not used. These earlier works made no claims about the existence of paths in general-sum n-player games, which is the focus of this paper. 
normal-form games: 
 A finite, n-player normal-form game Γ is described by a list Γ = (n, A, r), where n is the number of players, A = A 1 × • • • × A n is a finite set of action profiles, and r = (r i ) i∈[n] is a collection of reward functions, where r i : A → R describes the reward of player i as a function of the action profile. The i th component of A is player i's action set A i . Description of play. Each player i ∈ [n] selects a probability vector x i ∈ ∆ A i and then selects its action a i according to a i ∼ x i . The vector x i is called player i's mixed strategy, and we denote player i's set of mixed strategies by X i := ∆ A i . Players are assumed to select their actions without observing one another's actions, and the collection of actions {a i : i ∈ [n]} is assumed to be mutually independent. The set of mixed strategy profiles is denoted X := X 1 × • • • X n . After the action profile a = (a 1 , . . . , a n ) is selected, each player i receives reward r i (a). Player i's performance criterion is its expected reward, defined for each strategy profile x ∈ X asR i (x i , x -i ) = E a∼x r i (a 1 , . . . , a n ) ,where E a∼x signifies that a j ∼ x j for each player j ∈ [n] and we have used the convention that x = (x i , x -i ) and x -i = (x 1 , . . . , x i-1 , x i+1 , . . . , x n ). Since player i's objective depends on the strategies of its counterplayers, the relevant optimality notion is that of (ϵ-) best responding. Definition 1. A mixed strategy x i * ∈ X i is called an ϵ-best response to the strategyx -i ∈ X -i if R i (x i * , x -i ) ≥ R i (x i , x -i ) -ϵ ∀x i ∈ X i .The standard solution concept for n-player normal form games is that of (ϵ-) Nash equilibrium, which entails a situation in which all players are simultaneously (ϵ-) best responding to one another.Definition 2. For ϵ ≥ 0, a strategy profile x * = (x i * , x i * ) ∈ X is called an ϵ-Nash equilibrium if, for every player i ∈ [n], x i * is an ϵ-best response to x -i * .Putting ϵ = 0 above, one recovers the classical definitions of best responding and Nash equilibrium.For any ϵ ≥ 0, the set of ϵ-best responses to a strategy x -i is denoted BR i ϵ (x -i ) ⊆ X i .We now present the concept of satisficing paths as generalized best response paths.Definition 3. A sequence of strategy profiles (x t ) t≥1 in X is called a best response path if, for every t ≥ 1 and every player i ∈ [n], we havex i t+1 = x i t , if x i t ∈ BR i 0 (x -i t ), some x i ⋆ ∈ BR i 0 (x -i t ), else.The preceding definition of best response paths can be relaxed in several ways, and such relaxations are often desirable to avoid non-convergent cycling behavior (see [37] for an example). A common relaxation involves synchronizing players or incorporating inertia, so that only a subset of players switch their strategies at a given time, which can be help achieve coordination in cooperative settings [32, 48, 51] . Beyond cooperative settings, the use of best response dynamics to seek Nash equilibrium may not be justified. In purely adversarial settings, for instance, best response paths cycle and fail to converge [3] , and some alternative strategic dynamics are needed to drive play to equilibrium. Consider the following generalization of the best response update:x i t+1 = x i t , if x i t ∈ BR i 0 (x -i t ), f i (x i t , x -i t ) else.The update defined above is characterized by a "win-stay, lose-shift" principle [11, 44] , which only constrains the player to continue using a strategy when it is optimal. On the other hand, the player is not forced to use a best response when x i t / ∈ BR i 0 (x -i t ), and may experiment with suboptimal responses according to a function f i : X → X i . 1 Allowing the function f i to be any function from X to X i , one generalizes best response updates and obtains a much larger set of sequences (x t ) t≥1 and greater flexibility to approach equilibrium from new directions. This motivates the following definition of satisficing paths. Definition 4. A sequence of strategy profiles (x t ) T t=1 , where T ∈ N ∪ {∞}, is called a satisficing path if it satisfies the following pairwise satisfaction constraint for any player i ∈ [n] and any t:EQUATIONThe intuition behind satisficing paths is that they are the result of an iterative search process in which players settle upon finding an optimal strategy (i.e. a best response to the strategies of counterplayers) but are free to explore different strategies when they are not already behaving optimally. Note, however, that the definition above is merely a formal property of sequences of strategy profiles in X and is agnostic to how a satisficing path is produced. The latter point will be important in the coming sections, where we analytically obtain a particular satisficing path as part of an existence proof.We note that Condition (1) constrains only optimizing players. It does not mandate a particular update for the so-called unsatisfied player i, for whom x i t / ∈ BR i 0 (x -i t ). In particular, x i t+1 can be any strategy without restriction, and x i t+1 / ∈ BR i 0 (x -i t ) is allowed. In addition to best response paths, constant sequences (x t ) t≥1 with x t ≡ x are always satisficing paths, even when x is not a Nash equilibrium. Moreover, since arbitrary strategy revisions are allowed when a player is unsatisfied, if x 1 ∈ X is a strategy profile for which all players are unsatisfied, then (x 1 , x 2 ) is a satisficing path for any x 2 ∈ X. Definition 5. The game Γ has the satisficing paths property if for any x 1 ∈ X, there exists a satisficing path (x 1 , x 2 , . . . ) such that, for some finite T = T (x 1 ), the strategy profile x T is a Nash equilibrium. 2Satisficing paths were initially formalized in [52] , where it was proved that two-player games and nplayer symmetric games have the satisficing paths property. However, whether general-sum n-player games have the satisficing paths property was left as an open question. We answer this open question in Theorem 1, presented in the next section.3 Existence of paths in normal-form games Theorem 1. Any finite normal-form game Γ has the satisficing paths property.Proof sketch. Before presenting the formal proof, we describe the intuition of its main argument. In the proof of Theorem 1, we construct a satisficing path from an arbitrary initial strategy x 1 to a Nash equilibrium by repeatedly switching the strategies of unsatisfied players in a way that grows the set of unsatisfied players after the update. Once the set of unsatisfied players is maximal, we argue that a Nash equilibrium can be reached in one step by switching the strategies of the unsatisfied players. The final point represents the main technical challenge in the proof, as switching the strategies of unsatisfied players changes the objective functions for the previously satisfied players. We address this challenge by showing the existence of a Nash equilibrium on the boundary of a strategy subset in which previously satisfied players remain satisfied.To give the complete proof, we will require some additional notation, detailed below, and some supporting results, detailed in Appendix A and Appendix B.Additional notation. We require notation for the following sets, defined for any x ∈ X:Sat(x) := i ∈ [n] : x i ∈ BR i 0 (x -i ) , and UnSat(x) := [n] \ Sat(x).A player in Sat(x) ⊆ [n] is called satisfied (at x), and a player in UnSat(x) is called unsatisfied (at x). For x ∈ X, we also define Access(x) := y ∈ X :y i = x i , ∀i ∈ Sat(x) .Access(x) is the subset of strategies that are accessible from strategy x, to mean one can obtain strategy y ∈ Access(x) ⊆ X from x by switching (at most) the strategies of players who were unsatisfied at x. We define a subset NoBetter(x) ⊆ Access(x) asNoBetter(x) := {y ∈ Access(x) : UnSat(x) ⊆ UnSat(y)} = {y ∈ Access(x)|∀i ∈ UnSat(x), i ∈ UnSat(y)} ,The set NoBetter(x) consists of strategies y that are accessible from x and also fail to improve the status of players who were previously unsatisfied. The set name NoBetter(x) is chosen to suggest that the players unsatisfied at x are not better off at y ∈ NoBetter(x), since they are unsatisfied at both x and y. We observe x ∈ NoBetter(x), hence NoBetter(x) is non-empty.Finally, we define a set Worse(x) ⊆ NoBetter(x) asWorse(x) := {y ∈ NoBetter(x) : UnSat(x) ⊊ UnSat(y)} = {y ∈ NoBetter(x)|∃i ∈ Sat(x) : i ∈ UnSat(y)}.The set Worse(x) consists of strategies that are accessible from x, that leave all previously unsatisfied players unsatisfied, and flip at least one previously satisfied player to being unsatisfied. In particular, if y ∈ Worse(x), this means |UnSat(y)| ≥ |UnSat(x)| + 1. We observe that Worse(x) may be empty, and Worse(x) ⊆ NoBetter(x) ⊆ Access(x).Question: Does the paper discuss the limitations of the work performed by the authors? Answer: [Yes] Justification: We identify practical limits of the applicability of the theory contained in this paper, and we compare it to existing impossibility results which were already previously known. In the discussion section, we compare and contrast our result with other results on limitations of multi-agent learning. Guidelines:• The answer NA means that the paper has no limitation while the answer No means that the paper has limitations, but those are not discussed in the paper. • The authors are encouraged to create a separate "Limitations" section in their paper.• The paper should point out any strong assumptions and how robust the results are to violations of these assumptions (e.g., independence assumptions, noiseless settings, model well-specification, asymptotic approximations only holding locally). The authors should reflect on how these assumptions might be violated in practice and what the implications would be. • The authors should reflect on the scope of the claims made, e.g., if the approach was only tested on a few datasets or with a few runs. In general, empirical results often depend on implicit assumptions, which should be articulated. • The authors should reflect on the factors that influence the performance of the approach.For example, a facial recognition algorithm may perform poorly when image resolution is low or images are taken in low lighting. Or a speech-to-text system might not be used reliably to provide closed captions for online lectures because it fails to handle technical jargon. • The authors should discuss the computational efficiency of the proposed algorithms and how they scale with dataset size. • If applicable, the authors should discuss possible limitations of their approach to address problems of privacy and fairness. • While the authors might fear that complete honesty about limitations might be used by reviewers as grounds for rejection, a worse outcome might be that reviewers discover limitations that aren't acknowledged in the paper. The authors should use their best judgment and recognize that individual actions in favor of transparency play an important role in developing norms that preserve the integrity of the community. Reviewers will be specifically instructed to not penalize honesty concerning limitations. 
proof of theorem 1: 
 Remark 1. In the proof below, we analytically construct a path from x 1 to a Nash equilibrium. The process of selecting strategies x 1 , x 2 , • • • and switching the component strategy of each player is done centrally, by the analyst, and should not be interpreted as a learning algorithm.Proof. Let x 1 ∈ X be any initial strategy profile. We must produce a satisficing path of finite length terminating at a Nash equilibrium. Equivalently, we must produce a sequence x 1 , . . . , x T with x t+1 ∈ Access(x t ) for each t and x T a Nash equilibrium, where the length T may depend on x 1 . In the trivial case that x 1 is a Nash equilibrium, we put T = 1. The remainder of this proof focuses on the non-trivial case, where x 1 is not a Nash equilibrium.To begin, we produce a satisficing path x 1 , . . . , x k as follows. We put t = 1, and while both Sat(x t ) ̸ = ∅ and Worse(x t ) ̸ = ∅, we arbitrarily fix x t+1 ∈ Worse(x t ) and increment t ← t + 1.By construction, we have∅ ̸ = UnSat(x 1 ) ⊊ • • • ⊊ UnSat(x t ) ⊊ UnSat(x t+1 )for each non-terminal iteration t, where the inequality holds because x 1 is not a Nash equilibrium. Thus, the number of unsatisfied players is strictly increasing along this satisficing path. Since the number of unsatisfied players is bounded above by n, and since we have assumed |UnSat(x 1 )| ≥ 1, this process terminates in at most n -1 steps. Letting k denote the terminal index of this process, we have k ≤ n -1.By the construction of the path (x 1 , . . . , x k ), (at least) one of the following holds at index k: eitherSat(x k ) = ∅ or Worse(x k ) = ∅.In other words, either no player is satisfied at x k , or there is no accessible strategy that grows the subset of unsatisfied players.Case 1: Sat(x k ) = ∅, and all players are unsatisfied at x k . In this case, we may switch the strategy of each player i ∈ [n] to any successor strategy. That is, Access(x k ) = X. We fix an arbitrary Nash equilibrium z ⋆ , put x k+1 = z ⋆ , and let T = k + 1. Then, (x 1 , . . . , x T ) is a satisficing path terminating at equilibrium.Case 2: Sat(x k ) ̸ = ∅ and Worse(x k ) = ∅. In this case, there are no accessible strategies that strictly grow the set of unsatisfied players.Since Worse(x k ) = ∅, the following holds: for any strategy y ∈ NoBetter(x k ) and any satisfied player i ∈ Sat(x k ), we have that i ∈ Sat(y). (Otherwise, if i ∈ UnSat(y), then y ∈ Worse(x k ), since it flipped a satisfied player. But this contradicts the emptiness of Worse(x k ).)We now argue that there exists a strategy profile x ⋆ accessible from x k such that all players unsatisfied at x k are satisfied at x ⋆ . That is, there exists an accessible strategy x ⋆ ∈ Access(x k ) such thatEQUATIONTo see that such a strategy x ⋆ exists, note that fixing the strategies of the m players satisfied at x k defines a new game, say Γ, with n -m players, and the new game Γ admits a Nash equilibrium x⋆ = (x i ⋆ ) i∈UnSat(x k ) . We extend x⋆ to be a strategy profile in the larger game Γ by puttingx i ⋆ = x i k for players i ∈ Sat(x k ) while putting x j ⋆ = xj ⋆ for players j ∈ UnSat(x k ). By construction, we have that x j ⋆ ∈ BR j 0 (x -j ⋆ ) for each j ∈ UnSat(x k ), so (2) holds. From (2), it is clear that x ⋆ / ∈ NoBetter(x k ), since NoBetter(x k) consists of strategies accessible from x k in which unsatisfied agents remain unsatisfied, while the previously unsatisfied agents are satisfied at x ⋆ . We now state a key technical lemma, which asserts that although x ⋆ does not belong to NoBetter(x k ), it is a limit point of this set. A proof of Lemma 1 given in Appendix B.Lemma 1. If Worse(x k ) = ∅, then there exists a sequence {y t } ∞ t=1 , with y t ∈ NoBetter(x k ) for each t, such that lim t→∞ y t = x ⋆ .We will argue that x ⋆ is a Nash equilibrium for the original game Γ. For each player i ∈ [n], we introduce a functionF i : X → R given by F i (x i , x -i ) = max a i ∈A i R i (δ a i , x -i ) -R i (x i , x -i ), for each x = (x i , x -i ) ∈ X. The functions {F i } ni=1 have the following useful properties, which are well known [35] , and are summarized in Appendix A. For each player i ∈[n]: (a) F i is continuous on X; (b) F i (x) ≥ 0 for all x ∈ X; (c) for any x -i ∈ X -i , a strategy x i is a best response to x -i if and only if F i (x i , x -i ) = 0. Let (y t ) ∞t=1 be a sequence in NoBetter(x k ) converging to x ⋆ , which exists by Lemma 1. For any previously satisfied player i ∈ Sat(x k ), since Worse(x k ) = ∅ and y t ∈ NoBetter(x k ), from a previous observation, we have that i ∈ Sat(y t ). Equivalently, x i k ∈ BR i 0 (y -i t ). Re-writing this using the function F i and the notation y i t = x i k for satisfied players i ∈ Sat(x k ), we have F i (y i t , y -i t ) = 0 for all t ∈ N and for any i ∈ Sat(x k ). By continuity of F i , we have0 = lim t→∞ F i (y t ) = F i lim t→∞ y t = F i (x ⋆ ),establishing that player i is satisfied at x ⋆ , and thus that Sat(x k ) ⊂ Sat(x ⋆ ). Then, by (2), we hadUnSat(x k ) ⊂ Sat(x ⋆ ), hence Sat(x ⋆ ) = [n], and x ⋆ is a Nash equilibrium accessible from x k . We put T = k + 1 and x T = x ⋆ , which completes the proof, since (x 1 , . . . , x T ) is a satisficing path terminating at a Nash equilibrium.When coupled with a MARL algorithm that uses an exploratory satisficing strategy update, play will be driven along satisficing paths. Theorem 1 shows that for any starting strategy profile, some such path connects the strategy profile to an equilibrium, and so a sufficiently exploratory strategy update may drive play to equilibrium along a satisficing path. This offers important insights for the design of MARL algorithms. The first takeaway from Theorem 1 is that play can be driven to equilibrium by changing only the strategies of those players who are not best responding. In particular, this means that a satisfied agent does not need to continue updating its strategy after it becomes satisfied. As we will discuss in the next section, this property is helpful in distributed and decentralized multi-agent systems, where agents are able to assess whether they are satisfied but may not be able to assess whether the overall system is at equilibrium. A second, more subtle takeaway comes from the proof of Theorem 1 and relates to the unorthodox and counterintuitive exploration scheme used to drive play to equilibrium. In the proof, one sees that suboptimal-and perhaps even reward-deteriorating-strategic updates were key to driving play to equilibrium along a satisficing path. As we outline below, this construction runs against the conventional approaches to designing MARL algorithms, and it can be used to avoid common pitfalls of MARL algorithms such as cyclical behavior.At a high level, many existing multi-agent learning algorithms update the strategy parameter in a reward-improving direction at each step. A related approach, described earlier, increments the strategy parameter in a regret-minimizing direction, which has a similar effect. While such algorithms are sensible from the point of view of a single self-interested individual, they may fail to drive play to a Nash equilibrium when all players adopt similar algorithms [36, 18, 37] . To address this non-convergence issue, one recurring algorithmic modification involves manipulating step sizes, either with a mixture of fast agents and slow agents [13] or with each individual varying its step sizes according to its performance [8] . However, such approaches only come with provable convergence guarantees in select subclasses of games with exploitable structure. In instances where step size manipulation does not (or cannot) yield convergence, the analysis of Theorem 1 may offer an alternative route to algorithm modification.With these two takeaways in mind, we envision at least two design principles that will be useful for future MARL algorithms. First, strategic updating may incorporate some measure of randomness when a player is not satisfied. This principle has been previously used with some success, but comes with a drawback relating to complexity. A second principle, which we believe to be new, leverages the second takeaway above, involving counterintuitive path construction: players may alternate between reward-improving periods (during which strategy updates are done in a conventional way that improves the agent's reward) and suboptimal periods (during which reward-deteriorating and/or random strategy updates may be used). The timing of such periods or the extent of the randomness in strategic updates may be made to depend on whether cycles in the strategy iterates were detected. By incorporating suboptimal exploration in an adaptive manner, a MARL algorithm can break cycles as needed but rely on conventional algorithms the remainder of the time.This paper focused on normal-form games with finitely many actions per player due to the central position that normal-form games occupy in game theory. Indeed, insights and intuition developed in normal-form games are helpful for understanding more complex models of strategic interaction. Of special note, finite normal-form games can be generalized to model dynamic strategic environments where rewards and environmental parameters evolve over time according to the history of play. We now describe the extension of Theorem 1 to Markov games, one generalization of finite normal-form games that is a popular model in MARL. Due to space limitations, a formal model for Markov games is postponed to Appendix C.In an n-player Markov game, agents interact across discrete time. Each agent i ∈ [n] observes a sequence of state variables {s t } t≥1 taking values in a finite state space S and selects a sequence of actions {a i t } t≥1 taking values in a finite action set A i . In this dynamic model, player i's reward in period t, denoted r i t = r i (s t , a t ), depends on both the action profile a t and also on the state s t . The state process evolves according to a (jointly controlled) transition probability function T as s t+1 ∼ T (•|s t , a t ). Rewards are discounted across time using a discount factor γ ∈ (0, 1), and player i attempts to maximize its expected γ-discounted return. In this generalization of finite normal-form games, policies (defined as mappings from states to probability distributions over actions) generalize mixed strategies, and the solution concept of Markov perfect equilibrium refines the concept of Nash equilibrium and serves as a popular stability objective for MARL algorithm designers [53] .Partial results for multi-state Markov games have previously been obtained in special classes of games and used to produce MARL algorithms [52] . The analysis presented in this paper uses a rather different approach that seems promising for extending those results. In the proof of Theorem 1, we used functions {F i } n i=1 to characterize best responding in a finite normal-form game. In fact, analogous functions can also be obtained for policies in multi-state Markov games, and these functions satisfy the same desired properties invoked in the proof of Theorem 1 (c.f. [52, Lemmas 2.10-2.13]). For this reason, and due to the central role of continuity in our proof, it seems likely that Theorem 1 can be extended to general-sum Markov games. However, one aspect of the extension remains open, namely the generalization of Lemma 1. In Appendix C, we describe the issue that precludes direct generalization of our normal-form proof of Lemma 1, but we note that this appears to be related only to the proof technique rather than a fundamental obstacle to the generalization.Multi-agent reinforcement learning algorithms based on the "win-stay, lose-shift" principle characteristic of satisficing paths are especially well suited to decentralized applications, since players are often able to estimate the performance of their current strategy as well as the performance of an optimal strategy, even under partial information. In decentralized problems, coordinated search of the set X of strategy profiles for a Nash equilibrium is typically infeasible, and players must select successor strategies in a way the depends only on quantities that can be locally accessed or estimated.For instance, consider a trivial coordinated search method, where player i selects x i t+1 uniformly at random from X i whenever x t was not a Nash equilibrium and selects x i t+1 = x i t only when x t is a Nash equilibrium. This process is clearly ill suited to decentralized applications, because player i's strategy update depends on both a locally estimable condition (whether player i is best responding to x -i t ) as well as a condition that cannot be locally estimated (whether another player j ̸ = i is best responding to x -j t .) The satisfaction (win-stay) constraint plays a key role as a local stopping condition for satisficing paths, and rules out coordinated search of the set X such as the trivial update outlined above. Examples of decentralized or partially decentralized learning algorithms leveraging satisficing paths in their analysis include [19, 33, 1, 52] . The analytic results of this paper suggest that algorithms such as these can be extended to wider classes of games and enjoy equilibrium guarantees under different informational constraints on the players.In Theorem 1, we showed that for any finite n-player normal-form game Γ and any initial strategy profile x 1 ∈ X, there exists a satisficing path x 1 , . . . , x T of finite length T = T (x 1 ) terminating at a Nash equilibrium x T . From the proof of Theorem 1, one makes the following observations. First, the length of such a path can be uniformly bounded above as T (x 1 ) ≤ n. Second, there exists a collection of strategy update functions f i Γ : X → X i i ∈ [n] whose joint orbit is the satisficing path described by the proof of Theorem 1. That is, f i Γ (x t ) = x i t+1 for each player i ∈ [n], every 0 ≤ t ≤ T -1, and every x 1 ∈ X, where x i t is player i's component of x t in the satisficing path initialized at x 1 .The proof of Theorem 1 is semi-constructive. At each step along the path, we describe how the next strategy profile should be picked (e.g. x t+1 ∈ Worse(x t )), but we do not suggest an algorithm for computing it. In at least one place, namely Case 1 where we put x T := z ⋆ , the path construction involves moving jointly to a Nash equilibrium in one step. The computational complexity of such a step is prohibitive [15] , underscoring that ours is an analytical existence result rather than a computational prescription.Although we have shown that there exists a discrete-time dynamical system on X that converges to Nash equilibrium in n steps and can be characterized by update functions {f i Γ } n i=1 , we note that our possibility result does not contradict the impossibility results of [22, 2] or [38] . In particular, the functions {f i Γ } n i=1 need not be (and usually will not be) continuous, violating the regularity conditions of [22] and [38] , and furthermore the functions {f i Γ } n i=1 depend crucially on the game Γ in a way that violates the uncoupledness conditions of [22] and [2] .Several interesting questions about satisficing paths remain open. We now briefly describe some that we find especially practical or theoretically relevant.While this paper dealt with satisficing paths defined using a best responding constraint, the original definition was stated using an ϵ-best responding constraint, according to which a player who was ϵ-best responding was not allowed to switch its strategy. Putting ϵ = 0, one recovers the definition used here, but one may also select ϵ > 0, which can be desirable to accommodate for estimation error in multi-agent reinforcement learning applications. The added constraint reduces freedom to switch strategies, and thus makes it more challenging to construct paths starting from a given strategy profile. On the other hand, the collection of Nash equilibria is a strict subset of the set of ϵ-Nash equilibria, and one can attempt to guide the process to a different terminal point in a larger set. At this time, it is not clear to us whether the main result of this paper holds for small ϵ > 0. It is clear, however, that the proof technique used here will have to be modified, since we have relied on Lemma 1, whose proof involved an indifference condition and invoked the fundamental theorem of algebra, and relaxing to ϵ > 0 would render such an argument ineffective.A second interesting question for future work is whether multi-state Markov games with n > 2 players have the satisficing paths property. The case with n = 2 was resolved by [52] , but the proof technique used there did not generalize to n ≥ 3. By contrast, our proof technique readily accommodates any number of players, but is designed for stateless normal-form games. Our proof used multi-linearity of the expected reward functions {R i } n i=1 , which does not generally hold in the multi-state setting.In this work, satisficing paths were defined in a way that allowed an unsatisfied player i to change its strategy to any strategy in its set X i , without constraint. This is interesting in many problems where the set of strategies can be explicitly and directly parameterized, but may be unrealistic in games where the set of strategies is poorly understood or in which a player can effectively represent only a subset of its strategies Y i ⊊ X i . In such games, the question more relevant for algorithm design is whether the game admits satisficing paths to equilibrium within the restricted subsetY 1 × • • • × Y n .This point was implicitly appreciated by both [19] and [20] and explicitly noted in [52] . Some negative results were recently established in [50] for games admitting pure strategy Nash equilibrium when randomized action selection was not allowed and the constrained set was given by Y i = A i , underscoring the importance of the topology of the sets appearing in the proof of Theorem 1.• The method for calculating the error bars should be explained (closed form formula, call to a library function, bootstrap, etc.) • The assumptions made should be given (e.g., Normally distributed errors). • It should be clear whether the error bar is the standard deviation or the standard error of the mean. Guidelines:• The answer NA means that the authors have not reviewed the NeurIPS Code of Ethics.• If the authors answer No, they should explain the special circumstances that require a deviation from the Code of Ethics. • The authors should make sure to preserve anonymity (e.g., if there is a special consideration due to laws or regulations in their jurisdiction). 
conclusion: 
 Satisficing paths can be interpreted as a natural generalization of best response paths in which players may experimentally select their next strategy in periods when they fail to best respond to their counterplayers. While (inertial) best response dynamics drive play to equilibrium in certain wellstructured classes of games, such as potential games and weakly acyclic games [16] , the constraint of best responding limits the efficacy of these dynamics in games with cycles in the best response graph [43] . In such games, best response paths leading to equilibrium do not exist, and multi-agent reinforcement learning algorithms designed to produce such paths will not lead to equilibrium.In this paper, we have shown that every finite normal-form game enjoys the satisficing paths property. By relaxing the best response constraint for unsatisfied players, one ensures that paths to equilibrium exist from any initial strategy profile. Multi-agent reinforcement learning algorithms designed to produce satisficing paths, rather than best response paths, thus do not face the same fundamental obstacle of algorithms based on best responding. While algorithms based on satisficing have previously been developed for two-player games normal-form games, symmetric Markov games, and several other subclasses of games, the findings of this paper suggest that similar algorithms can be devised for the wider class of n-player general-sum normal-form games. 
broader impacts: 
 Question: Does the paper discuss both potential positive societal impacts and negative societal impacts of the work performed?Answer: [NA]Justification: In the discussion section of our work, we describe the broader impact of our work in the context of machine learning algorithm design. However, since our work is theoretical in nature and does not provide an algorithm itself, its broader societal impact cannot be assessed at this time.Guidelines:• The answer NA means that there is no societal impact of the work performed.• If the authors answer NA or No, they should explain why their work has no societal impact or why the paper does not address societal impact. • Examples of negative societal impacts include potential malicious or unintended uses (e.g., disinformation, generating fake profiles, surveillance), fairness considerations (e.g., deployment of technologies that could make decisions that unfairly impact specific groups), privacy considerations, and security considerations. • The conference expects that many papers will be foundational research and not tied to particular applications, let alone deployments. However, if there is a direct path to any negative applications, the authors should point it out. For example, it is legitimate to point out that an improvement in the quality of generative models could be used to generate deepfakes for disinformation. On the other hand, it is not needed to point out that a generic algorithm for optimizing neural networks could enable people to train models that generate Deepfakes faster. • The authors should consider possible harms that could arise when the technology is being used as intended and functioning correctly, harms that could arise when the technology is being used as intended but gives incorrect results, and harms following from (intentional or unintentional) misuse of the technology. • If there are negative societal impacts, the authors could also discuss possible mitigation strategies (e.g., gated release of models, providing defenses in addition to attacks, mechanisms for monitoring misuse, mechanisms to monitor how a system learns from feedback over time, improving the efficiency and accessibility of ML). 
safeguards: 
 Question: Does the paper describe safeguards that have been put in place for responsible release of data or models that have a high risk for misuse (e.g., pretrained language models, image generators, or scraped datasets)?Answer: [NA] Justification: The work presented in this paper does not pose such risks.Guidelines:• The answer NA means that the paper poses no such risks.• Released models that have a high risk for misuse or dual-use should be released with necessary safeguards to allow for controlled use of the model, for example by requiring that users adhere to usage guidelines or restrictions to access the model or implementing safety filters. • Datasets that have been scraped from the Internet could pose safety risks. The authors should describe how they avoided releasing unsafe images. • We recognize that providing effective safeguards is challenging, and many papers do not require this, but we encourage authors to take this into account and make a best faith effort.12. Licenses for existing assets Question: Are the creators or original owners of assets (e.g., code, data, models), used in the paper, properly credited and are the license and terms of use explicitly mentioned and properly respected?Answer: [NA]Justification: The paper does not use existing assets.Guidelines:• The answer NA means that the paper does not use existing assets.• The authors should cite the original paper that produced the code package or dataset.• The authors should state which version of the asset is used and, if possible, include a URL. • The name of the license (e.g., CC-BY 4.0) should be included for each asset.• For scraped data from a particular source (e.g., website), the copyright and terms of service of that source should be provided.• If assets are released, the license, copyright information, and terms of use in the package should be provided. For popular datasets, paperswithcode.com/datasets has curated licenses for some datasets. Their licensing guide can help determine the license of a dataset. • For existing datasets that are re-packaged, both the original license and the license of the derived asset (if it has changed) should be provided. • If this information is not available online, the authors are encouraged to reach out to the asset's creators. 
new assets: 
 Question: Are new assets introduced in the paper well documented and is the documentation provided alongside the assets?Answer: [NA]Justification: The paper does not release new assets.Guidelines:• The answer NA means that the paper does not release new assets.• Researchers should communicate the details of the dataset/code/model as part of their submissions via structured templates. This includes details about training, license, limitations, etc. • The paper should discuss whether and how consent was obtained from people whose asset is used. • At submission time, remember to anonymize your assets (if applicable). You can either create an anonymized URL or include an anonymized zip file. 
crowdsourcing and research with human subjects: 
 Question: For crowdsourcing experiments and research with human subjects, does the paper include the full text of instructions given to participants and screenshots, if applicable, as well as details about compensation (if any)?Answer: [NA]Justification: The paper does not involve crowdsourcing nor research with human subjects.Guidelines:• The answer NA means that the paper does not involve crowdsourcing nor research with human subjects. • Including this information in the supplemental material is fine, but if the main contribution of the paper involves human subjects, then as much detail as possible should be included in the main paper. • According to the NeurIPS Code of Ethics, workers involved in data collection, curation, or other labor should be paid at least the minimum wage in the country of the data collector. 
institutional review board (irb) approvals or equivalent for research with human subjects: 
 Question: Does the paper describe potential risks incurred by study participants, whether such risks were disclosed to the subjects, and whether Institutional Review Board (IRB) approvals (or an equivalent approval/review based on the requirements of your country or institution) were obtained?Answer: [NA]Justification: The paper does not involve crowdsourcing nor research with human subjects.Guidelines:• The answer NA means that the paper does not involve crowdsourcing nor research with human subjects. • Depending on the country in which research is conducted, IRB approval (or equivalent) may be required for any human subjects research. If you obtained IRB approval, you should clearly state this in the paper.• We recognize that the procedures for this may vary significantly between institutions and locations, and we expect authors to adhere to the NeurIPS Code of Ethics and the guidelines for their institution. • For initial submissions, do not include any information that would break anonymity (if applicable), such as the institution conducting the review. 
 
 Appendix: We begin by discussing the properties of the auxiliary functions {F i : i ∈ [n]}, as they are relevant to characterizing best responses. The facts below are well known. For a reference, see the text of [35] .Recall that for each player i ∈ [n], the function F i : X → R is defined asF i (x i , x -i ) = max a i ∈A i R i (δ a i , x -i ) -R i (x i , x -i ), ∀x ∈ X.We now show that for any i ∈ [n], the following hold:a. F i is continuous on X, b. F i (x) ≥ 0 for all x ∈ X, and c. For any x -i ∈ X -i , a strategy x i is a best response to x -i if and only ifF i (x i , x -i ) = 0.The expected reward function R i (x) = E a∼x r i (a) can be expressed as a sum of products:R i (x) = ã∈A r i (ã)P a∼x (a = ã) = ã∈A r i (ã 1 , . . . , ãn ) n j=1x j (ã j ), ∀x ∈ X.From this form, it is immediate that R i is continuous on X. Moreover, it can easily be shown that R i is multi-linear in x. That is, for any j ∈ [n], fixing x -j , we have that x j → R i (x j , x -j ) is linear. 3Since R i is continuous on X and A i is a finite set, one has that the pointwise maximum of finitely many continuous functions is continuous. Thus, the functionx -i → max a i ∈A i R i δ a i , x -i is continuous on X -i . Since F i (x i , x -i ) = max a i ∈A i R i δ a i , x -i -R i (x i , x -i) is the difference of continuous functions, F i is also continuous. This proves item a.From the multi-linearity of R i , we have that, for fixed x -i ∈ X -i , the optimization problemsup x i ∈X i R i (x i , x -i ) is equivalent to a linear program sup x i ∈R A i w ⊤ x -i x i , subject to 1 ⊤ x i = 1, x i ≥ 0 , where w x -i ∈ R A i is a vector defined by w x -i (a i ) := R i (δ a i , x -i ).The vertices of the feasible set for the latter linear program are precisely the points {δ a i : a i ∈ A i }. This implies that max a i R i (δ a i , x -i ) ≥ R i (x i , x -i ) for any x i , x -i . Items b and c follow. From this formulation, one can also see that a player i ∈ [n] is satisfied at x ∈ X if and only if its strategy x i is supported on the set of maximizers argmax a i ∈A i {R i (δ a i , x -i )}.Recall that in the proof of Theorem 1, x ⋆ was defined to be some strategy accessible from x k ∈ X such that all players unsatisfied at x k were satisfied at x ⋆ . The statement of Lemma 1 was the following.Lemma 1 If Worse(x k ) = ∅, then there exists a sequence {y t } ∞ t=1 , with y t ∈ NoBetter(x k ) for each t, such that lim t→∞ y t = x ⋆ .Proof. Suppose, to the contrary, that no such sequence exists. Then, there exists some ζ > 0 such that for every z ∈ Access(x k ) ∩ N ζ (x ⋆ ), one has z / ∈ NoBetter(x k ). That is, some player unsatisfied atx k is satisfied at z. Equivalently, for some i ∈ UnSat(x k ), we have z i ∈ BR i 0 (z -i ). This implies that for that player i, that value of ζ, and the strategy profile(z i , z -i ) ∈ N ζ (x ⋆ ), z i is supported on the set argmax a i ∈A i {R i (δ a i , z -i )}.For each ξ ≥ 0, we define a strategy profile w ξ ∈ X as follows:w i ξ := (1 -ξ)x i k + ξUniform(A i ), if i ∈ UnSat(x k ) x i k , else.Note that we have defined w i ξ = x i k for i ∈ Sat(x k ), which is to say that we change only the strategies of the unsatisfied players, meaning w ξ ∈ Access(x k ). We will show that if ξ > 0 is sufficiently small, then continuity of the functions {F i } i∈ [n] guarantees that w ξ ∈ NoBetter(x k ).Indeed, player i ∈ [n] is unsatisfied at x k if and only if it fails to best respond, x i k / ∈ BR i 0 (x -i k ). Using the function F i , this is equivalent to F i (x i k , x -i k ) > 0. For each player i ∈ UnSat(x k ), let σ i > 0 be such that F i (x k ) ≥ σ i > 0. Define σ = min{σ i : i ∈ UnSat(x k )}.The following statement holds by the continuity of the functions {F i } n i=1 : for each player i ∈ [n], there exists e i > 0 such that if a strategy profile x belongs to the e i neighbourhood of x k (i.e.x ∈ N ei (x)), then |F i (x) -F i (x k )| < σ/2. Since F i (x k ) ≥ σ, it follows that F i (x) > σ/2 > 0,and player i is not best responding at x ∈ N ei (x).Let ē := min{e i : i ∈ [n]}. By taking ξ < ē/(2n), one has that w ξ ∈ N ē(x k ). From the preceding remarks, one can see that UnSat(x k ) ⊆ UnSat(w ξ ), since all players who were unsatisfied at x k remain unsatisfied at w ξ . Since w j ξ = x j k for any player j ∈ Sat(x k ), one also has that w ξ ∈ Access(x k ). These two parts combine to show that w ξ ∈ NoBetter(x k ).Fixing ξ > 0 at a sufficiently small value (ξ ∈ (0, ē/2n)), the preceding deductions show that w ξ ∈ NoBetter(x k ). By the earlier discussion, we have thatw ξ / ∈ N ζ (x ⋆ ).A very important aspect of this construction is that w i ξ (a i ) > 0 for each i ∈ UnSat(x k ) and action a i ∈ A i , so that w i ξ is fully mixed for each player who was unsatisfied at x k . Next, for each λ ∈ [0, 1] and player i ∈ UnSat(x k ), we definez i λ = (1 -λ)x i ⋆ + λw i ξ .We also define z i λ = x i k for players i ∈ Sat(x k ). For sufficiently small values of λ, say λ ≤ λ, we have thatz λ ∈ N ζ (x ⋆ ), which implies z λ / ∈ NoBetter(x k ).This implies that there exists a player i † ∈ UnSat(x k ) for whomz i † λ ∈ BR i † 0 z -i † λ, for infinitely many λ ∈ 0, λ .(The existence of such a player is perhaps not obvious. As we previously noted, for λ < λ, we have z λ / ∈ NoBetter(x k ), which means there exists some player i † (λ) that was unsatisfied at x k and is satisfied at z λ . The identity of this player may change with λ. To see that some particular individual must satisfy this best response condition infinitely often, one can apply the pigeonhole principle to the set { λ, λ/2, . . . , λ/m} for arbitrarily large m.) By our definition of z i † λ as a convex combination involving Uniform(A i † ), we have that z i † λ is fully mixed and puts positive probability on each action in A i † . Using the characterization involvingF i † , the fact that z i † λ ∈ BR i † 0 z -i † λand the fact that z i † λ is fully mixed together imply thatR i † (δ a , z -i † λ ) = R i † (δ a ′ , z -i † λ ), for any a, a ′ ∈ A i † .This can be equivalently re-written asEQUATIONfor any a, a ′ ∈ A i † .The lefthand side of the final equality ( 3) is a polynomial in λ of finite degree, but admits infinitely many solutions (from our choice of i † ). This implies that it is the zero polynomial. In turn, this implies that the left side of (3) holds for any λ ∈ [0, 1], and in particular for λ = 1. This meansz i † 1 ∈ BR i † 0 (z -i † 1 ), meaning z 1 / ∈ NoBetter(x k ).On the other hand, we have z 1 = w ξ ∈ NoBetter(x k ), a contradiction. Thus, we see that there exists a sequence {y t } ∞ t=1 , with y t ∈ NoBetter(x k ) for all t, such that lim t→∞ y t = x ⋆ .Markov games are popular model in the field of multi-agent reinforcement learning. Since the model is quite standard, we offer a short description of the fundamental objects and notations, and we then describe connections between Theorem 1 and a possible extension to multi-state Markov games.A Markov game with n players and discounted rewards is described by a list G = (n, S, A, T , r, γ), where S is a finite set of statess, A = A 1 × • • • × A n is a finite set of action profiles, and r = (r i ) n i=1 is a collection of reward functions, where r i : S × A → R describes the reward to player i. A transition probability function T ∈ P(S|S × A) governs the evolution of the state process, described below, and a discount factor γ ∈ (0, 1) is used to aggregate rewards across time.Description of play. Markov games are played across discrete time, indexed by t ∈ N. At time t, the state variable is denoted s t ∈ S and each player i ∈ [n] selects an action a i t ∈ A i according to a distribution π i (•|s t ): a i t ∼ π i (•|s t ). The transition probability function π i ∈ P(A i |S) is called player i's policy, and we denote player i's set of policies by Π i := P(A i |S). For any time t ∈ N, the collection of actions {a i t } n i=1 is mutually conditionally independent given s t . Upon selection of the action profile a t := (a i t ) n i=1 , each player i receives the reward r i (s t , a t ), and the state transitions from s t to s t+1 according to s t+1 ∼ T (•|s t , a t ). Player i's performance criterion is its expected γ-discounted return, which depends on the state variable and the collective policy profile π := (π 1 , . . . , π n ), which we also denote by (π i , π -i ) to isolate player i's policy. We let Π := Π 1 × • • • × Π n denote the set of policy profiles. For each pair (π, s) ∈ Π × S, player i's expected γ-discounted return is given byV i (π i , π -i , s) := E π ∞ t=1 γ t-1 r i (s t , a t ) s 1 = s ,where E π denotes that for every t ≥ 1, we have that a j t ∼ π j (•|s t ) for each player j ∈ [n] and, implicitly, s t+1 ∼ T (•|s t , a t ). Definition 6. For ϵ ≥ 0, a policyπ i * ∈ Π i is called an ϵ-best response to π -i if V i (π i * , π -i , s) ≥ V i (π i , π -i , s) -ϵ, ∀π i ∈ Π i , ∀s ∈ S. Definition 7. For ϵ ≥ 0, a policy profile π * = (π i * , π -i * ) ∈ Π i is called a Markov perfect ϵ- equilibrium if, for each player i ∈ [n], π i * is an ϵ-best response to π -i * .Putting ϵ = 0 into the definitions above, we recover the classical definitions of best responding and Markov perfect equilibrium. In analogy to normal-form games, we use BR i ϵ (π -i ) ⊆ Π i to denote player i's set of ϵ-best-responses to a given counterplayer policy profile π -i .As is conventional in the literature on MARL, we focus on policies that are stationary, Markovian, and possibly randomized. That is, we focus on policies for player i that map states s t ∈ S to distributions over the agent's action set A i and sample each action a i t from that distribution in a time-invariant and history-independent manner. In principle, agents could use policies that depend also on the time index t or on the history of states and actions. However, the bulk of works on MARL consider this simpler class of policies and this is justifiable for several reasons. We refer the reader to [30] for a summary of such justifications.Markov games generalize both normal-form games (taking the state space S to be a singleton) and also MDPs (taking the number of players n = 1). Moreover, when player i's counterplayers follow a stationary policy π -i ∈ Π -i , as assumed in this work, player i's stochastic control problem is equivalent to a single-agent MDP (whose problem data depend on π -i ). It follows that player i's set of (stationary) best responses to π -i is non-empty. Furthermore, player i's best response condition can be characterized using the familiar action value (Q-) functions of reinforcement learning theory. We briefly summarize this below.In addition to the objective criterion V i (π i , π -i , s), which is called the value function, we may also define the action value function Q i for player i asQ i (π i , π -i , s, a i ) := E π ∞ t=1 γ t-1 r i (s t , a t ) s 1 = s, a i 1 = a i , for (π i , π -i ) ∈ Π, (s, a i ) ∈ S × A i .We further define an optimal action value function for player i against π -i , denoted Q * i π -i , asQ * i π -i (s, a i ) := max π i * ∈Π i Q i (π i * , π -i , s, a i ), ∀(s, a i ) ∈ S × A i .For any policy π = (π i , π -i ), one can express player i's value function using its Q-function and conditional expectations asV i (π, s) = a i π i (a i |s)Q i (π, s, a i ).From this, it follows thatmax a i ∈A i Q * i π -i (s, a i ) = max π i * ∈Π i V i (π i * , π -i , s), ∀s ∈ S.This equality allows us to characterize best responses using a function f i : Π → R, analogous to the function F i appearing in the normal-form case. We define f i (π) asf i (π i , π -i ) = max s∈S max a i ⋆ ∈A i Q * i π -i (s, a i ⋆ ) -V i (π, s) , ∀π ∈ Π.The functions {f i } n i=1 defined above possess the three properties we required of the functions {F i } n i=1 in the proof of Theorem 1: (a) f i is continuous on Π [52], (b) f i (π) ≥ 0 for all π ∈ π, and (c) f i (π i , π -i ) = 0 if and only if π i is a best response to π -i .We now turn our attention to the task of extending Theorem 1 to Markov games. Following the proof of Theorem 1, virtually all steps can be reproduced in the multi-state setting. To begin, one can construct a satisficing path π 1 , π 2 , . . . , π k by growing the set of unsatisfied players at each iteration until either UnSat(π k ) = [n] or Worse(π k ) = ∅. In the latter case, one can consider the subgame involving only the players in UnSat(π k ) and obtain a Markov perfect equilibrium π⋆ for that subgame, which can then be extended to a policy profile π ⋆ ∈ Access(π k ) by puttingπ i ⋆ = πi ⋆ , if i ∈ UnSat(π k ), π i k , if i ∈ Sat(π k ).To complete the extension of Theorem 1 to Markov games, one must show that this policy π ⋆ ∈ Π is a Markov perfect equilibrium of the n-player Markov game. Since the functions {f i } n i=1 also satisfy the continuity and semi-definiteness properties described in Appendix A, one possible technique for completing this proof involves showing that the policy π ⋆ is a limit point of the set NoBetter(π k ). In other words, one possible technique for completing this proof requires extending Lemma 1 to the multi-state case.Up to this point, analysis of the stateless case and the multi-state case have been conducted perfectly in parallel. However, it is in the extension of Lemma 1 that the presence of a state leads to a discrepancy in the analysis that will necessitate a novel proof technique for the extension of Theorem 1 to Markov games. We elaborate below on this discrepancy.Normal-form game analysis. In the context of finite normal-form games, our proof of Lemma 1 in Appendix B involves a proof by contradiction that exploits the explicit form of an indifference condition in the stateless case. In simple terms, if a player i is best responding and placing positive probability on every action, then any two actions offer equal expected payoff. In symbols, we note that R i (δ a i 1 ,x -i ) = R i (δ a i 2 , x -i ) if and only if a -i ∈A -i r i (a i 1 , a -i ) -r i (a i 2 , a -i ) P x -i (a -i ) = a -i ∈A -i r i (a i 1 , a -i ) -r i (a i 2 , a -i ) j̸ =ix j (a j ) = 0.For reasons that will be clarified below, we refer to the expressions r i (a i 1 , a -i ) -r i (a i 2 , a -i ) as coefficient terms, and we refer to the terms P x -i (a -i ) = j̸ =i x j (a j ) as strategy-dependent terms. We remark that in the case of normal-form games, the coefficient terms above do not depend on the strategy x -i .Our proof of Lemma 1 in Appendix B considered a one-parameter family of strategies parameterized by λ ∈ [0, 1]. As part of an intricate proof by contradiction, we obtained an indifference condition, (3), for a player i † who played each action with positive probability while also best responding. Due to the explicit parameterization by λ of the strategy z λ , we are able to recognize that the indifference condition in (3) is characterized by the roots of a polynomial in λ. Critically, the lefthand-side of ( 3) is a polynomial in λ because the coefficient terms do not depend on the strategy z λ and hence do not depend on λ, while the strategy-dependent terms are polynomials in λ.Markov game analysis. By contrast, we now study indifference conditions in Markov games. Consider an agent i who is best responding to a policy π -i and places positive probability on actions a i 1 and a i 2 in state s. The optimality condition is turned into an indifference condition between a i 1 and a i 2 in state s as follows:Q * i π -i (s, a i 1 ) = Q * i π -i (s, a i 2 ) = max a i ∈A i Q * i π -i (s, a i ).One can show that Q * i π -i satisfies the following equality for any (s, a i ) ∈ S × A i :Q * i π -i (s, a i ) = a -i ∈A -i r i (s, a i , a -i ) + γ s ′ ∈S T (s ′ |s, a i , a -i ) max a i ⋆ ∈A i Q * i π -i (s ′ , a i ⋆ ) P π (a -i |s),where P π (a -i |s) = j̸ =i π j (a j |s) denotes the probability of the action profile a -i in state s under policy π. In analogy to the normal-form case, we refer to P π (a -i |s) as the strategy-dependent term and we refer to the term enclosed in square brackets as the coefficient term. However, unlike the normal-form case, here it is clear that the (so-called) coefficient term also depends on the policy π -i , through the term max a i ⋆ ∈A i Q * i π -i (s, a i ⋆ ). Suppose now that we obtain a one-parameter family of policies {ϖ λ : 0 ≤ λ ≤ 1} parameterized by some λ ∈ [0, 1], in analogy to our construction of z λ in Appendix B. Since the coefficient term depends on the policy of player i's counterplayers, one has that the indifference conditionQ * i ϖ -i λ (s, a i 1 ) -Q * i ϖ -i λ (s, a i 2 ) = 0cannot generally be characterized by the roots of a polynomial in the parameter λ. 4Without characterization of the indifference condition as a polynomial in the policy parameter, our proof technique in Appendix B becomes unsuitable for the multi-state setting: we cannot invoke the fundamental theorem of algebra to conclude that the coefficient terms are identically zero, and thus we cannot obtain the contradiction critical to our proof by contradiction, where we found that player i † is in fact indifferent even at the extreme parameter value of λ = 1.In summary, the proof technique employed in Appendix B to prove Lemma 1 relies crucially on the specific explicit form of the indifference condition in stateless, finite normal-form games. Passing to the multi-state setting, the analogous indifference condition takes a different form, and so the specific derivations cannot be repurposed for a simple extension of Lemma 1. However, it is also important to recognize that this phenomenon is a limitation of the proof technique and does not pose a fundamental obstacle to the generalization of Theorem 1 per se. Indeed, the remaining elements of the proof of Theorem 1 carry over seemlessly to the multi-state case, including various continuity conditions for functions characterizing best responses. It therefore seems promising that one can generalize Theorem 1 to apply to Markov games by applying similar machinery as used in this paper but substituting a different proof for that of Lemma 1 to take advantage of topological or geometric structure shared by both normal-form and Markov games. We leave this as an interesting open question for future research.1. Claims Question: Do the main claims made in the abstract and introduction accurately reflect the paper's contributions and scope? Answer: [Yes] Justification: Our claimed contributions consist of a positive theoretical result (Theorem 1), which we prove rigorously. Additionally, we connect this theoretical finding to multi-agent reinforcement learning more broadly, which is described in the discussion sections. Guidelines:• The answer NA means that the abstract and introduction do not include the claims made in the paper. • The abstract and/or introduction should clearly state the claims made, including the contributions made in the paper and important assumptions and limitations. A No or NA answer to this question will not be perceived well by the reviewers. • The claims made should match theoretical and experimental results, and reflect how much the results can be expected to generalize to other settings. • It is fine to include aspirational goals as motivation as long as it is clear that these goals are not attained by the paper.As a special case, f i may simply be a best response selector, recovering the best response update.A more general definition, involving ϵ ≥ 0 best responding and strategy subsets was studied in[52]. In this paper, we consider true optimality and no strategic constraints, which additionally aids clarity.Of course, scaling inputs of R i means the resulting argument is no longer a probability vector. However, one can simply linearly extend R i to be a function on R d , where d = n j=1 |A j |.Although this indifference condition does not generally yield a polynomial in λ, one can easily find special cases of Markov games in which it does. For instance, if player i's action does not influence transition probabilities, the indifference condition will yield a polynomial and the normal-form proof technique will go through without modification. 


Decision: All reviewers see the novelty and usefulness of the main contribution of the work, which establishes that "satisficing paths" can always be used to find equilibrium in normal-form games.

Reviews: review: paper_summary: paper_summary: The paper delves into the strategic dynamics of MARL, focusing on the evolution of strategy profiles among agents. It introduces satisficing paths, a sequence of strategies where an agent that is best responding in one period does not switch strategies in the next, which allows for exploration in optimization. The central question addressed is whether, for any given game and initial strategy profile, it's always possible to construct a satisficing path that leads to Nash Equilibrium. The paper provides a positive answer for normal-form games, suggesting that reward-deteriorating strategic updates can drive play towards Nash equilibrium. The analysis has implications for MARL algorithms, which offers new insights into algorithm design that could avoid common drawbacks like cyclical behaviour.
strength_weakness: strength_weakness: 1. The paper is theoretical, and it's unclear how the insights would translate into practical MARL algorithms without empirical validation.
questions: questions: 1. How can the theoretical results be practically implemented in MARL algorithms?
2. Are there any known limitations or exceptions where satisficing paths might not lead to equilibrium?
3. Can the concepts presented be extended to continuous action spaces or other game types?
limitations: limitations: See above comments.
paper_summary: paper_summary: The paper answers the following question affirmatively: "For an arbitrary n-player normal-form game and an arbitrary initial strategy profile x1, is it always possible to construct a satisficing path from x1 to a Nash equilibrium of the game?".
strength_weakness: strength_weakness: I have one main complaint, and this is related to my disagreement with the following sentence at the beginning of section 3.2: 

``Theorem 1 shows that play will be driven along satisficing paths to an equilibrium".''

I disagree, because to have the guarantee that it will be driven to an equilibrium, you still need to find a way to get all unsatisfied players to the equilibrium, and this is not a trivial task at all. What your theorem 1 shows is the existence of such path to equilibrium. However, you construct this path in a very specific way, and even in the case where all players are unsatisfied (that is your Case 1, page 6), you need to find a way to transition from this situation of all-unsatisfied-players to an equilibrium (Case 1, page 6 assumes that you know such an equilibrium). And finding this is not easy if you don't know an equilibrium a priori. In other words: in large games, it may occur that almost every path is satisficing because almost no player will be exactly satisfied. This makes me wonder about the usefulness of the concept of satisficing path. The idea of weakening best-response paths where all players best-respond is interesting, but the current definition of satisficing path may be too weak.

To summarize: the paper presents an existence result, but it would be much stronger and more meaningful if authors presented an algorithm to reach Nash equilibria along satisficing paths without knowing the Nash equilibrium a priori.
questions: questions: cf. my comments in the "Weaknesses" section.
limitations: limitations: yes
paper_summary: paper_summary: This paper explores the dynamics of strategy updates in MARL and game theory, focusing on sequences of strategies satisfying a pairwise constraint. This constraint requires that the agent best responding in one period does not switch its strategy in the next period but does not constrain the non-optimizing agents in any way. Sequences of strategy with this property are called satisficing paths. In this paper, authors have shown that every finite normal-form game enjoys the satisficing paths property. Overall, the paper provides a new perspective on achieving equilibrium in multi-agent systems and has significant implications for the design and analysis of MARL algorithms.
strength_weakness: strength_weakness: 1. Although this paper provides extensive theoretical results, it lacks empirical validation. Including experimental results or simulations, even a simple example, to demonstrate the practical applicability and performance of satisficing paths in real-world scenarios would strengthen the paper’s impact.

2. While the theoretical contributions are significant, the proof techniques used are complex and may not be easily accessible to all readers. Providing more intuitive explanations could make the results more understandable to a broader audience. Although it is not a large weakness, it would improve the readability if it can be resolved.

3. The paper offers valuable algorithmic insights but falls short of providing detailed guidance on implementing these insights in practical MARL algorithms. Including specific case studies would make the theoretical contributions more actionable for practitioners.
questions: questions: 1.	This paper provides extensive theoretical results and these results are compelling, have authors considered validating findings through empirical experiments? I am wondering how satisficing paths perform in practical multi-agent reinforcement learning scenarios.

2.	Authors have proved that any finite normal-form games have the satisficing paths property. How do you envision the scalability of your approach to larger, more complex game settings? Are there specific scalability challenges that need to be addressed?

3.	Here, I just wondering have authors considered exploring alternative pathways or strategies for reaching equilibrium. If yes, how do these alternatives compare to satisficing paths in terms of convergence speed and robustness?
limitations: limitations: Yes, the authors provided limitations.
paper_summary: paper_summary: The authors study and affirm the possibility of constructing a satisficing path to a Nash equilibrium, from any initial strategy profile, in n-player normal-form games. Satisficing paths generalize best-response paths in that a player that is not best responding is not restricted in its strategy update. Players that were previously best-responding maintain their strategy. The authors use their results in a discussion to suggest that future design of MARL algorithms incorporate exploration periods among strategies, especially when they are not best-responding. The authors go on to discuss their contributions in the contexts of Markov games, decentralized learning, and dynamical systems.
strength_weakness: strength_weakness: Remark 1 suggests the algorithm is centralized rather than decentralized and learning-based. Under Case 1 you say "fix an arbitrary Nash equilibrium $z^*$.'' How does one discover "z^*?" Isn't the point of using MARL algorithms to (1) use decentralized learning to discover a NE, or (2) identify that NE from a centralized perspective, which is PPAD-complete? I am confused how the centralized entity forms its recommendations for which strategies agents should play next. 

A similar confusion holds for Case 2: I could be reading this not clearly enough, but the proof appears to suggest ``make most agents unsatisfied then arbitrarily jump to a NE (subject to feasibility via the remaining satisficed agents).'' Could you please elaborate how this is not a trivial conclusion (line 367)?
questions: questions: If there's enough space, could you elaborate on the open question left by (51) on line 73? It seems that the satisficing principle is significantly studied (line 55) but I don't have the best understanding for how or why this principle is a significant in the pre-existing literature.
limitations: limitations: Yes

Comments: title: Thank you for your response.
Thank you for your response.
comment: I have read the authors' rebuttal and keep my score unchanged.
Thank you for your detailed responses. I keep the score.
Thank you for your response. I keep the score.
Thank you for your response.