Curriculum vitae

Gourvès Laurent

Chargé de recherche CNRS
LAMSADE

laurent.gourvesping@lamsade.dauphinepong.fr
Tel : 01 44 05 40 50
Bureau : P622
Site web personnel

Biographie

Doctorat en informatique de l'université d'Evry (2005). Chargé de recherche au CNRS en 2006 puis Directeur de recherche au CNRS en 2019. Habilitation à diriger des recherches obtenue à l'université Paris-Dauphine (2014). Directeur adjoint du LAMSADE de juin 2015 à octobre 2019.   

Dernières publications

Articles

Gourvès L., Monnot J. (2019), On maximin share allocations in matroids, Theoretical Computer Science, vol. 754, p. 50-64

Beynier A., Chevaleyre Y., Gourvès L., Harutyunyan A., Lesca J., Maudet N., Wilczynski A. (2019), Local envy-freeness in house allocation problems, Autonomous Agents and Multi-Agent Systems, vol. 33, n°5, p. 591–627

Gourvès L. (2019), Agreeable sets with matroidal constraints, Journal of Combinatorial Optimization, vol. 37, n°3, p. 866-888

Gourvès L., Monnot J., Tlilane L. (2018), Subset sum problems with digraph constraints, Journal of Combinatorial Optimization, vol. 36, n°3, p. 937-964

Escoffier B., Gourvès L., Monnot J. (2017), The Price of Optimum: Complexity and Approximation for a Matching Game, Algorithmica, vol. 77, n°3, p. 836-866

Gourvès L., Monnot J., Pascual F., Vanderpooten D. (2017), Bi-objective matchings with the triangle inequality, Theoretical Computer Science, vol. 670, p. 1-10

Gourvès L., Monnot J., Tlilane L. (2015), Approximate tradeoffs on weighted labeled matroids, Discrete Applied Mathematics, vol. 184, p. 154-166

Gourvès L., Monnot J., Tlilane L. (2015), Worst case compromises in matroids with applications to the allocation of indivisible goods, Theoretical Computer Science, vol. 589, p. 121-140

Gourvès L. (2015), Approximating the optimal sequence of acquisitions and sales with a capped budget, Information Processing Letters, vol. 115, n°10, p. 760-764

Faria L., Gourvès L., Martinhon C., Monnot J. (2015), The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles, Theoretical Computer Science, vol. 602, p. 89-102

Gourvès L., Monnot J., Moretti S., Kim Thang N. (2015), Congestion Games with Capacitated Resources, Theory of Computing Systems, vol. 57, n°3, p. 598-616

Bazgan C., Gourvès L., Monnot J., Pascual F. (2013), Single approximation for biobjective Max TSP, Theoretical Computer Science, vol. 478, p. 41-50

Monnot J., Martinhon C., Lyra A., Gourvès L. (2013), Complexity of trails, paths and circuits in arc-colored digraphs, Discrete Applied Mathematics, vol. 161, n°6, p. 819-828

Bazgan C., Gourvès L., Monnot J. (2013), Approximation with a fixed number of solutions of some multiobjective maximization problems, Journal of Discrete Algorithms, vol. 22, p. 19-29

Monnot J., Gourvès L., Escoffier B. (2013), Fair solutions for some multiagent optimization problems, Autonomous Agents and Multi-Agent Systems, vol. 26, n°2, p. 184-201

Gourvès L., Monnot J., Pascual F. (2012), Cooperation in multiorganization matching, Algorithmic Operations Research, vol. 7, n°2, p. 111-124

Escoffier B., Gourvès L., Monnot J. (2012), Strategic Coloring of a Graph, Internet Mathematics, vol. 8, n°4, p. 424-455

Gourvès L., Monnot J., Martinhon C., Lyra A. (2012), On paths, trails and closed trails in edge-colored graphs, Discrete Mathematics and Theoretical Computer Science, vol. 14, n°2, p. 57-74

Monnot J., Martinhon C., Gourvès L., Lyra A. (2010), The minimum reload s–t path, trail and walk problems, Discrete Applied Mathematics, vol. 158, n°13, p. 1404-1417

Couëtoux B., Gourvès L., Monnot J., Telelis O. (2010), Labeled Traveling Salesman Problems: Complexity and approximation, Discrete Optimization, vol. 7, n°1-2, p. 74-85

