International audienceThis paper deals with states that are immune to group deviations. Group deviations help the players of a strategic game to escape from undesirable states but they compromise the stability of a system. We propose and analyse a solution concept, called profitable deviation strong equilibrium, which is between two well-known equilibria: the strong equilibrium and the super strong equilibrium. The former precludes joint deviations by groups of players who all benefit. The latter is more demanding in the sense that at least one member of a deviating coalition must be better off while the other members cannot be worst off. We study the existence, computation and convergence to a profitable deviation strong equilibrium in thr...
We identify two sufficient conditions for games with strategic complementarities to have a unique eq...
We study a class of finite strategic games with the property that every deviation of a coalition of ...
This paper provides a formal proof of the conjecture stating that optimal colorings in max k-cut gam...
This paper deals with states that are immune to group deviations. Group deviations help the players ...
A Nash Equilibriun (NE) is a strategy profile that is resilient to unilateral deviations, and is pre...
A Nash equilibrium (NE) in a multi-agent game is a strategy profile that is resilient to unilateral ...
Infinite horizon discrete time non-cooperative games with observable actions of players and dis-coun...
An instance of the max k −cut game is an edge weighted graph. Every vertex is controlled by an auton...
A strong correlated equilibrium is a correlated strategy profile that is immune to joint deviations....
We study strong Nash equilibria in mixed strategies in finite games. A Nash equilibrium is strong if...
Abstract A strong correlated equilibrium is a strategy profile that is immune to joint deviations. D...
We study strong stability of Nash equilibria in load balancing games of m (m ≥ 2) identical servers,...
A rather general class of strategic games is described where the coalitional improvements are acycli...
AbstractStability against potential deviations by sets of agents is a most desired property in the d...
The Nash equilibrium (NE) is known to be a very important solution concept in game theory. However, ...
We identify two sufficient conditions for games with strategic complementarities to have a unique eq...
We study a class of finite strategic games with the property that every deviation of a coalition of ...
This paper provides a formal proof of the conjecture stating that optimal colorings in max k-cut gam...
This paper deals with states that are immune to group deviations. Group deviations help the players ...
A Nash Equilibriun (NE) is a strategy profile that is resilient to unilateral deviations, and is pre...
A Nash equilibrium (NE) in a multi-agent game is a strategy profile that is resilient to unilateral ...
Infinite horizon discrete time non-cooperative games with observable actions of players and dis-coun...
An instance of the max k −cut game is an edge weighted graph. Every vertex is controlled by an auton...
A strong correlated equilibrium is a correlated strategy profile that is immune to joint deviations....
We study strong Nash equilibria in mixed strategies in finite games. A Nash equilibrium is strong if...
Abstract A strong correlated equilibrium is a strategy profile that is immune to joint deviations. D...
We study strong stability of Nash equilibria in load balancing games of m (m ≥ 2) identical servers,...
A rather general class of strategic games is described where the coalitional improvements are acycli...
AbstractStability against potential deviations by sets of agents is a most desired property in the d...
The Nash equilibrium (NE) is known to be a very important solution concept in game theory. However, ...
We identify two sufficient conditions for games with strategic complementarities to have a unique eq...
We study a class of finite strategic games with the property that every deviation of a coalition of ...
This paper provides a formal proof of the conjecture stating that optimal colorings in max k-cut gam...