Obserwuj
Luca Moscardelli
Tytuł
Cytowane przez
Cytowane przez
Rok
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
1022006
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
862010
Tight bounds for selfish and greedy load balancing
I Caragiannis, M Flammini, C Kaklamanis, P Kanellopoulos, L Moscardelli
Algorithmica 61 (3), 606-637, 2011
772011
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
752010
Graphical congestion games
V Bilo, A Fanelli, M Flammini, L Moscardelli
Algorithmica 61 (2), 274-297, 2011
472011
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 123, 359-376, 2020
402020
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
392018
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
342014
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
332015
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 Bilo, M Flammini, L Moscardelli
Annual Symposium on Theoretical Aspects of Computer Science, 448-459, 2005
322005
Stable outcomes in modified fractional hedonic games
G Monaco, L Moscardelli, Y Velaj
Autonomous Agents and Multi-Agent Systems 34 (1), 1-29, 2020
302020
Asymptotically optimal solutions for small world graphs
M Flammini, L Moscardelli, A Navarra, S Pérennes
International Symposium on Distributed Computing, 414-428, 2005
272005
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
252008
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
252007
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
The price of anarchy in all-optical networks
V Bilo, L Moscardelli
International Colloquium on Structural Information and Communication …, 2004
242004
Online coalition structure generation in graph games
M Flammini, G Monaco, L Moscardelli, M Shalom, S Zaks
Proceedings of the 17th International Conference on Autonomous Agents and …, 2018
232018
Approximating the traffic grooming problem
M Flammini, L Moscardelli, M Shalom, S Zaks
International Symposium on Algorithms and Computation, 915-924, 2005
222005
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
202011
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20