Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem. - Stefania Di Giannantonio; Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Mordechai Shalom; Shmuel Zaks (WINE, 2007)

Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs. - Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Mordechai Shalom; Shmuel Zaks (Euro-Par, 2008)

Selfishness, collusion and power of local search for the ADMs minimization problem. - Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Mordechai Shalom; Shmuel Zaks (Comput. Networks, 2008)

Approximating the traffic grooming problem in tree and star networks. - Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Mordechai Shalom; Shmuel Zaks (J. Parallel Distributed Comput., 2008)

Game-Theoretic Approaches to Optimization Problems in Communication Networks. - Vittorio Bilò; Ioannis Caragiannis; Angelo Fanelli 001; Michele Flammini; Christos Kaklamanis; Gianpiero Monaco; Luca Moscardelli (Graphs and Algorithms in Communication Networks, 2010)

Traffic Grooming: Combinatorial Results and Practical Resolutions. - Tibor Cinkler; David Coudert; Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Xavier Muñoz; Ignasi Sau; Mordechai Shalom; Shmuel Zaks (Graphs and Algorithms in Communication Networks, 2010)

Optimizing Regenerator Cost in Traffic Grooming - (Extended Abstract). - Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Mordechai Shalom; Shmuel Zaks (OPODIS, 2010)

Minimizing total busy time in parallel scheduling with application to optical networks. - Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Hadas Shachnai; Mordechai Shalom; Tami Tamir; Shmuel Zaks (Theor. Comput. Sci., 2010)

On the performances of Nash equilibria in isolation games. - Vittorio Bilò; Michele Flammini; Gianpiero Monaco; Luca Moscardelli (J. Comb. Optim., 2011)

Optimizing regenerator cost in traffic grooming. - Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Mordechai Shalom; Shmuel Zaks (Theor. Comput. Sci., 2011)

On the complexity of the regenerator placement problem in optical networks. - Michele Flammini; Alberto Marchetti-Spaccamela; Gianpiero Monaco; Luca Moscardelli; Shmuel Zaks (IEEE/ACM Trans. Netw., 2011)

Mobile Network Creation Games. - Michele Flammini; Vasco Gallotti; Giovanna Melideo; Gianpiero Monaco; Luca Moscardelli (SIROCCO, 2012)

The Ring Design Game with Fair Cost Allocation - [Extended Abstract]. - Angelo Fanelli 001; Dariusz Leniowski; Gianpiero Monaco; Piotr Sankowski (WINE, 2012)

A 6/5-approximation algorithm for the maximum 3-cover problem. - Ioannis Caragiannis; Gianpiero Monaco (J. Comb. Optim., 2013)

Improved Lower Bounds on the Price of Stability of Undirected Network Design Games. - Vittorio Bilò; Ioannis Caragiannis; Angelo Fanelli 001; Gianpiero Monaco (Theory Comput. Syst., 2013)

Nash Stability in Fractional Hedonic Games. - Vittorio Bilò; Angelo Fanelli 001; Michele Flammini; Gianpiero Monaco; Luca Moscardelli (WINE, 2014)

On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming. - Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Mordechai Shalom; Shmuel Zaks (Algorithmica, 2014)

On the Price of Stability of Fractional Hedonic Games. - Vittorio Bilò; Angelo Fanelli 001; Michele Flammini; Gianpiero Monaco; Luca Moscardelli (AAMAS, 2015)

Revenue Maximization Envy-Free Pricing for Homogeneous Resources. - Gianpiero Monaco; Piotr Sankowski; Qiang Zhang (IJCAI, 2015)

Some Anomalies of Farsighted Strategic Behavior. - Vittorio Bilò; Michele Flammini; Gianpiero Monaco; Luca Moscardelli (Theory Comput. Syst., 2015)

The ring design game with fair cost allocation. - Angelo Fanelli 001; Dariusz Leniowski; Gianpiero Monaco; Piotr Sankowski (Theor. Comput. Sci., 2015)

The price of envy-freeness in machine scheduling. - Vittorio Bilò; Angelo Fanelli 001; Michele Flammini; Gianpiero Monaco; Luca Moscardelli (Theor. Comput. Sci., 2016)

Computing Approximate Pure Nash Equilibria in Digraph k-Coloring Games. - Raffaello Carosi; Michele Flammini; Gianpiero Monaco (AAMAS, 2017)

Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems. - Vittorio Bilò; Ioannis Caragiannis; Angelo Fanelli 001; Michele Flammini; Gianpiero Monaco (ICALP, 2017)

Strategyproof Mechanisms for Additively Separable Hedonic Games and Fractional Hedonic Games. - Michele Flammini; Gianpiero Monaco; Qiang Zhang (WAOA, 2017)

Approximating the revenue maximization problem with sharp demands. - Vittorio Bilò; Michele Flammini; Gianpiero Monaco (Theor. Comput. Sci., 2017)

Network Movement Games. - Michele Flammini; Vasco Gallotti; Giovanna Melideo; Gianpiero Monaco; Luca Moscardelli (Theor. Comput. Sci., 2017)

On the Impact of Buyers Preselection in Pricing Problems. - Vittorio Bilò; Michele Flammini; Gianpiero Monaco; Luca Moscardelli (AAMAS, 2018)

Online Coalition Structure Generation in Graph Games. - Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Mordechai Shalom; Shmuel Zaks (AAMAS, 2018)

On Colorful Bin Packing Games. - Vittorio Bilò; Francesco Cellinese; Giovanna Melideo; Gianpiero Monaco (COCOON, 2018)

Hedonic Games with Social Context. - Gianpiero Monaco; Luca Moscardelli; Yllka Velaj (ICTCS, 2018)

