Angelo Fanelli
Title
Cited by
Cited by
Year
Efficient computation of approximate pure Nash equilibria in congestion games
I Caragiannis, A Fanelli, N Gravin, A Skopalik
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 532-541, 2011
542011
Graphical congestion games
V Bilo, A Fanelli, M Flammini, L Moscardelli
Algorithmica 61 (2), 274-297, 2011
452011
Approximate pure Nash equilibria in weighted congestion games: existence, efficient computation, and structure
I Caragiannis, A Fanelli, N Gravin, A Skopalik
ACM Transactions on Economics and Computation (TEAC) 3 (1), 1-32, 2015
402015
Dynamics of profit-sharing games
J Augustine, N Chen, E Elkind, A Fanelli, N Gravin, D Shiryaev
Internet Mathematics 11 (1), 1-22, 2015
332015
On the price of stability of fractional hedonic games
V BilÚ, A Fanelli, M Flammini, G Monaco, L Moscardelli
Proceedings of the 2015 International Conference on Autonomous Agents and†…, 2015
322015
Nash stability in fractional hedonic games
V BilÚ, A Fanelli, M Flammini, G Monaco, L Moscardelli
International Conference on Web and Internet Economics, 486-491, 2014
312014
Price of Pareto optimality in hedonic games
E Elkind, A Fanelli, M Flammini
Thirtieth AAAI Conference on Artificial Intelligence, 2016
302016
Nash stable outcomes in fractional hedonic games: Existence, efficiency and computation
V BilÚ, A Fanelli, M Flammini, G Monaco, L Moscardelli
Journal of Artificial Intelligence Research 62, 315-371, 2018
272018
Improved lower bounds on the price of stability of undirected network design games
V Bilo, I Caragiannis, A Fanelli, G Monaco
Theory of Computing Systems 52 (4), 668-686, 2013
242013
The speed of convergence in congestion games under best-response dynamics
A Fanelli, M Flammini, L Moscardelli
International Colloquium on Automata, Languages, and Programming, 796-807, 2008
232008
When ignorance helps: Graphical multicast cost sharing games
V BilÚ, A Fanelli, M Flammini, L Moscardelli
Theoretical Computer Science 411 (3), 660-671, 2010
222010
Performance of one-round walks in linear congestion games
V BilÚ, A Fanelli, M Flammini, L Moscardelli
Theory of Computing Systems 49 (1), 24-45, 2011
192011
Improved lower bounds on the price of stability of undirected network design games
V Bilo, I Caragiannis, A Fanelli, G Monaco
International Symposium on Algorithmic Game Theory, 90-101, 2010
192010
Opinion formation games with dynamic social influences
V Bilo, A Fanelli, L Moscardelli
International Conference on Web and Internet Economics, 444-458, 2016
182016
The speed of convergence in congestion games under best-response dynamics
A Fanelli, M Flammini, L Moscardelli
ACM Transactions on Algorithms (TALG) 8 (3), 1-15, 2012
182012
Designing fast converging cost sharing methods for multicast transmissions
V BilÚ, A Fanelli, M Flammini, G Melideo, L Moscardelli
Theory of Computing Systems 47 (2), 507-530, 2010
142010
On lookahead equilibria in congestion games
V BilÚ, A Fanelli, L Moscardelli
International Conference on Web and Internet Economics, 54-67, 2013
13*2013
The ring design game with fair cost allocation
A Fanelli, D Leniowski, G Monaco, P Sankowski
Theoretical Computer Science 562, 90-100, 2015
122015
On best response dynamics in weighted congestion games with polynomial delays
A Fanelli, L Moscardelli
Distributed Computing 24 (5), 245-254, 2011
122011
On best response dynamics in weighted congestion games with polynomial delays
A Fanelli, L Moscardelli
International Workshop on Internet and Network Economics, 55-66, 2009
112009
The system can't perform the operation now. Try again later.
Articles 1–20