Escoffier B., Gourvès L., Monnot J. (2010), Complexity and Approximation Results for the Connected Vertex Cover Problem in Graphs and Hypergraphs, Journal of Discrete Algorithms, vol. 8, n°1, p. 36-49

Monnot J., Escoffier B., Spanjaard O., Gourvès L. (2010), Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation, European Journal of Operational Research, vol. 205, n°1, p. 19-30

Monnot J., Protti F., Gourvès L., Adria L., Martinhon C. (2009), On s-t paths and trails in edge-colored graphs, Electronic Notes in Discrete Mathematics, vol. 35, p. 221-226

Angel E., Bampis E., Gourvès L. (2009), On the Minimum Hitting Set of Bundles Problem, Theoretical Computer Science, vol. 410, n°45, p. 4534-4542

Bampis E., Gourvès L., Angel E. (2004), Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem, Theoretical Computer Science, vol. 310, n°1-3, p. 135-146

Chapitres d'ouvrage

Ferraioli D., Gourvès L., Moretti S., Pascual F., Spanjaard O. (2014), Combinatorial Optimization with Competing Agents, in Vangelis Th. Paschos, Paradigms of Combinatorial Optimization: Problems and New Approaches, 2nd Edition Wiley - Mathematics and Statistics , p. 675-706

Monnot J., Telelis O., Gourvès L. (2012), Strategic Scheduling Games: Equilibria and Efficiency, in Roger Z. Ríos-Mercado, Yasmín A. Ríos-Solís, Just-in-Time Systems Springer, p. 209-244

Gourvès L., Moretti S. (2011), Combinatorial Optimization Problems Arising from Interactive Congestion Situations, in Mahjoub, Ali Ridha, Progress in Combinatorial Optimization Wiley, p. 603

Gourvès L., Angel E., Bampis E. (2007), Approximation polynomiale avec garantie de performance pour l'optimisation multicritère, in Paschos, Vangelis Th., Optimisation Combinatoire 5 : problèmes paradigmatiques et problématiques nouvelles, Paris: Lavoisier, p. 271-XI

Gourvès L., Angel E., Bampis E. (2007), Approximation in Multiobjective problems, in Gonzalez, Teofilo F., Handbook of Approximation Algorithms and Metaheuristics, Boca Raton, FL: Taylor & Francis

Communications avec actes

Cechlárová K., Gourvès L., Lesca J. (2019), On the Problem of Assigning PhD Grants, in Sarit Kraus, Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI 2019), IJCAI, 130-136 p.

Bilò V., Gourvès L., Monnot J. (2019), Project Games, in Pinar Heggernes, Algorithms and Complexity, Berlin Heidelberg, Springer, 75-86 p.

Beynier A., Chevaleyre Y., Gourvès L., Lesca J., Maudet N., Wilczynski A. (2018), Local Envy-Freeness in House Allocation Problems, in Mehdi Dastani, Gita Sukthankar, Elisabeth André, Sven Koenig, 17th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS'18), IFAAMAS, 292-300 p.

Fotakis D., Gourvès L., Mathieu C., Srivastav A. (2018), Covering Clients with Types and Budgets, in Wen-Lian Hsu, Der-Tsai Lee, Chung-Shou Liao, 29th International Symposium on Algorithms and Computation (ISAAC 2018), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 73:1-73:12 p.

Gourvès L., Lesca J., Wilczynski A. (2017), Object Allocation via Swaps along a Social Network, in Carles Sierra, Proceedings of the the 26th International Joint Conference on Artificial Intelligence (IJCAI’17), Palo Alto (USA), AAAI Press / IJCAI, 213-219 p.

Fotakis D., Gourvès L., Monnot J. (2017), Selfish Transportation Games, in Bernhard Steffen, Christel Baier, Mark van den Brand, Johann Eder, Mike Hinchey, Tiziana Margaria, SOFSEM 2017: Theory and Practice of Computer Science, Springer International Publishing

Gourvès L., Monnot J. (2017), Approximate Maximin Share Allocations in Matroids, in Dimitris Fotakis, Aris Pagourtzis, Vangelis Th. Paschos, Algorithms and Complexity 10th International Conference (CIAC 2017), Springer International Publishing, 310-321 p.

Gourvès L., Lesca J., Wilczynski A. (2016), Strategic voting in a social context: considerate equilibria, in Kaminka, Gal A. ; Fox, Maria ; Bouquet, Paolo ; Hüllermeier, Eyke ; Dignum, Virginia ; Dignum, Frank ; van Harmelen, Frank, Volume 285: ECAI 2016 - 22nd European Conference on Artificial Intelligence, Tokyo, IOS Press, 1423-1431 p.