Nash Stable Outcomes in Fractional Hedonic Games: Existence, Efficiency and Computation. - Vittorio Bilò; Angelo Fanelli 001; Michele Flammini; Gianpiero Monaco; Luca Moscardelli (J. Artif. Intell. Res., 2018)

Local Core Stability in Simple Symmetric Fractional Hedonic Games. - Raffaello Carosi; Gianpiero Monaco; Luca Moscardelli (AAMAS, 2019)

On the Performance of Stable Outcomes in Modified Fractional Hedonic Games with Egalitarian Social Welfare. - Gianpiero Monaco; Luca Moscardelli; Yllka Velaj (AAMAS, 2019)

Optimality and Nash Stability in Additive Separable Generalized Group Activity Selection Problems. - Vittorio Bilò; Angelo Fanelli 001; Michele Flammini; Gianpiero Monaco; Luca Moscardelli (IJCAI, 2019)

Coalition Resilient Outcomes in Max k-Cut Games. - Raffaello Carosi; Simone Fioravanti; Luciano Gualà; Gianpiero Monaco (SOFSEM, 2019)

Stable outcomes in modified fractional hedonic games. - Gianpiero Monaco; Luca Moscardelli; Yllka Velaj (Auton. Agents Multi Agent Syst., 2020)

Selfish colorful bin packing games. - Vittorio Bilò; Francesco Cellinese; Giovanna Melideo; Gianpiero Monaco (J. Comb. Optim., 2020)

Generalized Graph k-Coloring Games. - Raffaello Carosi; Gianpiero Monaco (Theory Comput. Syst., 2020)

The Multi-budget Maximum Weighted Coverage Problem. - Francesco Cellinese; Gianlorenzo D'Angelo; Gianpiero Monaco; Yllka Velaj (CIAC, 2021)

Relaxed Core Stability in Fractional Hedonic Games. - Angelo Fanelli 001; Gianpiero Monaco; Luca Moscardelli (IJCAI, 2021)

Budget Feasible Mechanisms on Matroids. - Stefano Leonardi 001; Gianpiero Monaco; Piotr Sankowski; Qiang Zhang (Algorithmica, 2021)

The Traffic Grooming Problem in Optical Networks with Respect to ADMs and OADMs: Complexity and Approximation. - Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Mordechai Shalom; Shmuel Zaks (Algorithms, 2021)

Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions. - Vittorio Bilò; Michele Flammini; Gianpiero Monaco; Luca Moscardelli (Distributed Comput., 2021)

Additively Separable Hedonic Games with Social Context. - Gianpiero Monaco; Luca Moscardelli; Yllka Velaj (Games, 2021)

Generalized budgeted submodular set function maximization. - Francesco Cellinese; Gianlorenzo D'Angelo; Gianpiero Monaco; Yllka Velaj (Inf. Comput., 2021)

Strategyproof Mechanisms for Additively Separable and Fractional Hedonic Games. - Michele Flammini; Bojana Kodric; Gianpiero Monaco; Qiang Zhang (J. Artif. Intell. Res., 2021)

On the Online Coalition Structure Generation Problem. - Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Mordechai Shalom; Shmuel Zaks (J. Artif. Intell. Res., 2021)

Hedonic Games with Fixed-Size Coalitions. - Vittorio Bilò; Gianpiero Monaco; Luca Moscardelli (AAAI, 2022)

Digraph k-Coloring Games: From Theory to Practice. - Andrea D'Ascenzo; Mattia D'Emidio; Michele Flammini; Gianpiero Monaco (SEA, 2022)

Almost envy-free allocations with connected bundles. - Vittorio Bilò; Ioannis Caragiannis; Michele Flammini; Ayumi Igarashi 001; Gianpiero Monaco; Dominik Peters; Cosimo Vinci; William S. Zwicker (Games Econ. Behav., 2022)

Pricing Problems with Buyer Preselection. - Vittorio Bilò; Michele Flammini; Gianpiero Monaco; Luca Moscardelli (J. Artif. Intell. Res., 2022)

Nash Social Welfare in Selfish and Online Load Balancing. - Cosimo Vinci; Vittorio Bilò; Gianpiero Monaco; Luca Moscardelli (ACM Trans. Economics and Comput., 2022)

Nash Stability in Fractional Hedonic Games with Bounded Size Coalitions. - Gianpiero Monaco; Luca Moscardelli (WINE, 2023)

On Green Sustainability of Resource Selection Games with Equitable Cost-Sharing. - Vittorio Bilò; Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Cosimo Vinci (AAMAS, 2024)

Nash Stability in Hedonic Skill Games. - Laurent Gourvès; Gianpiero Monaco (AAMAS, 2024)

AI for Sustainability: Research at Ud'A Node. - Gianluca Amato; Alessia Amelio; Luciano Caroprese; Piero Chiacchiaretta; Fabio Fioravanti; Luigi Ippoliti; Maria Chiara Meo; Gianpiero Monaco; Christian Morbidoni; Luca Moscardelli; Maurizio Parton; Francesca Scozzari (Ital-IA, 2024)

Digraph k-Coloring Games: New Algorithms and Experiments. - Andrea D'Ascenzo; Mattia D'Emidio; Michele Flammini; Gianpiero Monaco (J. Artif. Intell. Res., 2024)

Relaxed core stability in hedonic games. - Angelo Fanelli 001; Gianpiero Monaco; Luca Moscardelli (Artif. Intell., 2025)

Existence, Computation and Efficiency of Nash Stable Outcomes in Hedonic Skill Games. - Laurent Gourvès; Gianpiero Monaco (J. Artif. Intell. Res., 2025)