Luca Moscardelli

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

On the Online Coalition Structure Generation Problem.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2021

Additively Separable Hedonic Games with Social Context.

[BibT_eX]

[DOI]

Games, 2021

Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions.

[BibT_eX]

[DOI]

Distributed Comput., 2021

The Traffic Grooming Problem in Optical Networks with Respect to ADMs and OADMs: Complexity and Approximation.

[BibT_eX]

[DOI]

Algorithms, 2021

On Nash Equilibria in Non-Cooperative All-Optical Networks.

[BibT_eX]

[DOI]

Algorithms, 2021

Relaxed Core Stability in Fractional Hedonic Games.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

2020

The price of stability for undirected broadcast network design with fair cost allocation is constant.

[BibT_eX]

[DOI]

Games Econ. Behav., 2020

Stable outcomes in modified fractional hedonic games.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2020

2019

Optimality and Nash Stability in Additive Separable Generalized Group Activity Selection Problems.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

On the Performance of Stable Outcomes in Modified Fractional Hedonic Games with Egalitarian Social Welfare.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

Local Core Stability in Simple Symmetric Fractional Hedonic Games.

[BibT_eX]

[DOI]

Raffaello Carosi

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018

Opinion formation games with dynamic social influences.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Nash Stable Outcomes in Fractional Hedonic Games: Existence, Efficiency and Computation.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2018

Hedonic Games with Social Context.

[BibT_eX]

[DOI]

Proceedings of the 19th Italian Conference on Theoretical Computer Science, 2018

Online Coalition Structure Generation in Graph Games.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

On the Impact of Buyers Preselection in Pricing Problems.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017

Network Movement Games.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

On lookahead equilibria in congestion games.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2017

2016

The price of envy-freeness in machine scheduling.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

2015

Some Anomalies of Farsighted Strategic Behavior.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2015

On the sequential price of anarchy of isolation games.

[BibT_eX]

[DOI]

J. Comb. Optim., 2015

On the Price of Stability of Fractional Hedonic Games.

[BibT_eX]

[DOI]

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014

On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming.

[BibT_eX]

[DOI]

Algorithmica, 2014

Nash Stability in Fractional Hedonic Games.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 10th International Conference, 2014

2013

An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks.

[BibT_eX]

[DOI]

Ioannis Caragiannis

IEEE/ACM Trans. Netw., 2013

The price of stability of fair undirected broadcast games is constant.

[BibT_eX]

[DOI]

SIGecom Exch., 2013

Stackelberg Strategies for Network Design Games.

[BibT_eX]

[DOI]

Internet Math., 2013

Convergence Issues in Congestion Games.

[BibT_eX]

[DOI]

Bull. EATCS, 2013

2012

The speed of convergence in congestion games under best-response dynamics.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2012

Mobile Network Creation Games.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2012

On the Impact of Fair Best Response Dynamics.

[BibT_eX]

[DOI]

Alexander Skopalik

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011

On the complexity of the regenerator placement problem in optical networks.

[BibT_eX]

[DOI]

Alberto Marchetti-Spaccamela

Shmuel Zaks

IEEE/ACM Trans. Netw., 2011

Optimizing regenerator cost in traffic grooming.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Performance of One-Round Walks in Linear Congestion Games.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2011

Experimental Evaluations of Algorithms for IP Table Minimization.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2011

On the performances of Nash equilibria in isolation games.

[BibT_eX]

[DOI]

J. Comb. Optim., 2011

On best response dynamics in weighted congestion games with polynomial delays.

[BibT_eX]

[DOI]

Distributed Comput., 2011

Tight Bounds for Selfish and Greedy Load Balancing.

[BibT_eX]

[DOI]

Ioannis Caragiannis

Christos Kaklamanis

Panagiotis Kanellopoulos

Algorithmica, 2011

Graphical Congestion Games.

[BibT_eX]

[DOI]

Algorithmica, 2011

2010

Minimizing total busy time in parallel scheduling with application to optical networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

When ignorance helps: Graphical multicast cost sharing games.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Designing Fast Converging Cost Sharing Methods for Multicast Transmissions.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2010

On the Convergence of Multicast Games in Directed Networks.

[BibT_eX]

[DOI]

Algorithmica, 2010

Optimizing Regenerator Cost in Traffic Grooming - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

Traffic Grooming: Combinatorial Results and Practical Resolutions.

[BibT_eX]

[DOI]

Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

Game-Theoretic Approaches to Optimization Problems in Communication Networks.

[BibT_eX]

[DOI]

Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

2009

Performances of One-Round Walks in Linear Congestion Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009

2008

On Nash equilibria for multicast transmissions in ad-hoc wireless networks.

[BibT_eX]

[DOI]

Wirel. Networks, 2008

Asymptotically Optimal Solutions for Small World Graphs.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2008

Approximating the traffic grooming problem in tree and star networks.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2008

Approximating the traffic grooming problem.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2008

Selfishness, collusion and power of local search for the ADMs minimization problem.

[BibT_eX]

[DOI]

Comput. Networks, 2008

Interference Games in Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Graphical congestion games with linear latencies.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2008, 2008

2007

Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem.

[BibT_eX]

[DOI]

Stefania Di Giannantonio

Proceedings of the Internet and Network Economics, Third International Workshop, 2007

2006

Sharing the cost of multicast transmissions in wireless networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Pareto approximations for the bicriteria scheduling problem.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2006

Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

2004

The Price of Anarchy in All-Optical Networks.

[BibT_eX]

[DOI]