Fotakis D., Gourvès L., Monnot J. (2016), Conference Program Design with Single-Peaked and Single-Crossing Preferences, in Yang Cai, Adrian Vetta, Web and Internet Economics - 12th International Conference, WINE 2016, Montreal, Canada, December 11-14, 2016, Proceedings, Berlin Heidelberg, Springer, 221-235 p.

Faliszewski P., Gourvès L., Lang J., Lesca J., Monnot J. (2016), How Hard Is It for a Party to Nominate an Election Winner?, in Subbarao Kambhampati, Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016, AAAI Press / IJCAI, 257-263 p.

Caragiannis I., Gourvès L., Monnot J. (2016), Achieving Proportional Representation in Conference Programs, in Subbarao Kambhampati, Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July, AAAI Press / IJCAI, 144--150 p.

Gourvès L. (2015), Profitable Deviation Strong Equilibria, in Toby Walsh, Algorithmic Decision Theory - 4th International Conference, ADT 2015, Lexington, KY, USA, September 27-30, 2015, Proceedings, Berlin Heidelberg, Springer, 236-252 p.

Gourvès L., Tlilane L., Monnot J. (2014), Near Fairness in Matroids, in Schaub, Torsten, ECAI 2014 : 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic : including Prestigious Applications of Artificial Intelligence (PAIS 2014), Systems : proceedings, Prague, IOS Press, 393-398 p.

Ferraioli D., Gourvès L., Monnot J. (2014), On regular and approximately fair allocations of indivisible goods, in , AAMAS '14 Proceedings of the 2014 international conference on Autonomous agents and multi-agent systems, International Foundation for Autonomous Agents and Multiagent Systems , 997-1004 p.

Gourvès L., Monnot J., Pagourtzis A. (2014), The Lazy Matroid Problem, in Josep Diaz, Ivan Lanese, Davide Sangiorgi, Theoretical Computer Science - 8th IFIP TC 1/WG 2.2 International Conference, TCS 2014, Rome, Italy, September 1-3, 2014. Proceedings, Berlin Heidelberg, Springer, 66-77 p.

Barrot N., Gourvès L., Lang J., Monnot J. (2013), Possible Winners in Approval Voting, in Patrice Perny, Marc Pirlot, Alexis Tsoukiàs, Algorithmic Decision Theory - Third International Conference, ADT 2013, Bruxelles, Belgium, November 12-14, 2013, Proceedings, Berlin Heidelberg, Springer, 57-70 p.

Gourvès L., Tlilane L., Monnot J. (2013), A matroid approach to the worst case allocation of indivisible goods, in Rossi, Francesca, IJCAI '13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence, Beijing, AAAI Press, 136-142 p.

Tlilane L., Gourvès L., Monnot J. (2013), A Protocol for Cutting Matroids Like Cakes, in Immorlica, Nicole, Web and Internet Economics 9th International Conference, WINE 2013, Cambridge, MA, USA, December 11-14, 2013, Proceedings, Cambridge MA, Springer, 440 p.

Escoffier B., Ferraioli D., Gourvès L., Moretti S. (2013), Designing Budget-Balanced Best-Response Mechanisms for Network Coordination Games, in Berthold Vöcking, Algorithmic Game Theory - 6th International Symposium, SAGT 2013, Aachen, Germany, October 21-23, 2013. Proceedings, Berlin Heidelberg, Springer, 207-218 p.

Gourvès L., Monnot J., Pagourtzis A. (2013), The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design, in Leszek Antoni Gąsieniec, Frank Wolter, Fundamentals of Computation Theory - 19th International Symposium, FCT 2013, Liverpool, UK, August 19-21, 2013. Proceedings, Berlin Heidelberg, Springer, 171-182 p.

Bazgan C., Gourvès L., Monnot J. (2012), Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems, in Solis-Oba, Roberto, WAOA 2011, Saarbrücken, Springer, 233-246 p.

Bazgan C., Gourvès L., Monnot J., Pascual F. (2012), Single Approximation for Biobjective Max TSP, in Solis-Oba, Roberto, WAOA 2011, Saarbrücken, Springer, 49-62 p.

