1 citations · 1 across the 2 of their papers we have counts for
4 papers
On the Distortion of Committee Election with 1-Euclidean Preferences and Few Distance Queries
Dimitris Fotakis, Laurent Gourvès, Panagiotis Patsilinakos
We consider committee election of (out of ) candidates, where the voters and the candidates are associated with locations on the real line. Each voter's card…
Filling Crosswords is Very Hard
Laurent Gourvès, Ararat Harutyunyan, Michael Lampis +1
We revisit a classical crossword filling puzzle which already appeared in Garey\&Jonhson's book. We are given a grid with vertical and horizontal slots and a dictionary with $m…
Subset Sum Problems With Digraph Constraints
Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
We introduce and study four optimization problems that generalize the well-known subset sum problem. Given a node-weighted digraph, select a subset of vertices whose total weight d…
Minimum regulation of uncoordinated matchings
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
Due to the lack of coordination, it is unlikely that the selfish players of a strategic game reach a socially good state. A possible way to cope with selfishness is to compute a de…