• Aucun résultat trouvé

SEMIDEFINITE PROGRAMMING FOR MIN-MAX PROBLEMS AND GAMES

N/A
N/A
Protected

Academic year: 2021

Partager "SEMIDEFINITE PROGRAMMING FOR MIN-MAX PROBLEMS AND GAMES"

Copied!
24
0
0

Texte intégral

Loading

Références

Documents relatifs

We consider the problem of the existence of natural improvement dynamics leading to approximate pure Nash equilibria, with a reasonable small approximation, and the problem of

In this work, we investigate the existence and efficiency of approximate pure Nash equilibria in weighted congestion games, with the additional requirement that such equilibria

En deuxième temps, on a examiné la coexistence de la synchronisation notée (FSHPS) (en anglais : Full State Hybrid Function Projective Synchronisation) et son in- verse notée

RESCU was initially used to analyze how changes in team size, robot-autonomy characteristics, and the human–robot in- terface affect the HMRS’s performance [19], [20]. In this paper,

Elevation dependency of the winter, summer and annual mean LSM at 30 cm depth (a), air, ground temperature and surface offset (ground minus air temperature) at 10 cm (b),

The aim of this study was 2-fold: first, to test if the functional genetic varia- tion within DRD2 rs1076560 interacts with cannabis use to predict risk of psychosis in a

Our first result (Proposition 1 in Section 2) states that in this case the above characterization of representations with non-zero fixed vectors remains true even if we allow orbits

It should be noticed that this result requires more than 0/1 rewards (contrary to our result), since the existence of a 0-optimal equilibrium can be decided in polynomial time