- L. Gourves and J. Monnot . " On Strong Equilibria in the Max Cut Game." WINE, Springer LNCS 5929, 608-615, 2009.
- L. Gourves, J. Monnot and O. Telelis. " Selfish Scheduling with Setup Times." WINE, Springer LNCS 5929, 292-303, 2009.
- B. Escoffier, L. Gourves and J. Monnot. "Strategic coloring of a graph." CIAC, Springer LNCS 6078, 155-166, 2010.
- L. Gourves and J. Monnot . " The Max k-Cut Game and its Strong Equilibria." TAMC, Springer LNCS, 2010.
- B. Escoffier, L. Gourves and J. Monnot. "On the impact of local taxes in a set cover game." SIROCCO , Springer LNCS, 2010.
- Nguyen Kim Thang . "On (Group) Strategy-Proof Mechanisms without Payment for Facility Location Games." WINE, Springer LNCS 6484, 531-538, 2010.
- B. Escoffier, L. Gourvès and J. Monnot. "Minimum regulation of uncoordinated matchings." CoRR abs/1012.3889, 2010, available at http://arxiv.org/abs/1012.3889.
- B. Escoffier, L. Gourves, Nguyen Kim Thang, F. Pascual and O. Spanjaard. "Algorithmes à véracité garantie pour le placement d'installations sur une ligne." ROADEF 2011.
- B. Escoffier, L. Gourves, Nguyen Kim Thang, Fanny Pascual, Olivier Spanjaard, Strategy-proof Mechanisms for Facility Location Games with Many Facilities, Algorithmic Decision Theory (ADT 2011) , Springer LNCS, 2011.
- B. Escoffier, L. Gourves, J. Monnot, The price of optimum in a matching game, SAGT , Springer LNCS, 2011.
- L. Gourves, S. Moretti, Combinatorial optimization problems arising from interactive congestion situations (book chapter), R. Mahjoub editor, Hermes.
- B. Escoffier, L. Gourves, Jerome Monnot, Stefano Moretti. Cost allocation protocols for network formation on connection situations, VALUETOOLS 2012.
- L. Gourves, Jerome Monnot, Stefano Moretti and K. T. Nguyen. Congestion games with capacitated resources, SAGT, Springer LNCS, 2012.
- B. Escoffier, L.Gourves, J. Monnot, On the price of anarchy of the set cover game, ISMP 2012.
- J. Cohen, C. Durr and K. T. Nguyen. Smooth inequalities and equilibrium inefficiency in scheduling games, WINE, Springer LNCS, 2012.
- B. Escoffier, L. Gourves, J. Monnot: Strategic Coloring of a Graph. Internet Mathematics 8(4): 424-455 (2012)
- B. Escoffier, L. Gourves, J. Monnot, S. Moretti: Protocole d'allocation de coûts pour la formation d'un réseau connecté, ROADEF 2013
- B. Escoffier, J. Monnot, F. Pascual and O. Spanjaard. Algorithmes à véracité garantie pour des problèmes de b‐couplage dans un graphe biparti, ROADEF 2013
- L. Gourves, J. Monnot, A. Pagourtzis: Algorithmes et mécanismes pour bureaucrates paresseux, ROADEF 2013
- B. Escoffier, J. Monnot, F. Pascual and O. Spanjaard. Truthful many-to-many assignment with private weights, 8th International Conference on Algorithms and Complexity (CIAC), Springer LNCS, 2013.
- L. Gourves, J. Monnot, A. Pagourtzis. The Lazy Bureaucrat Problem with common arrivals and deadlines: approximation and mechanism design, FCT 2013, Springer LNCS.
- B. Escoffier, D. Ferraioli, L. Gourvès, S. Moretti, Designing Frugal Best-Response Mechanisms for Social Network Coordination Games, SAGT 2013, Springer LNCS.
- L. Gourvès, J. Monnot, L. Tlilane. A protocol for cutting matroids like cakes, WINE 2013.