Luca Moscardelli
Titolo
Citata da
Citata da
Anno
Tight bounds for selfish and greedy load balancing
I Caragiannis, M Flammini, C Kaklamanis, P Kanellopoulos, L Moscardelli
International Colloquium on Automata, Languages, and Programming, 311-322, 2006
972006
On the complexity of the regenerator placement problem in optical networks
M Flammini, A Marchetti-Spaccamela, G Monaco, L Moscardelli, S Zaks
IEEE/ACM Transactions on Networking 19 (2), 498-511, 2010
842010
Tight bounds for selfish and greedy load balancing
I Caragiannis, M Flammini, C Kaklamanis, P Kanellopoulos, L Moscardelli
Algorithmica 61 (3), 606-637, 2011
632011
Minimizing total busy time in parallel scheduling with application to optical networks
M Flammini, G Monaco, L Moscardelli, H Shachnai, M Shalom, T Tamir, ...
Theoretical Computer Science 411 (40-42), 3553-3562, 2010
632010
Graphical congestion games
V Bilò, A Fanelli, M Flammini, L Moscardelli
Algorithmica 61 (2), 274-297, 2011
462011
The price of stability for undirected broadcast network design with fair cost allocation is constant
V Bilo, M Flammini, L Moscardelli
Games and Economic Behavior, 2014
362014
Sharing the cost of multicast transmissions in wireless networks
V Bilo, M Flammini, G Melideo, L Moscardelli, A Navarra
Theoretical Computer Science 369 (1-3), 269-284, 2006
322006
On nash equilibria in non-cooperative all-optical networks
V Bilò, M Flammini, L Moscardelli
Annual Symposium on Theoretical Aspects of Computer Science, 448-459, 2005
312005
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
302014
On the Price of Stability of Fractional Hedonic Games.
V Bilò, A Fanelli, M Flammini, G Monaco, L Moscardelli
AAMAS 15, 1239-1247, 2015
282015
Asymptotically optimal solutions for small world graphs
M Flammini, L Moscardelli, A Navarra, S Perennes
International Symposium on Distributed Computing, 414-428, 2005
272005
When ignorance helps: Graphical multicast cost sharing games
V Bilò, A Fanelli, M Flammini, L Moscardelli
Theoretical Computer Science 411 (3), 660-671, 2010
242010
An exponential improvement on the mst heuristic for minimum energy broadcasting in ad hoc wireless networks
I Caragiannis, M Flammini, L Moscardelli
International Colloquium on Automata, Languages, and Programming, 447-458, 2007
242007
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
232018
Approximating the traffic grooming problem
M Flammini, L Moscardelli, M Shalom, S Zaks
International Symposium on Algorithms and Computation, 915-924, 2005
232005
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
222008
The price of anarchy in all-optical networks
V Bilo, L Moscardelli
International Colloquium on Structural Information and Communication …, 2004
222004
Stable outcomes in modified fractional hedonic games
G Monaco, L Moscardelli, Y Velaj
Autonomous Agents and Multi-Agent Systems 34 (1), 4, 2020
192020
Some anomalies of farsighted strategic behavior
V Bilò, M Flammini, G Monaco, L Moscardelli
International Workshop on Approximation and Online Algorithms, 229-241, 2012
192012
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
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20