We study the problem of finding robust equilibria in multiplayer concurrent games with mean payoff objectives. A (k, t)-robust equilibrium is a strategy profile such that no coalition of size k can improve the payoff of one its member by deviating, and no coalition of size t can decrease the payoff of other players. We are interested in pure equilibria, that is, solutions that can be implemente...

Using the method of generic continuity of set-valued mappings, this paper studies the stability of weakly Pareto-Nash and Pareto-Nash equilibria for multiobjective population games, when payoff functions are perturbed. More precisely, the paper investigates the continuity properties of the set of weakly Pareto-Nash equilibria and that of the set of Pareto-Nash equilibria under sufficiently smal...

Simon (2003) presented an example of a 3-player Bayesian game with no Bayesian equilibria, leaving open the question of whether or not there are games with no Bayesian approximate equilibria. We present an example of a Bayesian game with two players, two actions and a continuum of states that possesses no Bayesian approximate equilibria, thus resolving the question. As a side benefit we also ha...

This paper establishes in a general way the existence of a connection between the stationary equilibria of an infinite horizon economy and the equilibria of a naturally related finite economy. More specifically, the connection is established first between the cycles of a stationary overlapping generations economy and the equilibria of a related finite economy with a cyclical structure. Then the...

The relative equilibria for the spherical, finite density three-body problem are identified. Specifically, there are 28 distinct relative equilibria in this problem which include the classical five relative equilibria for the point-mass three-body problem. None of the identified relative equilibria exist or are stable over all values of angular momentum. The stability and bifurcation pathways o...

Finding equilibria of the finite size Kuramoto model amounts to solving a nonlinear system of equations, which is an important yet challenging problem. We translate this into an algebraic geometry problem and use numerical methods to find all of the equilibria for various choices of coupling constants K, natural frequencies, and on different graphs. We note that for even modest sizes (N ~ 10-20...

We study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In such games, each player aims at reaching his own goal set of states as soon as possible. A previous work on this model showed that Nash equilibria (resp. secure equilibria) are guaranteed to exist in the multiplayer (resp. two-player) case. The existence of secure equilibria ...

In this paper, we characterize equilibria in games of electoral competition between three or more office-seeking candidates. Recognizing that electoral equilibrium involves both candidates’ and voters’ strategies, we first prove existence of pure strategy electoral equilibria when candidates seek to maximize their vote share. Accordingly, the main difficulty with electoral equilibria is multipl...

In moving from finite-action to infinite-action games, standard refinements of the Nash equilibrium concept cease to satisfy certain “natural” properties. For instance, perfect equilibria in compact, continuous games need not be admissible. This paper highlights additional properties of two standard refinement specifications that are not inherited by supersets of the set of finite games. The an...

A model of stochastic games where multiple controllers jointly control the evolution of the state of a dynamic system but have access to different information about the state and action processes is considered. The asymmetry of information among the controllers makes it difficult to compute or characterize Nash equilibria. Using common information among the controllers, the game with asymmetric...