Angelo Fanelli
Centre national de la recherche scientifique
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Angelo Fanelli.
Theory of Computing Systems \/ Mathematical Systems Theory | 2013
Vittorio Bilò; Ioannis Caragiannis; Angelo Fanelli; Gianpiero Monaco
Bounding the price of stability of undirected network design games with fair cost allocation is a challenging open problem in the Algorithmic Game Theory research agenda. Even though the generalization of such games in directed networks is well understood in terms of the price of stability (it is exactly Hn, the n-th harmonic number, for games with n players), far less is known for network design games in undirected networks. The upper bound carries over to this case as well while the best known lower bound is 42/23≈1.826. For more restricted but interesting variants of such games such as broadcast and multicast games, sublogarithmic upper bounds are known while the best known lower bound is 12/7≈1.714. In the current paper, we improve the lower bounds as follows. We break the psychological barrier of 2 by showing that the price of stability of undirected network design games is at least 348/155≈2.245. Our proof uses a recursive construction of a network design game with a simple gadget as the main building block. For broadcast and multicast games, we present new lower bounds of 20/11≈1.818 and 1.862, respectively.
foundations of computer science | 2011
Ioannis Caragiannis; Angelo Fanelli; Nick Gravin; Alexander Skopalik
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 surprisingly simple polynomial-time algorithm that computes
workshop on internet and network economics | 2008
Vittorio Bilò; Angelo Fanelli; Michele Flammini; Luca Moscardelli
O(1)
Theoretical Computer Science | 2010
Vittorio Bilò; Angelo Fanelli; Michele Flammini; Luca Moscardelli
-approximate Nash equilibria in these games. In particular, for congestion games with linear latency functions, our algorithm computes
international colloquium on automata, languages and programming | 2008
Angelo Fanelli; Michele Flammini; Luca Moscardelli
(2+\epsilon)
algorithmic game theory | 2010
Vittorio Bilò; Ioannis Caragiannis; Angelo Fanelli; Gianpiero Monaco
-approximate pure Nash equilibria in time polynomial in the number of players, the number of resources and
workshop on internet and network economics | 2014
Vittorio Bilò; Angelo Fanelli; Michele Flammini; Gianpiero Monaco; Luca Moscardelli
1/\epsilon
international joint conference on artificial intelligence | 2011
John Augustine; Ning Chen; Edith Elkind; Angelo Fanelli; Nick Gravin; Dmitry Shiryaev
. It also applies to games with polynomial latency functions with constant maximum degree
Theoretical Computer Science | 2015
Angelo Fanelli; Dariusz Leniowski; Gianpiero Monaco; Piotr Sankowski
d
international conference on transparent optical networks | 2006
Angelo Fanelli; Michele Flammini; Giovanna Melideo; Luca Moscardelli; Alfredo Navarra
; there, the approximation guarantee is