Nos tutelles

CNRS Dauphine PSL *

Rechercher





Accueil > PERSONNES

Membres

publié le , mis à jour le

retour a la liste des membres

Laurent Gourvès

Email : Laurent.Gourves@lamsade.dauphine.fr

Tel : 0144054050
Bureau : P622
Site Personnel: http://www.lamsade.dauphine.fr/~gourves/
Pole : Optimisation combinatoire algorithmique
Status : Chargé de Recherche
Domaines de Recherche : combinatorial optimization, approximation algorithms, algorithmic game theory, multicriteria optimization

Biographie : I received the PhD from the university of Evry (France) in 2005. I am CNRS researcher since november 2006.

  • Membre du conseil scientifique

  • Encadrement de these de doctorat :


    • Anaelle Wilczynski : Strong equilibria under specific coalition structures ( Début : 2015-10-01)
    voir toutes les theses

    Publications Dblp


    • Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
      The Price of Optimum: Complexity and Approximation for a Matching Game.Algorithmica77(3) 2017:836-866

    • Laurent Gourvès, Jérôme Monnot, Fanny Pascual, Daniel Vanderpooten
      Bi-objective matchings with the triangle inequality.Theor. Comput. Sci.670 2017:1-10

    • Laurent Gourvès, Jérôme Monnot
      Approximate Maximin Share Allocations in Matroids.CIAC 2017:310-321

    • Laurent Gourvès, Julien Lesca, Anaëlle Wilczynski
      Object Allocation via Swaps along a Social Network.IJCAI 2017:213-219

    • Dimitris Fotakis, Laurent Gourvès, Jérôme Monnot
      Selfish Transportation Games.SOFSEM 2017:176-187

    • Laurent Gourvès, Julien Lesca, Anaëlle Wilczynski
      Strategic Voting in a Social Context: Considerate Equilibria.ECAI 2016:1423-1431

    • Ioannis Caragiannis, Laurent Gourvès, Jérôme Monnot
      Achieving Proportional Representation in Conference Programs.IJCAI 2016:144-150

    • Piotr Faliszewski, Laurent Gourvès, Jérôme Lang, Julien Lesca, Jérôme Monnot
      How Hard Is It for a Party to Nominate an Election Winner?.IJCAI 2016:257-263

    • Dimitris Fotakis, Laurent Gourvès, Jérôme Monnot
      Conference Program Design with Single-Peaked and Single-Crossing Preferences.WINE 2016:221-235

    • Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
      Subset Sum Problems With Digraph Constraints.CoRRabs/1609.01078 2016:

    • Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
      Approximate tradeoffs on weighted labeled matroids.Discrete Applied Mathematics184 2015:154-166

    • Laurent Gourvès
      Approximating the optimal sequence of acquisitions and sales with a capped budget.Inf. Process. Lett.115(10) 2015:760-764

    • Laurent Gourvès, Jérôme Monnot, Stefano Moretti, Nguyen Kim Thang
      Congestion Games with Capacitated Resources.Theory Comput. Syst.57(3) 2015:598-616

    • Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
      Worst case compromises in matroids with applications to the allocation of indivisible goods.Theor. Comput. Sci.589 2015:121-140

    • Luérbio Faria, Laurent Gourvès, Carlos A. J. Martinhon, Jérôme Monnot
      The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles.Theor. Comput. Sci.602 2015:89-102

    • Laurent Gourvès
      Profitable Deviation Strong Equilibria.ADT 2015:236-252

    • Diodato Ferraioli, Laurent Gourvès, Jérôme Monnot
      On regular and approximately fair allocations of indivisible goods.AAMAS 2014:997-1004

    • Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
      Near Fairness in Matroids.ECAI 2014:393-398

    • Laurent Gourvès, Jérôme Monnot, Aris Pagourtzis
      The Lazy Matroid Problem.IFIP TCS 2014:66-77

    • Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
      Fair solutions for some multiagent optimization problems.Autonomous Agents and Multi-Agent Systems26(2) 2013:184-201

    • Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot
      Complexity of trails, paths and circuits in arc-colored digraphs.Discrete Applied Mathematics161(6) 2013:819-828

    • Cristina Bazgan, Laurent Gourvès, Jérôme Monnot
      Approximation with a fixed number of solutions of some multiobjective maximization problems.J. Discrete Algorithms22 2013:19-29

    • Cristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual
      Single approximation for the biobjective Max TSP.Theor. Comput. Sci.478 2013:41-50

    • Nathanaël Barrot, Laurent Gourvès, Jérôme Lang, Jérôme Monnot, Bernard Ries
      Possible Winners in Approval Voting.ADT 2013:57-70

    • Laurent Gourvès, Jérôme Monnot, Aris Pagourtzis
      The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design.FCT 2013:171-182

    • Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
      A Matroid Approach to the Worst Case Allocation of Indivisible Goods.IJCAI 2013:136-142

    • Bruno Escoffier, Diodato Ferraioli, Laurent Gourvès, Stefano Moretti
      Designing Budget-Balanced Best-Response Mechanisms for Network Coordination Games.SAGT 2013:207-218

    • Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
      A Protocol for Cutting Matroids Like Cakes.WINE 2013:216-229

    • Laurent Gourvès, Jérôme Monnot, Fanny Pascual
      Cooperation in multiorganization matching.Algorithmic Operations Research7(2) 2012:

    • Laurent Gourvès, Adria Ramos de Lyra, Carlos A. J. Martinhon, Jérôme Monnot
      On paths, trails and closed trails in edge-colored graphs.Discrete Mathematics & Theoretical Computer Science14(2) 2012:57-74

    • Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
      Strategic Coloring of a Graph.Internet Mathematics8(4) 2012:424-455

    • Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
      Approximate Tradeoffs on Matroids.ECAI 2012:360-365

    • Laurent Gourvès, Jérôme Monnot, Stefano Moretti, Nguyen Kim Thang
      Congestion Games with Capacitated Resources.SAGT 2012:204-215

    • Bruno Escoffier, Laurent Gourvès, Jérôme Monnot, Stefano Moretti
      Cost allocation protocols for network formation on connection situations.VALUETOOLS 2012:228-234

    • Bruno Escoffier, Laurent Gourvès, Nguyen Kim Thang, Fanny Pascual, Olivier Spanjaard
      Strategy-Proof Mechanisms for Facility Location Games with Many Facilities.ADT 2011:67-81

    • Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
      The Price of Optimum in a Matching Game.SAGT 2011:81-92

    • Cristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual
      Single Approximation for Biobjective Max TSP.WAOA 2011:49-62

    • Cristina Bazgan, Laurent Gourvès, Jérôme Monnot
      Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems.WAOA 2011:233-246

    • Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot
      The minimum reload s-t path, trail and walk problems.Discrete Applied Mathematics158(13) 2010:1404-1417

    • Basile Couëtoux, Laurent Gourvès, Jérôme Monnot, Orestis Telelis
      Labeled Traveling Salesman Problems: Complexity and approximation.Discrete Optimization7(1-2) 2010:74-85

    • Bruno Escoffier, Laurent Gourvès, Jérôme Monnot, Olivier Spanjaard
      Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation.European Journal of Operational Research205(1) 2010:19-30

    • Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
      Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs.J. Discrete Algorithms8(1) 2010:36-49

    • Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
      Strategic Coloring of a Graph.CIAC 2010:155-166

    • Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
      On the Impact of Local Taxes in a Set Cover Game.SIROCCO 2010:2-13

    • Hatem Chatti, Laurent Gourvès, Jérôme Monnot
      On a Labeled Vehicle Routing Problem.SOFSEM 2010:271-282

    • Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot
      Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs.TAMC 2010:222-233

    • Laurent Gourvès, Jérôme Monnot
      The Max -Cut Game and Its Strong Equilibria.TAMC 2010:234-246

    • Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
      Minimum regulation of uncoordinated matchingsCoRRabs/1012.3889 2010:

    • Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot, Fábio Protti
      On s-t paths and trails in edge-colored graphs.Electronic Notes in Discrete Mathematics35 2009:221-226

    • Eric Angel, Evripidis Bampis, Laurent Gourvès
      On the minimum hitting set of bundles problem.Theor. Comput. Sci.410(45) 2009:4534-4542

    • Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot
      The Minimum Reload s-tPath/Trail/Walk Problems.SOFSEM 2009:621-632

    • Laurent Gourvès, Jérôme Monnot, Orestis Telelis
      Selfish Scheduling with Setup Times.WINE 2009:292-303

    • Laurent Gourvès, Jérôme Monnot
      On Strong Equilibria in the Max Cut Game.WINE 2009:608-615

    • Eric Angel, Evripidis Bampis, Laurent Gourvès
      On the Minimum Hitting Set of Bundles Problem.AAIM 2008:3-14

    • Basile Couëtoux, Laurent Gourvès, Jérôme Monnot, Orestis Telelis
      On Labeled Traveling Salesman Problems.ISAAC 2008:776-787

    • Laurent Gourvès, Jérôme Monnot, Fanny Pascual
      Cooperation in Multiorganization Matching.WAOA 2008:78-91

    • Laurent Gourvès, Jérôme Monnot
      Three Selfish Spanning Tree Games.WINE 2008:465-476

    • George Christodoulou 0001, Laurent Gourvès, Fanny Pascual
      Scheduling Selfish Tasks: About the Performance of Truthful Algorithms.COCOON 2007:187-197

    • Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
      Complexity and Approximation Results for the Connected Vertex Cover Problem.WG 2007:202-213

    • Aristotelis Giannakos, Laurent Gourvès, Jérôme Monnot, Vangelis Th. Paschos
      On the Performance of Congestion Games for Optimum Satisfiability Problems.WINE 2007:220-231

    • Laurent Gourvès, Evripidis Bampis, Eric Angel
      Approximation in Multiobjective Problems.Handbook of Approximation Algorithms and Metaheuristics 2007:

    • Eric Angel, Evripidis Bampis, Laurent Gourvès
      Approximation algorithms for the bi-criteria weighted MAX-CUT problem.Discrete Applied Mathematics154(12) 2006:1685-1692

    • Eric Angel, Evripidis Bampis, Lélia Blin, Laurent Gourvès
      Fair cost-sharing methods for the minimum spanning tree game.Inf. Process. Lett.100(1) 2006:29-35

    • Eric Angel, Evripidis Bampis, Laurent Gourvès
      Approximation results for a bicriteria job scheduling problem on a single machine without preemption.Inf. Process. Lett.94(1) 2005:19-27

    • Eric Angel, Evripidis Bampis, Laurent Gourvès, Jérôme Monnot
      (Non)-Approximability for the Multi-criteria (1, 2).FCT 2005:329-340

    • Eric Angel, Evripidis Bampis, Laurent Gourvès
      Approximation Algorithms for the Bi-criteria Weighted max-cut Problem.WG 2005:331-340

    • Eric Angel, Evripidis Bampis, Laurent Gourvès
      Approximating the Pareto curve with local search for the bicriteria TSP(1, 2) problem.Theor. Comput. Sci.310(1-3) 2004:135-146

    • Eric Angel, Evripidis Bampis, Laurent Gourvès
      Approximating the Pareto Curve with Local Search for the Bicriteria TSP (1, 2) Problem.FCT 2003:39-48



    Publications DFIS


    Publications HAL