Laurent Gourvès - Citegraph

Author Info

Name	Affiliation	Papers
LAURENT GOURVÈS	CNRS, FRE 3234, F-75775 Paris, France and Université de Paris-Dauphine, LAMSADE, F-75775 Paris, France	71
Collaborators	Citations	PageRank
54	241	30.97
Referers	Referees	References
399	774	741

Search Limit

100774

Publications (71 rows)

Collaborators (54 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
On the distortion of single winner elections with aligned candidates	0	0.34	2022
In memory of Jérôme Monnot	0	0.34	2022
On Fair and Efficient Solutions for Budget Apportionment.	0	0.34	2022
Worst-case Bounds for Spending a Common Budget.	0	0.34	2021
Agreeable sets with matroidal constraints	1	0.35	2019
On the Problem of Assigning PhD Grants.	0	0.34	2019
On a Simple Hedonic Game with Graph-Restricted Communication.	0	0.34	2019
Local envy-freeness in house allocation problems.	0	0.34	2019
On maximin share allocations in matroids.	1	0.37	2019
Covering Clients with Types and Budgets.	0	0.34	2018
Local Envy-Freeness In House Allocation Problems	0	0.34	2018
Subset Sum Problems With Digraph Constraints.	1	0.36	2018
The Price of Optimum: Complexity and Approximation for a Matching Game	1	0.35	2017
Approximate Maximin Share Allocations in Matroids.	3	0.39	2017
Selfish Transportation Games.	0	0.34	2017
Bi-objective matchings with the triangle inequality.	0	0.34	2017
Object Allocation via Swaps along a Social Network.	0	0.34	2017
Achieving Proportional Representation in Conference Programs.	0	0.34	2016
Conference Program Design with Single-Peaked and Single-Crossing Preferences.	0	0.34	2016
Strategic Voting in a Social Context: Considerate Equilibria.	1	0.37	2016
How Hard Is It for a Party to Nominate an Election Winner?.	0	0.34	2016
Worst case compromises in matroids with applications to the allocation of indivisible goods	4	0.40	2015
Approximating the optimal sequence of acquisitions and sales with a capped budget	0	0.34	2015
Approximate tradeoffs on weighted labeled matroids.	2	0.40	2015
The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles	1	0.36	2015
Profitable Deviation Strong Equilibria.	0	0.34	2015
The Lazy Matroid Problem.	1	0.35	2014
On regular and approximately fair allocations of indivisible goods.	2	0.45	2014
Near Fairness in Matroids.	1	0.36	2014
Possible Winners in Approval Voting.	1	0.37	2013
Designing Budget-Balanced Best-Response Mechanisms for Network Coordination Games.	1	0.37	2013
Complexity of trails, paths and circuits in arc-colored digraphs	5	0.47	2013
The lazy bureaucrat problem with common arrivals and deadlines: approximation and mechanism design	2	0.38	2013
Fair solutions for some multiagent optimization problems	9	0.51	2013
A Protocol for Cutting Matroids Like Cakes.	4	0.46	2013
Single approximation for the biobjective Max TSP	0	0.34	2013
Approximation with a fixed number of solutions of some multiobjective maximization problems	2	0.37	2013
A matroid approach to the worst case allocation of indivisible goods	10	0.59	2013
Approximate Tradeoffs on Matroids.	1	0.35	2012
Cooperation in Multiorganization Matching	1	0.40	2012
On paths, trails and closed trails in edge-colored graphs.	5	0.48	2012
Strategic Coloring of a Graph	3	0.44	2012
Congestion games with capacitated resources	2	0.42	2012
Single approximation for biobjective max TSP	0	0.34	2011
Approximation with a fixed number of solutions of some biobjective maximization problems	2	0.47	2011
The price of optimum in a matching game	0	0.34	2011
Strategy-proof mechanisms for facility location games with many facilities	17	1.00	2011
The max k-cut game and its strong equilibria	5	0.47	2010
Complexity of paths, trails and circuits in arc-colored digraphs	3	0.43	2010
Labeled Traveling Salesman Problems: Complexity and approximation	6	0.47	2010

1
2
50 / page