Gianpiero Monaco

J. Artif. Intell. Res., 2025

Relaxed core stability in hedonic games.

[BibT_eX]

[DOI]

Angelo Fanelli

Artif. Intell., 2025

2024

Digraph k-Coloring Games: New Algorithms and Experiments.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2024

AI for Sustainability: Research at Ud'A Node.

[BibT_eX]

[DOI]

Proceedings of the Ital-IA Intelligenza Artificiale, 2024

Nash Stability in Hedonic Skill Games.

[BibT_eX]

[DOI]

Laurent Gourvès

Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

On Green Sustainability of Resource Selection Games with Equitable Cost-Sharing.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023

Nash Stability in Fractional Hedonic Games with Bounded Size Coalitions.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 19th International Conference, 2023

2022

Digraph k-Coloring Games: From Theory to Practice.

[BibT_eX]

[DOI]

Proceedings of the 20th International Symposium on Experimental Algorithms, 2022

Relaxed Core Stability in Fractional Hedonic Games.

[BibT_eX]

[DOI]

Angelo Fanelli

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]

Vittorio Bilò

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

Strategyproof Mechanisms for Additively Separable and Fractional Hedonic Games.

[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

The Multi-budget Maximum Weighted Coverage Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020

Selfish colorful bin packing games.

[BibT_eX]

[DOI]

J. Comb. Optim., 2020

2019

Coalition Resilient Outcomes in Max k-Cut Games.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

Almost Envy-Free Allocations with Connected Bundles.

[BibT_eX]

[DOI]

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 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

Generalized Budgeted Submodular Set Function Maximization.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 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

Generalized Graph k-Coloring Games.

[BibT_eX]

[DOI]

Raffaello Carosi

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

On Colorful Bin Packing Games.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 24th International Conference, 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

Strategyproof Mechanisms for Additively Separable Hedonic Games and Fractional Hedonic Games.

[BibT_eX]

[DOI]

Qiang Zhang

Proceedings of the Approximation and Online Algorithms - 15th International Workshop, 2017

Budget Feasible Mechanisms on Matroids.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2017

Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems.

[BibT_eX]

[DOI]

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Computing Approximate Pure Nash Equilibria in Digraph k-Coloring Games.

[BibT_eX]

[DOI]

Raffaello Carosi

Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

2015

The ring design game with fair cost allocation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 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

Revenue Maximization Envy-Free Pricing for Homogeneous Resources.

[BibT_eX]

[DOI]

Piotr Sankowski

Qiang Zhang

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 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

Approximating the Revenue Maximization Problem with Sharp Demands.

[BibT_eX]

[DOI]

Vittorio Bilò

Proceedings of the Algorithm Theory - SWAT 2014, 2014

The Price of Envy-Freeness in Machine Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2012

The Ring Design Game with Fair Cost Allocation - [Extended Abstract].

[BibT_eX]

[DOI]

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

2011

Optimizing regenerator cost in traffic grooming.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 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

Improved Lower Bounds on the Price of Stability of Undirected Network Design Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - Third International Symposium, 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 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

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

A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem.

[BibT_eX]

[DOI]

Ioannis Caragiannis