6 citations · 7 across the 3 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2012
On the Hardness of Network Design for Bottleneck Routing Games
Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas +1
In routing games, the network performance at equilibrium can be significantly improved if we remove some edges from the network. This counterintuitive fact, widely known as Braess'…
cs.GT2012★ 1 cited
On the Power of Deterministic Mechanisms for Facility Location Games
Dimitris Fotakis, Christos Tzamos
We consider K-Facility Location games, where n strategic agents report their locations in a metric space, and a mechanism maps them to K facilities. Our main result is an elegant c…