10 citations · 10 across the 4 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2017★ 10 cited
Fair Division of a Graph
Sylvain Bouveret, Katarína Cechlárová, Edith Elkind +2
We consider fair allocation of indivisible items under an additional constraint: there is an undirected graph describing the relationship between the items, and each agent's share…
cs.GT2015
Pareto Optimal Matchings in Many-to-Many Markets with Ties
Katarína Cechlárová, Pavlos Eirinakis, Tamás Fleiner +5
We consider Pareto-optimal matchings (POMs) in a many-to-many market of applicants and courses where applicants have preferences, which may include ties, over individual courses an…