Laurent Gourvès
CNRS researcher (Chargé de recherche 2eme classe)
LAMSADE CNRS, Université Paris-Dauphine, Place du Maréchal de Lattre de Tassigny, 75775, Paris Cedex 16
laurent (dot) gourves (at) lamsade (dot) dauphine (dot) fr
http://www.lamsade.dauphine.fr/~gourves
Short bio: Laurent Gourvès received the Ph.D. degree in Computer Science in november 2005 from Université d’Evry Val d’Essonne. He made a post-doc in Athens University and became CNRS researcher (permanent position) in november 2006.
Research interests: Laurent Gourvès is mainly interested in Combinatorial Optimization, Algorithmic Game Theory, Approximation Algorithms and Multiple Criteria problems.

Jérôme Monnot
CNRS researcher (Chargé de recherche 1ere classe)
LAMSADE CNRS, Université Paris-Dauphine, Place du Maréchal de Lattre de Tassigny, 75775, Paris Cedex 16
monnot (at) lamsade (dot) dauphine (dot) fr
http://l1.lamsade.dauphine.fr/~monnot/
Short bio: Jérôme Monnot received the Ph.D. degree in Computer Science and Operations Research in 1998 and Habilitation thesis in 2003 from Université Paris-Dauphine. He became chargé de recherche at CNRS in 2001.
Research interests: Jérôme Monnot is interested in Complexity Theory, Approximation of hard problems, Combinatorial Optimization, Multicriteria optimization, Robust problems, Reoptimization, Game Theory and more generally in Operations Research.

Bruno Escoffier
Assistant Professor (Maître de conférences)
LAMSADE CNRS, Université Paris-Dauphine, Place du Maréchal de Lattre de Tassigny, 75775, Paris Cedex 16
escoffier (at) lamsade (dot) dauphine (dot) fr
http://www.lamsade.dauphine.fr/~escoffier
Short bio: Bruno Escoffier holds master diplomas in Computer Science from the Université Paris 6 and in Science and Executive Engineering from the Ecole des Mines de Paris; he received its Ph.D. in Computer Science in November 2005 from the Université Paris Dauphine. He is since September 2006 Maître de Conférences (Assistant Professor, permanent position) in the team “Combinatorial Optimization and applications” of Lamsade, Université Paris Dauphine.
Research interests: Bruno Escoffier is mainly interested in Combinatorial Optimization and Operations Research, more precisely in algorithmic complexity, in the development of exact or approximate algorithms for solving hard combinatorial problems, in dynamic and on-line computation, as well as in several aspects of algorithmic decision aiding.

Nguyen Kim Thang
Assistant Professor (Maître de conférences)
IBISC, Université d'Evry Val d'Essonne, 23 bld de France, 91000 Evry, France
thang (at) ibisc (dot) fr
http://www.ibisc.fr/~thang/
Short bio: Nguyen Kim Thang received the Ph.D. degree in Computer Science in 2009 from Ecole Polytechnique. He is a postdoctoral researcher within the COCA project since September 2010. Since 2011, he has been Assistant Professor (Maître de Conférences) in Université d'Evry Val d'Essonne.
Research interests: Design and Analysis of Algorithms, Algorithmic Game Theory, Approximation and Online Algorithms.

Fanny Pascual
Assistant Professor (Maître de conférences)
LIP6 CNRS, UPMC, 104 avenue du Président Kennedy, 75016 Paris
fanny (dot) pascual (at) lip6 (dot) fr
http://www-desir.lip6.fr/~pascualf
Short bio: Fanny Pascual received a Ph. D. in Computer Science in october 2006 from Université d'Evry. She spent one semester in Athens University in spring 2006, and she has been an INRIA post-doc in Grenoble in 2006-2007. She became Maître de Conférences in Université Pierre et Marie Curie (UPMC) in 2007.
Research interests: Combinatorial Optimization, Algorithmic Game Theory, Operations Research.

Olivier Spanjaard
Assistant Professor (Maître de conférences)
LIP6 CNRS, UPMC, 104 avenue du Président Kennedy, 75016 Paris
olivier (dot) spanjaard (at) lip6 (dot) fr
http://www-desir.lip6.fr/~spanjaard
Short bio: Olivier Spanjaard received the Ph.D. degree in Computer Science in 2003 from Université Paris-Dauphine. He became Maître de Conférences in 2004 in Université Pierre et Marie Curie (UPMC).
Research interests: Olivier Spanjaard is mainly interested in Operations Research, Artificial Intelligence, Multiobjective Optimization and Optimization with multiple scenarios or agents. He is interested in theoretical and practical aspects of these fields.

Diodato Ferraioli
Postdoctoral researcher
LAMSADE, Université Paris-Dauphine, Place du Maréchal de Lattre de Tassigny, 75775, Paris Cedex 16
diodato (dot) ferraioli (at) dauphine (dot) fr
http://www.lamsade.dauphine.fr/~ferraioli/
Short bio: Diodato Ferraioli received the Ph.D. degree in Computer Science in April 2012 from Università degli Studi di Salerno, Italy. He is a postdoctoral researcher within the COCA project since September 2012.
Research interests: Diodato Ferraioli is mainly interested in Algorithmic Game Theory, Theory of Computation and Algorithm and Complexity.