Gourvès L., Monnot J., Kim Thang N., Moretti S. (2012), Congestion Games with Capacitated Resources, in Serna, Maria, Algorithmic Game Theory 5th International Symposium, SAGT 2012, Barcelona, Spain, October 22-23, 2012. Proceedings, Berlin, Springer, 263 p.

Escoffier B., Monnot J., Gourvès L., Moretti S. (2012), Cost allocation protocols for network formation on connection situations, in , 6th International Conference on Performance Evaluation Methodologies and Tools, VALUETOOLS 2012 - proceedings, Cargèse, IEEE - Institute of Electrical and Electronics Engineers, 228-234 p.

Tlilane L., Monnot J., Gourvès L. (2012), Approximate Tradeoffs on Matroids, in Lucas, Peter, European Conference on Artificial Intelligence ECAI 2012, Montpellier, IOS Press, 413 p.

Spanjaard O., Pascual F., Thang N., Gourvès L., Escoffier B. (2011), Strategy-Proof Mechanisms for Facility Location Games with Many Facilities, in Tsoukiàs, Alexis, Algorithmic Decision Theory Second International Conference, ADT 2011, Piscataway, Springer, 67-81 p.

Gourvès L., Monnot J., Escoffier B. (2011), The Price of Optimum in a Matching Game, in Persiano, Giuseppe, Algorithmic Game Theory 4th International Symposium, SAGT 2011, Amalfi, Italy, October 17-19, 2011. Proceedings, Berlin, Springer, 81-92 p.

Gourvès L., Escoffier B., Monnot J. (2010), On the impact of local taxes in a set cover game, in Patt-Shamir, Boaz, Structural Information and Communication Complexity, 17th International Colloquium, SIROCCO 2010, Sirince, Turkey, June 7-11, 2010. Proceedings., Sirince, Springer, 2-13 p.

Gourvès L., Escoffier B., Monnot J. (2010), Strategic Coloring of a Graph, in , Algorithms and Complexity 7th International Conference, CIAC 2010, Rome, Italy, May 26-28, 2010. Proceedings, Rome, Springer, 155-156 p.

Martinhon C., Gourvès L., Monnot J., Lyra A. (2010), Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs, in , Theory and Applications of Models of Computation 7th Annual Conference, TAMC 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings, Prague, Springer, 222-233 p.

Gourvès L., Monnot J. (2010), The Max k-Cut Game and Its Strong Equilibria, in Li, Angsheng, Theory and Applications of Models of Computation 7th Annual Conference, TAMC 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings, Prague, Springer, 480 p.

Monnot J., Gourvès L., Chatti H. (2010), On a Labeled Vehicle Routing Problem, in Van Leeuwen, Jan, SOFSEM 2010: Theory and Practice of Computer Science, Spindleruv Mlyn, Springer, 271-282 p.

Lyra A., Gourvès L., Monnot J., Martinhon C. (2009), The Minimum Reload s-t Path/Trail/Walk Problems, in Valencia, Frank, SOFSEM 2009: Theory and Practice of Computer Science 35th Conference on Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn, Czech Republic, January 24-30, 2009. Proceedings, Spindleruv Mlyn, Springer, 621-632 p.

Gourvès L., Telelis O., Monnot J. (2009), Selfish scheduling with setup times, in , Internet and Network Economics, 5th International Workshop, WINE 2009, Rome, Italy, December 14-18, 2009. Proceedings, Rome, Springer, 292-303 p.

Monnot J., Gourvès L. (2009), On Strong Equilibria in the Max Cut Game, in Leonardi, Stefano, WINE 2009, 5th International Workshop on Internet and Network Economics, Rome, Springer, 642 p.

Angel E., Bampis E., Gourvès L. (2008), On the Minimum Hitting Set of Bundles Problem, in Xu, Jinhui, Algorithmic Aspects in Information and Management, 4th International Conference, AAIM 2008, Shanghai, China, June 23-25, 2008. Proceedings, Shanghaï, Springer, 3-14 p.

Couëtoux B., Gourvès L., Monnot J., Telelis O. (2008), On Labeled Traveling Salesman Problems, in Nagamochi, Hiroshi, ISAAC 2008, 19th International Symposium on Algorithms and Computation, Gold Coast, Springer, 945 p.

Gourvès L., Monnot J., Pascual F. (2008), Cooperation in multiorganization matching, in Skutella, Martin, Approximation and Online Algorithms. 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008, Revised Papers, Karlsruhe, Springer, 78-91 p.

