2 citations · 2 across the 5 of their papers we have counts for
5 papers · 1 filter
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…
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…
Considerate Equilibrium
Martin Hoefer, Michal Penn, Maria Polukarov +2
We consider the existence and computational complexity of coalitional stability concepts based on social networks. Our concepts represent a natural and rich combinatorial generaliz…
On the complexity of Nash dynamics and Sink Equilibria
Vahab Mirrokni, Alexander Skopalik
Studying Nash dynamics is an important approach for analyzing the outcome of games with repeated selfish behavior of self-interested agents. Sink equilibria has been introduced by…
Altruism in Atomic Congestion Games
Martin Hoefer, Alexander Skopalik
This paper studies the effects of introducing altruistic agents into atomic congestion games. Altruistic behavior is modeled by a trade-off between selfish and social objectives. I…