2 citations · 4 across the 3 of their papers we have counts for
3 papers
cs.GT2011
Efficient coordination mechanisms for unrelated machine scheduling
Ioannis Caragiannis
We present new coordination mechanisms for scheduling selfish jobs on unrelated machines. A coordination mechanism aims to mitigate the impact of selfishness of jobs on the eff…
cs.GT2011★ 2 cited
Enforcing efficient equilibria in network design games via subsidies
John Augustine, Ioannis Caragiannis, Angelo Fanelli +1
The efficient design of networks has been an important engineering task that involves challenging combinatorial optimization problems. Typically, a network designer has to select a…
cs.GT2011★ 2 cited
Efficient computation of approximate pure Nash equilibria in congestion games
Ioannis Caragiannis, Angelo Fanelli, Nick Gravin +1
Congestion games constitute an important class of games in which computing an exact or even approximate pure Nash equilibrium is in general {\sf PLS}-complete. We present a surpris…