Nicolas Markey

Résumé

We propose a procedure for computing Nash equilibria in multi-player timed games with reachability objectives. Our procedure is based on the construction of a finite concurrent game, and on a generic characterization of Nash equilibria in (possibly infinite) concurrent games. Along the way, we use our characterization to compute Nash equilibria in finite concurrent games.

@inproceedings{concur2010-BBM,
  author =              {Bouyer, Patricia and Brenguier, Romain and Markey,
                         Nicolas},
  title =               {{N}ash Equilibria for Reachability Objectives in
                         Multi-player Timed Games},
  editor =              {Gastin, Paul and Laroussinie, Fran{\c c}ois},
  booktitle =           {{P}roceedings of the 21st {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'10)},
  acronym =             {{CONCUR}'10},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6269},
  pages =               {192-206},
  year =                {2010},
  month =               sep,
  doi =                 {10.1007/978-3-642-15375-4_14},
  abstract =            {We propose a procedure for computing Nash equilibria
                         in multi-player timed games with reachability
                         objectives. Our procedure is based on the
                         construction of a finite concurrent game, and on a
                         generic characterization of Nash equilibria in
                         (possibly infinite) concurrent games. Along the way,
                         we~use our characterization to compute Nash
                         equilibria in finite concurrent games.},
}