Gourvès L., Monnot J. (2008), Three Selfish Spanning Tree Games, in , Internet and Network Economics. 4th International Workshop, WINE 2008, Shanghai, China, December 17-20, 2008. Proceedings, Shanghaï, Springer, 465-476 p.

Monnot J., Gourvès L., Escoffier B. (2007), Complexity and approximation results for the connected vertex cover problem, in Müller, Haiko, WG'07 33rd International Workshop on Graph-Theoretic Concepts in Computer Science, Dornburg, Springer, 341 p.

Pascual F., Gourvès L., Christodoulou G. (2007), Scheduling selfish tasks: about the performance of truthful algorithms, in Lin, Guohui, Computing and Combinatorics 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings, Berlin, Springer, 570 p.

Monnot J., Giannakos A., Gourvès L., Paschos V. (2007), On the performance of congestion games for optimum satisfiability problems, in Graham, Fan Chung, Internet and Network Economics 3rd International Workshop, WINE 2007, San Diego, CA, USA, December 12-14, 2007, Proceedings, San Diego, Springer, 598 p.

Bampis E., Monnot J., Gourvès L., Angel E. (2005), (Non)-Approximability for the multi-criteria TSP(1,2), in Reischuk, Rüdiger, Fundamentals of Computation Theory (FCT 2005), Lübeck, Springer, 576 p.

Bampis E., Angel E., Gourvès L. (2003), Approximating the Pareto Curve with Local Search for the Bicriteria TSP (1, 2) Problem (extended abstract), in Nilsson, Bengt J., Fundamentals of Computation Theory 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings, Malmö, Springer, 433 p.

Communications sans actes

Gourvès L., Monnot J., Tlilane L. (2014), Un algorithme décentralisé pour construire une base d'un matroïde commune à un ensemble d'agents, 15ème congrès ROADEF 2014, Bordeaux, France

Gourvès L., Monnot J., Tlilane L. (2013), Approximation du point idéal dans des matroïdes: bornes et algorithmes, 14e conférence de la société Française de Recherche Opérationnelle et Aide à la Décision (ROADEF 2013), Troyes, France

Gourvès L., Monnot J., Tlilane L. (2013), A guaranteed robust solution on a matroid, ECCO XXVI conference, Paris, France

Escoffier B., Gourvès L., Monnot J., Moretti S. (2013), Protocole d'allocation de coûts pour la formation d'un réseau connecté, 14e Congrès ROADEF 2013, Troyes, France

Gourvès L., Monnot J., Tlilane L. (2013), A parameterized approximation for matroids with multiple objectives, 22nd International Conference on Multiple Criteria Decision Making (MCDM 2013), Malaga, Espagne

Gourvès L., Monnot J., Pagourtzis A. (2013), Algorithmes et mécanismes pour bureaucrates paresseux, 14e Congrès ROADEF 2013, Troyes, France

Bazgan C., Escoffier B., Gourvès L., Monnot J., Pascual F., Vanderpooten D. (2012), Solutions équitables approchées pour divers problèmes d’optimisation combinatoire, 13ème congrès annuel de la Société française de recherche opérationnelle et d’aide à la décision (ROADEF'12), Angers, France

Gourvès L., Monnot J., Tlilane L. (2012), Approximation polynomiale pour des problèmes de matroïdes bi-objectifs, 13e congrès annuel de la Société française de Recherche Opérationnelle et d’Aide à la Décision (ROADEF 2012), Angers, France

Nguyen Kim T., Escoffier B., Spanjaard O., Pascual F., Gourvès L. (2011), Algorithmes à véracité garantie pour le placement d'installations sur une ligne, 12e congrès annuel de la Société française de Recherche Opérationnelle et d’Aide à la Décision, Saint Etienne, France

Monnot J., Gourvès L. (2010), Equilibres forts et jeu de la coupe maximum, ROADEF 2010, Toulouse, France

Gourvès L., Monnot J., Angel E., Bampis E. (2005), Algorithmes approchés pour le problème du voyageur de commerce multicritère, Roadef 2005, Tours, France

Gourvès L., Angel E., Bampis E. (2003), En approchant la courbe de Pareto à l'aide de la recherche locale pour le problème du voyageur de commerce bicritère avec des distances 1 et 2, ROADEF 2003, Avignon, France

Prépublications / Cahiers de recherche

Angel E., Bampis E., Gourvès L. (2007), On the hitting set of bundles problem, Paris, Cahier du LAMSADE, 15 p.

Retour à la liste