1 citations · 2 across the 3 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2018
Computing and Testing Pareto Optimal Committees
Haris Aziz, Jerome Lang, Jerome Monnot
Selecting a set of alternatives based on the preferences of agents is an important problem in committee selection and beyond. Among the various criteria put forth for the desirabil…
cs.GT2010★ 1 cited
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…