Laurent Gourvès

According to our database1, Laurent Gourvès authored at least 69 papers between 2004 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
On maximin share allocations in matroids.
Theor. Comput. Sci., 2019

Agreeable sets with matroidal constraints.
J. Comb. Optim., 2019

Local envy-freeness in house allocation problems.
Autonomous Agents and Multi-Agent Systems, 2019

On a Simple Hedonic Game with Graph-Restricted Communication.
Proceedings of the Algorithmic Game Theory - 12th International Symposium, 2019

On the Problem of Assigning PhD Grants.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Project Games.
Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018
Subset sum problems with digraph constraints.
J. Comb. Optim., 2018

Covering Clients with Types and Budgets.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Local Envy-Freeness in House Allocation Problems.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017
Bi-objective matchings with the triangle inequality.
Theor. Comput. Sci., 2017

The Price of Optimum: Complexity and Approximation for a Matching Game.
Algorithmica, 2017

Selfish Transportation Games.
Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

Object Allocation via Swaps along a Social Network.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Approximate Maximin Share Allocations in Matroids.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016
Conference Program Design with Single-Peaked and Single-Crossing Preferences.
Proceedings of the Web and Internet Economics - 12th International Conference, 2016

How Hard Is It for a Party to Nominate an Election Winner?.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Achieving Proportional Representation in Conference Programs.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Strategic Voting in a Social Context: Considerate Equilibria.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

2015
Worst case compromises in matroids with applications to the allocation of indivisible goods.
Theor. Comput. Sci., 2015

The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles.
Theor. Comput. Sci., 2015

Congestion Games with Capacitated Resources.
Theory Comput. Syst., 2015

Approximating the optimal sequence of acquisitions and sales with a capped budget.
Inf. Process. Lett., 2015

Approximate tradeoffs on weighted labeled matroids.
Discret. Appl. Math., 2015

Profitable Deviation Strong Equilibria.
Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

2014
The Lazy Matroid Problem.
Proceedings of the Theoretical Computer Science, 2014

Near Fairness in Matroids.
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

On regular and approximately fair allocations of indivisible goods.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

2013
Single approximation for the biobjective Max TSP.
Theor. Comput. Sci., 2013

Approximation with a fixed number of solutions of some multiobjective maximization problems.
J. Discrete Algorithms, 2013

Complexity of trails, paths and circuits in arc-colored digraphs.
Discret. Appl. Math., 2013

Fair solutions for some multiagent optimization problems.
Autonomous Agents and Multi-Agent Systems, 2013

A Protocol for Cutting Matroids Like Cakes.
Proceedings of the Web and Internet Economics - 9th International Conference, 2013

Designing Budget-Balanced Best-Response Mechanisms for Network Coordination Games.
Proceedings of the Algorithmic Game Theory - 6th International Symposium, 2013

A Matroid Approach to the Worst Case Allocation of Indivisible Goods.
Proceedings of the IJCAI 2013, 2013

The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design.
Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

Possible Winners in Approval Voting.
Proceedings of the Algorithmic Decision Theory - Third International Conference, 2013

2012
Strategic Coloring of a Graph.
Internet Mathematics, 2012

On paths, trails and closed trails in edge-colored graphs.
Discrete Mathematics & Theoretical Computer Science, 2012

Cooperation in multiorganization matching.
Algorithmic Operations Research, 2012

Cost allocation protocols for network formation on connection situations.
Proceedings of the 6th International ICST Conference on Performance Evaluation Methodologies and Tools, 2012

Approximate Tradeoffs on Matroids.
Proceedings of the ECAI 2012, 2012

2011
Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems.
Proceedings of the Approximation and Online Algorithms - 9th International Workshop, 2011

The Price of Optimum in a Matching Game.
Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011

Strategy-Proof Mechanisms for Facility Location Games with Many Facilities.
Proceedings of the Algorithmic Decision Theory - Second International Conference, 2011

2010
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs.
J. Discrete Algorithms, 2010

Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation.
Eur. J. Oper. Res., 2010

Labeled Traveling Salesman Problems: Complexity and approximation.
Discret. Optim., 2010

The minimum reload s-t path, trail and walk problems.
Discret. Appl. Math., 2010

Minimum regulation of uncoordinated matchings
CoRR, 2010

The Max k-Cut Game and Its Strong Equilibria.
Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs.
Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

On a Labeled Vehicle Routing Problem.
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

On the Impact of Local Taxes in a Set Cover Game.
Proceedings of the Structural Information and Communication Complexity, 2010

2009
On the minimum hitting set of bundles problem.
Theor. Comput. Sci., 2009

On s-t paths and trails in edge-colored graphs.
Electron. Notes Discret. Math., 2009

Selfish Scheduling with Setup Times.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

On Strong Equilibria in the Max Cut Game.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

The Minimum Reload s-tPath/Trail/Walk Problems.
Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

2008
Three Selfish Spanning Tree Games.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

On Labeled Traveling Salesman Problems.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007
Approximation in Multiobjective Problems.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

On the Performance of Congestion Games for Optimum Satisfiability Problems.
Proceedings of the Internet and Network Economics, Third International Workshop, 2007

Complexity and Approximation Results for the Connected Vertex Cover Problem.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

Scheduling Selfish Tasks: About the Performance of Truthful Algorithms.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006
Fair cost-sharing methods for the minimum spanning tree game.
Inf. Process. Lett., 2006

Approximation algorithms for the bi-criteria weighted MAX-CUT problem.
Discret. Appl. Math., 2006

2005
Approximation results for a bicriteria job scheduling problem on a single machine without preemption.
Inf. Process. Lett., 2005

(Non)-Approximability for the Multi-criteria TSP(1, 2).
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2004
Approximating the Pareto curve with local search for the bicriteria TSP(1, 2) problem.
Theor. Comput. Sci., 2004


  Loading...