2 citations · 8 across the 10 of their papers we have counts for
11 papers · 1 filter
Minimizing Rosenthal's Potential in Monotone Congestion Games
Vittorio Bilò, Angelo Fanelli, Laurent Gourvès +2
Congestion games are attractive because they can model many concrete situations where some competing entities interact through the use of some shared resources, and also because th…
Individually Stable Dynamics in Coalition Formation over Graphs
Angelo Fanelli, Laurent Gourvès, Ayumi Igarashi +1
Coalition formation over graphs is a well studied class of games whose players are vertices and feasible coalitions must be connected subgraphs. In this setting, the existence and…
Local Aggregation in Preference Games
Angelo Fanelli, Dimitris Fotakis
In this work we introduce a new model of decision-making by agents in a social network. Agents have innate preferences over the strategies but, because of the social interactions,…
On approximate pure Nash equilibria in weighted congestion games with polynomial latencies
Ioannis Caragiannis, Angelo Fanelli
We study natural improvement dynamics in weighted congestion games with polynomial latencies of maximum degree . We focus on two problems regarding the existence and effic…
An almost ideal coordination mechanism for unrelated machine scheduling
Ioannis Caragiannis, Angelo Fanelli
Coordination mechanisms aim to mitigate the impact of selfishness when scheduling jobs to different machines. Such a mechanism defines a scheduling policy within each machine and n…
Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games
Ioannis Caragiannis, Angelo Fanelli, Nick Gravin
We present an algorithm that computes approximate pure Nash equilibria in a broad class of constraint satisfaction games that generalize the well-known cut and party affiliation ga…