2 citations · 8 across the 10 of their papers we have counts for
4 papers · 1 filter
Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure
Ioannis Caragiannis, Angelo Fanelli, Nick Gravin +1
We consider structural and algorithmic questions related to the Nash dynamics of weighted congestion games. In weighted congestion games with linear latency functions, the existenc…
On the Impact of Fair Best Response Dynamics
Angelo Fanelli, Luca Moscardelli, Alexander Skopalik
In this work we completely characterize how the frequency with which each player participates in the game dynamics affects the possibility of reaching efficient states, i.e., state…
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…
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…