International audienceWe investigate whether having a unique equilibrium (or a given number of equilibria) is robust to perturbation of the payoffs, both for Nash equilibrium and correlated equilibrium. We show that the set of n-player finite games with a unique correlated equilibrium is open, while this is not true of Nash equilibrium for n>2. The crucial lemma is that a unique correlated equilibrium is a quasi-strict Nash equilibrium. Related results are studied. For instance, we show that generic two-person zero-sum games have a unique correlated equilibrium and that, while the set of symmetric bimatrix games with a unique symmetric Nash equilibrium is not open, the set of symmetric bimatrix games with a unique and quasi-strict symmetric...
This paper is concerned both with the comparative geometry of Nash and correlated equilibria, and wi...
In this thesis I investigate the solution concept of Nash equilibrium. This thesis is composed of th...
Considered are imperfectly discriminating contests in which players may possess private information ...
Le fichier accessible ci-dessous est une version également éditée dans les Cahiers de la Chaire "Les...
We investigate whether having a unique equilibrium (or a given number of equilibria) is robust to pe...
La question que cet article cherche à résoudre est de savoir si le fait d'avoir un équilibre uniqu...
International audienceWe study the structure of the set of equilibrium payoffs in finite games, both...
We give a robust characterization of Nash equilibrium by postulating coherent behavior across varyin...
This paper investigates the computational properties of quasi-strict equilibrium, an attractive equi...
We prove the existence of a unique pure-strategy Nash equilibrium in nice games with isotone chain-c...
The existence of a unique equilibrium is the classic tool for ensuring predictiveness of game theory...
This paper presents a sufficient condition for the quasi-acyclic condition. A game is quasi-acyclic ...
International audienceWe show on a 4x4 example that many dynamics may eliminate all strategies used ...
We investigate the degree of discontinuity of several solution concepts from non-cooperative game th...
AbstractThis paper describes the results of an analysis of the Nash equilibrium in randomly generate...
This paper is concerned both with the comparative geometry of Nash and correlated equilibria, and wi...
In this thesis I investigate the solution concept of Nash equilibrium. This thesis is composed of th...
Considered are imperfectly discriminating contests in which players may possess private information ...
Le fichier accessible ci-dessous est une version également éditée dans les Cahiers de la Chaire "Les...
We investigate whether having a unique equilibrium (or a given number of equilibria) is robust to pe...
La question que cet article cherche à résoudre est de savoir si le fait d'avoir un équilibre uniqu...
International audienceWe study the structure of the set of equilibrium payoffs in finite games, both...
We give a robust characterization of Nash equilibrium by postulating coherent behavior across varyin...
This paper investigates the computational properties of quasi-strict equilibrium, an attractive equi...
We prove the existence of a unique pure-strategy Nash equilibrium in nice games with isotone chain-c...
The existence of a unique equilibrium is the classic tool for ensuring predictiveness of game theory...
This paper presents a sufficient condition for the quasi-acyclic condition. A game is quasi-acyclic ...
International audienceWe show on a 4x4 example that many dynamics may eliminate all strategies used ...
We investigate the degree of discontinuity of several solution concepts from non-cooperative game th...
AbstractThis paper describes the results of an analysis of the Nash equilibrium in randomly generate...
This paper is concerned both with the comparative geometry of Nash and correlated equilibria, and wi...
In this thesis I investigate the solution concept of Nash equilibrium. This thesis is composed of th...
Considered are imperfectly discriminating contests in which players may possess private information ...