Luca Moscardelli

Proceedings of the International Symposium on Artificial Intelligence and Mathematics 2022 (ISAIM 2022), 2022

Nash Social Welfare in Selfish and Online Load Balancing.

[BibT_eX]

[DOI]

Proceedings of the 23rd Italian Conference on Theoretical Computer Science, 2022

Hedonic Games with Fixed-Size Coalitions.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

Algorithms, 2021

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

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

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2018

Pricing Problems with Buyer Preselection.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Hedonic Games with Social Context.

[BibT_eX]

[DOI]

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

Uniform Mixed Equilibria in Network Congestion Games with Link Failures.

[BibT_eX]

[DOI]

Cosimo Vinci

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Stable Outcomes in Modified Fractional Hedonic Games.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 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

2016

Opinion Formation Games with Dynamic Social Influences.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 12th International Conference, 2016

2015

Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 11th International Conference, 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

Nash Stability in Fractional Hedonic Games.

[BibT_eX]

[DOI]

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

The Price of Envy-Freeness in Machine Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013

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

[BibT_eX]

[DOI]

SIGecom Exch., 2013

Convergence Issues in Congestion Games.

[BibT_eX]

[DOI]

Bull. EATCS, 2013

On Lookahead Equilibria in Congestion Games.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 9th International Conference, 2013

The Price of Stability for Undirected Broadcast Network Design with Fair Cost Allocation Is Constant.

[BibT_eX]

[DOI]

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

On the Sequential Price of Anarchy of Isolation Games.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012

Some Anomalies of Farsighted Strategic Behavior.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 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

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

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

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems - 15th International Conference, 2011

2010

Designing Fast Converging Cost Sharing Methods for Multicast Transmissions.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2010

Stackelberg Strategies for Network Design Games.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 6th International Workshop, 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

On Best Response Dynamics in Weighted Congestion Games with Polynomial Delays.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

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

[BibT_eX]

[DOI]

Alberto Marchetti-Spaccamela

Shmuel Zaks

Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

Performances of One-Round Walks in Linear Congestion Games.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

On the Performances of Nash Equilibria in Isolation Games.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2008

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

[BibT_eX]

[DOI]

Comput. Networks, 2008

Graphical Congestion Games.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, 4th International Workshop, 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

When Ignorance Helps: Graphical Multicast Cost Sharing Games.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

The Speed of Convergence in Congestion Games under Best-Response Dynamics.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 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

Experimental Evaluations of Algorithms for IP Table Minimization.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

On the convergence of multicast games in directed networks.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

Ioannis Caragiannis

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2006

Sharing the cost of multicast transmissions in wireless networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Approximating the Traffic Grooming Problem in Tree and Star Networks.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 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

Tight Bounds for Selfish and Greedy Load Balancing.

[BibT_eX]

[DOI]

Ioannis Caragiannis

Christos Kaklamanis

Panagiotis Kanellopoulos

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005

Asymptotically Optimal Solutions for Small World Graphs.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 19th International Conference, 2005

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

[BibT_eX]

[DOI]

Proceedings of the STACS 2005, 2005

Approximating the Traffic Grooming Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004

The Price of Anarchy in All-Optical Networks.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2004

On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Pareto Approximations for the Bicriteria Scheduling Problem.

[BibT_eX]

[DOI]