Gianpiero Monaco

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

Nash Social Welfare in Selfish and Online Load Balancing.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2022

Pricing Problems with Buyer Preselection.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2022

Almost envy-free allocations with connected bundles.

[BibT_eX]

[DOI]

Games Econ. Behav., 2022

Digraph k-Coloring Games: From Theory to Practice.

[BibT_eX]

[DOI]

Proceedings of the 20th International Symposium on Experimental Algorithms, 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

Generalized budgeted submodular set function maximization.

[BibT_eX]

[DOI]

Inf. Comput., 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

Budget Feasible Mechanisms on Matroids.

[BibT_eX]

[DOI]

Algorithmica, 2021

Relaxed Core Stability in Fractional Hedonic Games.

[BibT_eX]

[DOI]

Angelo Fanelli

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

The Multi-budget Maximum Weighted Coverage Problem.

[BibT_eX]

[DOI]

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

2020

Generalized Graph k-Coloring Games.

[BibT_eX]

[DOI]

Raffaello Carosi

Theory Comput. Syst., 2020

Selfish colorful bin packing games.

[BibT_eX]

[DOI]

J. Comb. Optim., 2020

Stable outcomes in modified fractional hedonic games.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 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

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

Hedonic Games with Social Context.

[BibT_eX]

[DOI]

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

On Colorful Bin Packing Games.

[BibT_eX]

[DOI]

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

Approximating the revenue maximization problem with sharp demands.

[BibT_eX]

[DOI]

Vittorio Bilò

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

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

2016

The price of envy-freeness in machine scheduling.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

2015

The ring design game with fair cost allocation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Some Anomalies of Farsighted Strategic Behavior.

[BibT_eX]

[DOI]

Theory Comput. Syst., 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

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

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

[BibT_eX]

[DOI]

Theory Comput. Syst., 2013

A 6/5-approximation algorithm for the maximum 3-cover problem.

[BibT_eX]

[DOI]

Ioannis Caragiannis

J. Comb. Optim., 2013

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

Mobile Network Creation Games.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2012

2011

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

[BibT_eX]

[DOI]

Alberto Marchetti-Spaccamela