Gianpiero Monaco

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 52

Top Topics

Additively Separable

Coalition Structure Generation

Top Venues

J. Artif. Intell. Res.

Publications

Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Cosimo Vinci
On Green Sustainability of Resource Selection Games with Equitable Cost-Sharing. AAMAS (2024)
Laurent Gourvès, Gianpiero Monaco
Nash Stability in Hedonic Skill Games. AAMAS (2024)
Gianpiero Monaco, Luca Moscardelli
Nash Stability in Fractional Hedonic Games with Bounded Size Coalitions. WINE (2023)
Vittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, William S. Zwicker
Almost envy-free allocations with connected bundles. Games Econ. Behav. 131 (2022)
Vittorio Bilò, Gianpiero Monaco, Luca Moscardelli, Cosimo Vinci
Nash Social Welfare in Selfish and Online Load Balancing. ICTCS (2022)
Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
Pricing Problems with Buyer Preselection. J. Artif. Intell. Res. 74 (2022)
Andrea D'Ascenzo, Mattia D'Emidio, Michele Flammini, Gianpiero Monaco
Digraph k-Coloring Games: From Theory to Practice. SEA (2022)
Cosimo Vinci, Vittorio Bilò, Gianpiero Monaco, Luca Moscardelli
Nash Social Welfare in Selfish and Online Load Balancing. ACM Trans. Economics and Comput. 10 (2) (2022)
Angelo Fanelli, Gianpiero Monaco, Luca Moscardelli
Relaxed Core Stability in Fractional Hedonic Games. ISAIM (2022)
Vittorio Bilò, Gianpiero Monaco, Luca Moscardelli
Hedonic Games with Fixed-Size Coalitions. AAAI (2022)
Gianpiero Monaco, Luca Moscardelli, Yllka Velaj
Additively Separable Hedonic Games with Social Context. Games 12 (3) (2021)
Angelo Fanelli, Gianpiero Monaco, Luca Moscardelli
Relaxed Core Stability in Fractional Hedonic Games. IJCAI (2021)
Stefano Leonardi, Gianpiero Monaco, Piotr Sankowski, Qiang Zhang
Budget Feasible Mechanisms on Matroids. Algorithmica 83 (5) (2021)
Michele Flammini, Bojana Kodric, Gianpiero Monaco, Qiang Zhang
Strategyproof Mechanisms for Additively Separable and Fractional Hedonic Games. J. Artif. Intell. Res. 70 (2021)
Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj
Generalized budgeted submodular set function maximization. Inf. Comput. 281 (2021)
Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions. Distributed Comput. 34 (1) (2021)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
The Traffic Grooming Problem in Optical Networks with Respect to ADMs and OADMs: Complexity and Approximation. Algorithms 14 (5) (2021)
Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj
The Multi-budget Maximum Weighted Coverage Problem. CIAC (2021)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
On the Online Coalition Structure Generation Problem. J. Artif. Intell. Res. 72 (2021)
Vittorio Bilò, Francesco Cellinese, Giovanna Melideo, Gianpiero Monaco
Selfish colorful bin packing games. J. Comb. Optim. 40 (3) (2020)
Gianpiero Monaco, Luca Moscardelli, Yllka Velaj
Stable outcomes in modified fractional hedonic games. Auton. Agents Multi Agent Syst. 34 (1) (2020)
Raffaello Carosi, Gianpiero Monaco
Generalized Graph k-Coloring Games. Theory Comput. Syst. 64 (6) (2020)
Vittorio Bilò, Gianpiero Monaco, Luca Moscardelli, Cosimo Vinci
Nash Social Welfare in Selfish and Online Load Balancing. CoRR (2020)
Vittorio Bilò, Gianpiero Monaco, Luca Moscardelli, Cosimo Vinci
Nash Social Welfare in Selfish and Online Load Balancing. WINE (2020)
Vittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, William S. Zwicker
Almost Envy-Free Allocations with Connected Bundles. ITCS (2019)
Raffaello Carosi, Simone Fioravanti, Luciano Gualà, Gianpiero Monaco
Coalition Resilient Outcomes in Max k-Cut Games. SOFSEM (2019)
Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
Optimality and Nash Stability in Additive Separable Generalized Group Activity Selection Problems. IJCAI (2019)
Raffaello Carosi, Gianpiero Monaco, Luca Moscardelli
Local Core Stability in Simple Symmetric Fractional Hedonic Games. AAMAS (2019)
Gianpiero Monaco, Luca Moscardelli, Yllka Velaj
On the Performance of Stable Outcomes in Modified Fractional Hedonic Games with Egalitarian Social Welfare. AAMAS (2019)
Raffaello Carosi, Simone Fioravanti, Luciano Gualà, Gianpiero Monaco
Coalition Resilient Outcomes in Max k-Cut Games. CoRR (2018)
Vittorio Bilò, Francesco Cellinese, Giovanna Melideo, Gianpiero Monaco
On Colorful Bin Packing Games. COCOON (2018)
Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj
Generalized Budgeted Submodular Set Function Maximization. MFCS (2018)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
Online Coalition Structure Generation in Graph Games. AAMAS (2018)
Gianpiero Monaco, Luca Moscardelli, Yllka Velaj
Stable Outcomes in Modified Fractional Hedonic Games. CoRR (2018)
Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj
Generalized budgeted submodular set function maximization. CoRR (2018)
Gianpiero Monaco, Luca Moscardelli, Yllka Velaj
Stable Outcomes in Modified Fractional Hedonic Games. AAMAS (2018)
Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
On the Impact of Buyers Preselection in Pricing Problems. AAMAS (2018)
Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
Pricing Problems with Buyer Preselection. MFCS (2018)
Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
Nash Stable Outcomes in Fractional Hedonic Games: Existence, Efficiency and Computation. J. Artif. Intell. Res. 62 (2018)
Gianpiero Monaco, Luca Moscardelli, Yllka Velaj
Hedonic Games with Social Context. ICTCS (2018)
Vittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, William S. Zwicker
Almost Envy-Free Allocations with Connected Bundles. CoRR (2018)
Raffaello Carosi, Gianpiero Monaco
Generalized Graph k-Coloring Games. COCOON (2018)
Michele Flammini, Vasco Gallotti, Giovanna Melideo, Gianpiero Monaco, Luca Moscardelli
Network Movement Games. Theor. Comput. Sci. 667 (2017)
Michele Flammini, Gianpiero Monaco, Qiang Zhang
Strategyproof Mechanisms for Additively Separable Hedonic Games and Fractional Hedonic Games. CoRR (2017)
Michele Flammini, Gianpiero Monaco, Qiang Zhang
Strategyproof Mechanisms for Additively Separable Hedonic Games and Fractional Hedonic Games. WAOA (2017)
Vittorio Bilò, Francesco Cellinese, Giovanna Melideo, Gianpiero Monaco
On Colorful Bin Packing Games. CoRR (2017)
Stefano Leonardi, Gianpiero Monaco, Piotr Sankowski, Qiang Zhang
Budget Feasible Mechanisms on Matroids. IPCO (2017)
Vittorio Bilò, Michele Flammini, Gianpiero Monaco
Approximating the revenue maximization problem with sharp demands. Theor. Comput. Sci. 662 (2017)
Vittorio Bilò, Ioannis Caragiannis, Angelo Fanelli, Michele Flammini, Gianpiero Monaco
Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems. ICALP (2017)
Raffaello Carosi, Michele Flammini, Gianpiero Monaco
Computing Approximate Pure Nash Equilibria in Digraph k-Coloring Games. AAMAS (2017)
Stefano Leonardi, Gianpiero Monaco, Piotr Sankowski, Qiang Zhang
Budget Feasible Mechanisms on Matroids. CoRR (2016)
Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
The price of envy-freeness in machine scheduling. Theor. Comput. Sci. 613 (2016)
Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
On the Price of Stability of Fractional Hedonic Games. AAMAS (2015)
Angelo Fanelli, Dariusz Leniowski, Gianpiero Monaco, Piotr Sankowski
The ring design game with fair cost allocation. Theor. Comput. Sci. 562 (2015)
Gianpiero Monaco, Piotr Sankowski, Qiang Zhang
Revenue Maximization Envy-Free Pricing for Homogeneous Resources. IJCAI (2015)
Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
Some Anomalies of Farsighted Strategic Behavior. Theory Comput. Syst. 56 (1) (2015)
Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions. WINE (2015)
Vittorio Bilò, Michele Flammini, Gianpiero Monaco
Approximating the Revenue Maximization Problem with Sharp Demands. SWAT (2014)
Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
The Price of Envy-Freeness in Machine Scheduling. MFCS (2) (2014)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming. Algorithmica 68 (3) (2014)
Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
Nash Stability in Fractional Hedonic Games. WINE (2014)
Ioannis Caragiannis, Gianpiero Monaco
A 6/5-approximation algorithm for the maximum 3-cover problem. J. Comb. Optim. 25 (1) (2013)
Vittorio Bilò, Ioannis Caragiannis, Angelo Fanelli, Gianpiero Monaco
Improved Lower Bounds on the Price of Stability of Undirected Network Design Games. Theory Comput. Syst. 52 (4) (2013)
Vittorio Bilò, Michele Flammini, Gianpiero Monaco
Approximating the Revenue Maximization Problem with Sharp Demands. CoRR (2013)
Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
Some Anomalies of Farsighted Strategic Behavior. WAOA (2012)
Angelo Fanelli, Dariusz Leniowski, Gianpiero Monaco, Piotr Sankowski
The Ring Design Game with Fair Cost Allocation - [Extended Abstract]. WINE (2012)
Michele Flammini, Vasco Gallotti, Giovanna Melideo, Gianpiero Monaco, Luca Moscardelli
Mobile Network Creation Games. SIROCCO (2012)
Michele Flammini, Alberto Marchetti-Spaccamela, Gianpiero Monaco, Luca Moscardelli, Shmuel Zaks
On the complexity of the regenerator placement problem in optical networks. IEEE/ACM Trans. Netw. 19 (2) (2011)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming. OPODIS (2011)
Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
On the performances of Nash equilibria in isolation games. J. Comb. Optim. 22 (3) (2011)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
Optimizing regenerator cost in traffic grooming. Theor. Comput. Sci. 412 (52) (2011)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks
Minimizing total busy time in parallel scheduling with application to optical networks. Theor. Comput. Sci. 411 (40-42) (2010)
Vittorio Bilò, Ioannis Caragiannis, Angelo Fanelli, Gianpiero Monaco
Improved Lower Bounds on the Price of Stability of Undirected Network Design Games. SAGT (2010)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
Optimizing Regenerator Cost in Traffic Grooming - (Extended Abstract). OPODIS (2010)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks
Minimizing total busy time in parallel scheduling with application to optical networks. IPDPS (2009)
Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
On the Performances of Nash Equilibria in Isolation Games. COCOON (2009)
Michele Flammini, Alberto Marchetti-Spaccamela, Gianpiero Monaco, Luca Moscardelli, Shmuel Zaks
On the complexity of the regenerator placement problem in optical networks. SPAA (2009)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
Approximating the traffic grooming problem in tree and star networks. J. Parallel Distributed Comput. 68 (7) (2008)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs. Euro-Par (2008)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
Selfishness, collusion and power of local search for the ADMs minimization problem. Comput. Networks 52 (9) (2008)
Ioannis Caragiannis, Gianpiero Monaco
A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem. MFCS (2008)
Stefania Di Giannantonio, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem. WINE (2007)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
Approximating the Traffic Grooming Problem in Tree and Star Networks. WG (2006)