6 citations · 32 across the 37 of their papers we have counts for
3 papers · 1 filter
Enumerating Subgraph Instances Using Map-Reduce
Foto N. Afrati, Dimitris Fotakis, Jeffrey D. Ullman
The theme of this paper is how to find all instances of a given "sample" graph in a larger "data graph," using a single round of map-reduce. For the simplest sample graph, the tria…
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'…
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…