1 citations · 1 across the 5 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
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…
cs.GT2014
Optimizing the Social Cost of Congestion Games by Imposing Variable Delays
Josep Díaz, Ioannis Giotis, Lefteris Kirousis +2
We describe a new coordination mechanism for non-atomic congestion games that leads to a (selfish) social cost which is arbitrarily close to the non-selfish optimal. This mechanism…