Gianpiero Monaco

Orcid: 0000-0002-0998-5649

According to our database1, Gianpiero Monaco authored at least 54 papers between 2007 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Nash Stability in Fractional Hedonic Games with Bounded Size Coalitions.
Proceedings of the Web and Internet Economics - 19th International Conference, 2023

2022
Nash Social Welfare in Selfish and Online Load Balancing.
ACM Trans. Economics and Comput., 2022

Pricing Problems with Buyer Preselection.
J. Artif. Intell. Res., 2022

Almost envy-free allocations with connected bundles.
Games Econ. Behav., 2022

Digraph k-Coloring Games: From Theory to Practice.
Proceedings of the 20th International Symposium on Experimental Algorithms, 2022

Relaxed Core Stability in Fractional Hedonic Games.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics 2022 (ISAIM 2022), 2022

Hedonic Games with Fixed-Size Coalitions.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
On the Online Coalition Structure Generation Problem.
J. Artif. Intell. Res., 2021

Strategyproof Mechanisms for Additively Separable and Fractional Hedonic Games.
J. Artif. Intell. Res., 2021

Generalized budgeted submodular set function maximization.
Inf. Comput., 2021

Additively Separable Hedonic Games with Social Context.
Games, 2021

Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions.
Distributed Comput., 2021

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

Budget Feasible Mechanisms on Matroids.
Algorithmica, 2021

The Multi-budget Maximum Weighted Coverage Problem.
Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020
Generalized Graph k-Coloring Games.
Theory Comput. Syst., 2020

Selfish colorful bin packing games.
J. Comb. Optim., 2020

Stable outcomes in modified fractional hedonic games.
Auton. Agents Multi Agent Syst., 2020

2019
Coalition Resilient Outcomes in Max k-Cut Games.
Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

Optimality and Nash Stability in Additive Separable Generalized Group Activity Selection Problems.
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.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

Local Core Stability in Simple Symmetric Fractional Hedonic Games.
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.
J. Artif. Intell. Res., 2018

Hedonic Games with Social Context.
Proceedings of the 19th Italian Conference on Theoretical Computer Science, 2018

On Colorful Bin Packing Games.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

Online Coalition Structure Generation in Graph Games.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

On the Impact of Buyers Preselection in Pricing Problems.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017
Network Movement Games.
Theor. Comput. Sci., 2017

Approximating the revenue maximization problem with sharp demands.
Theor. Comput. Sci., 2017

Strategyproof Mechanisms for Additively Separable Hedonic Games and Fractional Hedonic Games.
Proceedings of the Approximation and Online Algorithms - 15th International Workshop, 2017

Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Computing Approximate Pure Nash Equilibria in Digraph k-Coloring Games.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

2016
The price of envy-freeness in machine scheduling.
Theor. Comput. Sci., 2016

2015
The ring design game with fair cost allocation.
Theor. Comput. Sci., 2015

Some Anomalies of Farsighted Strategic Behavior.
Theory Comput. Syst., 2015

Revenue Maximization Envy-Free Pricing for Homogeneous Resources.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

On the Price of Stability of Fractional Hedonic Games.
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.
Algorithmica, 2014

Nash Stability in Fractional Hedonic Games.
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.
Theory Comput. Syst., 2013

A 6/5-approximation algorithm for the maximum 3-cover problem.
J. Comb. Optim., 2013

2012
The Ring Design Game with Fair Cost Allocation - [Extended Abstract].
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Mobile Network Creation Games.
Proceedings of the Structural Information and Communication Complexity, 2012

2011
On the complexity of the regenerator placement problem in optical networks.
IEEE/ACM Trans. Netw., 2011

Optimizing regenerator cost in traffic grooming.
Theor. Comput. Sci., 2011

On the performances of Nash equilibria in isolation games.
J. Comb. Optim., 2011

2010
Minimizing total busy time in parallel scheduling with application to optical networks.
Theor. Comput. Sci., 2010

Optimizing Regenerator Cost in Traffic Grooming - (Extended Abstract).
Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

Traffic Grooming: Combinatorial Results and Practical Resolutions.
Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

Game-Theoretic Approaches to Optimization Problems in Communication Networks.
Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

2008
Approximating the traffic grooming problem in tree and star networks.
J. Parallel Distributed Comput., 2008

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

Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs.
Proceedings of the Euro-Par 2008, 2008

2007
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem.
Proceedings of the Internet and Network Economics, Third International Workshop, 2007


  Loading...