Journal publications
-
V. Bilò, M.Flammini, G.Monaco, L.Moscardelli:
Pricing Problems with Buyer Preselection.
Journal of Artificial Intelligence Research, 74:1791-1822, 2022.
-
V. Bilò, G. Monaco, L. Moscardelli, C. Vinci:
Nash Social Welfare in Selfish and Online Load Balancing.
ACM Transactions on Economics and Computation, 10(2):8:1-8:41, 2022.
-
V. Bilò, I. Caragiannis, M. Flammini, A. Igarashi, G. Monaco, D. Peters, C. Vinci, W. S. Zwicker:
Almost Envy-Free Allocations with Connected Bundles.
Games and Economic Behavior, 131:197-221, 2022.
-
M.Flammini, G.Monaco, L.Moscardelli, M.Shalom, S.Zaks:
On the Online Coalition Structure Generation Problem.
Journal of Artificial Intelligence Research, 72:1215-1250, 2021.
-
F. Cellinese, G. D'Angelo, G. Monaco, Y. Velaj:
Generalized budgeted submodular set function maximization.
Information and Computation, 281:104741, 2021.
-
M. Flammini, B. Kodric, G. Monaco, Q. Zhang:
Strategyproof Mechanisms for Additively Separable and Fractional Hedonic Games.
Journal of Artificial Intelligence Research, 70:1253-1279, 2021.
-
G. Monaco, L. Moscardelli, Y. Velaj:
Additively Separable Hedonic Games with Social Context. Games, 12(3):71, 2021.
-
M.Flammini, G.Monaco, L.Moscardelli, M.Shalom, S.Zaks:
The Traffic Grooming Problem in Optical Networks with Respect to ADMs and OADMs: Complexity and
Approximation.
Algorithms, 14(5):151, 2021.
-
S. Leonardi, G. Monaco, P. Sankowski, Q. Zhang:
Budget Feasible Mechanisms on Matroids.
Algorithmica, 83(5):1222-1237, 2021.
-
V. Bilò, M. Flammini, G. Monaco, L. Moscardelli:
Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions.
Distributed Computing, 34(1):1-14, 2021.
-
V. Bilò, F. Cellinese, G. Melideo, G. Monaco:
Selfish Colorful Bin Packing Games.
Journal of Combinatorial Optimization, 40:610-635, 2020.
-
G. Monaco, L. Moscardelli, Y. Velaj:
Stable Outcomes in Modified Fractional Hedonic Games.
Autonomous Agents and Multi-Agent Systems, 34(1):4, 2020.
-
R. Carosi, G. Monaco:
Generalized Graph k-Coloring Games.
Theory of Computing Systems, 64(6):1028-1041, 2020.
-
V. Bilò, A. Fanelli, M. Flammini, G. Monaco, L. Moscardelli:
Nash Stable Outcomes in Fractional Hedonic Games: Existence, Efficiency and Computation.
Journal of Artificial Intelligence Research, 62:315-371, 2018.
-
M. Flammini, V. Gallotti, G. Melideo, G. Monaco, L. Moscardelli:
Network Movement Games.
Theoretical Computer Science, 667:101-118, 2017.
-
V. Bilò, M. Flammini, G. Monaco:
Approximating the Revenue Maximization Problem with Sharp Demands.
Theoretical Computer Science, 662:9-30, 2017.
-
V. Bilò, A. Fanelli, M. Flammini, G. Monaco, L. Moscardelli:
The Price of Envy-Freeness in Machine Scheduling.
Theoretical Computer Science, 613:65-78, 2016.
-
A. Fanelli, D. Leniowski, G. Monaco, P. Sankowski:
The ring design game with fair cost allocation.
Theoretical Computer Science, 562:90-100, 2015.
-
V. Bilò, M. Flammini, G. Monaco, L. Moscardelli:
Some Anomalies of Farsighted Strategic Behavior.
Theory of Computing Systems, 56(1):156-180, 2015.
-
M.Flammini, G.Monaco, L.Moscardelli, M.Shalom, S.Zaks:
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming.
Algorithmica, 68(3):671-691, 2014.
-
I. Caragiannis, G. Monaco:
A 6/5-approximation algorithm for the maximum 3-cover problem.
Journal of Combinatorial Optimization, 25(1):60-77, 2013.
-
V. Bilò, I. Caragiannis, A. Fanelli, G. Monaco:
Improved lower bounds on the price of stability of undirected network design games.
Theory of Computing System, 52(4):668-686, 2013.
-
M.Flammini, G.Monaco, L.Moscardelli, M.Shalom, S.Zaks:
Optimizing Regenerator Cost in Traffic Grooming.
Theoretical Computer Science, 412(52):7109-7121, 2011.
-
M. Flammini, A. Marchetti Spaccamela, G. Monaco, L. Moscardelli, S. Zaks:
On the Complexity of the Regenerator Placement Problem in Optical Networks.
IEEE/ACM Transactions on Networking, 19(2):498-511, 2011.
-
V. Bilò, M. Flammini, G. Monaco, L. Moscardelli:
On the performances of Nash Equilibria in Isolation Games.
Journal of Combinatorial Optimization, 22(3):378-391, 2011.
-
M. Flammini, G. Monaco, L. Moscardelli, H. Shachnai, M. Shalom,
T. Tamir, S. Zaks: Minimizing total busy time in parallel scheduling with application to optical
networks, Theoretical Computer Science, 411(40-42):3553-3562, 2010.
-
M.Flammini, G.Monaco, L.Moscardelli, M.Shalom, S.Zaks:
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem.
Computer Networks, 52(9):1721-1731, 2008.
-
M.Flammini, G.Monaco, L.Moscardelli, M.Shalom, S.Zaks:
Approximating the traffic grooming problem in tree and star networks.
Journal of Parallel and Distributed Computing, 68(7):939-948, 2008.
Book chapters
-
V. Bilò, I. Caragiannis, A. Fanelli, M. Flammini, C. Kaklamanis, G. Monaco, L. Moscardelli:
Game-Theoretic Approaches to Optimization Problems in Communication Networks.
Chapter in Graphs and Algorithms in Communication Networks, Springer-Verlag, 2010.
-
T. Cinkler, D. Coudert, M. Flammini, G. Monaco, L. Moscardelli, X. Muñoz, I. Sau Valls, M. Shalom, S. Zaks:
Traffic Grooming: Combinatorial Results and Practical Resolutions.
Chapter in Graphs and Algorithms in Communication Networks, Springer-Verlag, 2010.
Conference publications
-
G. Monaco, L. Moscardelli:
Nash Stability in Fractional Hedonic Games with Bounded Size Coalitions.
In Proceedings of the 19th Conference on Web and Internet Economics (WINE 2023). To appear.
-
A. D'Ascenzo, M. D'Emidio, M. Flammini, G. Monaco:
Digraph k-Coloring Games: from Theory to Practice.
In Proceedings of the 20th Symposium on Experimental Algorithms (SEA 2022).
-
V. Bilò, G. Monaco, L. Moscardelli:
Hedonic Games with Fixed-Size Coalitions.
In Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence (AAAI 2022).
-
A. Fanelli, G. Monaco, L. Moscardelli: Relaxed Core Stability in Fractional Hedonic Games.
In Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI 2021).
-
F. Cellinese, G. D'Angelo, G. Monaco, Y. Velaj: The Multi-Budget Maximum Weighted Coverage Problem.
In Proceedings of the 12th International Conference on Algorithms and Complexity (CIAC 2021).
-
V. Bilò, G. Monaco, L. Moscardelli, C. Vinci:
Nash Social Welfare in Selfish and Online Load Balancing.
In Proceedings of the 16th Conference on Web and Internet Economics (WINE 2020).
-
V. Bilò, A. Fanelli, M. Flammini, G. Monaco, L. Moscardelli:
Optimality and Nash Stability in Additive Separable Generalized Group Activity Selection Problems.
In Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI 2019).
-
R. Carosi, G. Monaco, L. Moscardelli:
Local Core Stability in Simple Symmetric Fractional Hedonic Games.
In Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2019).
-
G. Monaco, L. Moscardelli, Y. Velaj:
On the Performance of Stable Outcomes in Modified Fractional Hedonic Games with Egalitarian Social Welfare.
In Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2019).
-
V. Bilò, I. Caragiannis, M. Flammini, A. Igarashi, G. Monaco, D. Peters, C. Vinci, W.S. Zwicker: Almost Envy-Free Allocations with Connected Bundles.
In Proceedings of the 10th Innovations in Theoretical Computer Science (ITCS 2019).
-
R. Carosi, S. Fioravanti, L. Gualà, G. Monaco: Coalition Resilient Outcomes in Max k-Cut Games.
In Proceedings of the 45th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2019).
-
F. Cellinese, G. D'Angelo, G. Monaco, Y. Velaj: Generalized budgeted submodular set function maximization.
In Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018).
-
V. Bilò, M. Flammini, G. Monaco, L. Moscardelli: Pricing Problems with Buyer Preselection.
In Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018).
-
G. Monaco, L. Moscardelli, Y. Velaj: Hedonic Games with Social Context.
In Proceedings of 19th Italian Conference on Theoretical Computer Science (ICTCS 2018).
-
R. Carosi, G. Monaco: Generalized Graph k-Coloring Games.
In Proceedings of the 24th International Computing and Combinatorics Conference (COCOON 2018).
-
V. Bilò, F. Cellinese, G. Melideo, G. Monaco: On Colorful Bin Packing Games.
In Proceedings of the 24th International Computing and Combinatorics Conference (COCOON 2018).
-
G. Monaco, L. Moscardelli, Y. Velaj:
Stable Outcomes in Modified Fractional Hedonic Games.
In Proceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2018).
-
M. Flammini, G. Monaco, L. Moscardelli, M.Shalom, S.Zaks:
Online Coalition Structure Generation in Graph Games.
In Proceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2018).
-
V. Bilò, M. Flammini, G. Monaco, L. Moscardelli:
On the Impact of Buyers Preselection in Pricing Problems (Extended Abstract).
In Proceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2018).
-
M. Flammini, G. Monaco, Q. Zhang:
Strategyproof Mechanisms for Additively Separable Hedonic Games and Fractional Hedonic Games.
In Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA 2017).
-
V. Bilò, I. Caragiannis, A. Fanelli, M. Flammini, G. Monaco:
Simple greedy algorithms for fundamental multidimensional graph problems.
In Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017).
-
S. Leonardi, G. Monaco, P. Sankowski, Q. Zhang:
Budget Feasible Mechanisms on Matroids.
In Proceedings of the 19th Conference on Integer Programming and Combinatorial Optimization (IPCO 2017).
-
R. Carosi, M. Flammini, G. Monaco:
Computing Approximate Pure Nash Equilibria in Digraph k-Coloring Games.
In Proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2017).
-
V. Bilò, M. Flammini, G. Monaco, L. Moscardelli:
Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions.
In Proceedings of the 11th Conference on Web and Internet Economics (WINE 2015).
-
G. Monaco, P. Sankowski, Q. Zhang:
Revenue Maximization Envy-free Pricing for Homogeneous Resources.
In Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015).
-
V. Bilò, A. Fanelli, M. Flammini, G. Monaco, L. Moscardelli:
On the Price of Stability of Fractional Hedonic Games.
In Proceedings of the 14th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2015).
-
V. Bilò, A. Fanelli, M. Flammini, G. Monaco, L. Moscardelli:
Nash Stability in Fractional Hedonic Games.
In Proceedings of the 10th Conference on Web and Internet Economics (WINE 2014).
-
V. Bilò, A. Fanelli, M. Flammini, G. Monaco, L. Moscardelli:
The Price of Envy-Freeness in Machine Scheduling.
In Proceedings of the 39th International Symposium on
Mathematical Foundations of Computer Science
(MFCS 2014).
-
V. Bilò, M. Flammini, G. Monaco:
Approximating the Revenue Maximization Problem with Sharp Demands.
In Proceedings of the 14th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2014).
-
A. Fanelli, D. Leniowski, G. Monaco, P. Sankowski:
The ring design game with fair cost allocation.
In Proceedings of the 8th International Workshop On Internet And Network Economics (WINE 2012).
-
V. Bilò, M.Flammini, G.Monaco, L.Moscardelli:
Some Anomalies of Farsighted Strategic Behavior.
In Proceedings of the 10th Workshop on Approximation and Online Algorithms (WAOA 2012).
-
M. Flammini, V. Gallotti, G. Melideo, G. Monaco, L. Moscardelli:
Mobile Network Creation Games.
In Proceedings of the 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2012).
-
M.Flammini, G.Monaco, L.Moscardelli, M.Shalom, S.Zaks:
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming.
In Proceedings of the 15th International Conference On Principles Of Distributed Systems (OPODIS 2011).
-
M.Flammini, G.Monaco, L.Moscardelli, M.Shalom, S.Zaks:
Optimizing Regenerator Cost in Traffic Grooming.
In Proceedings of the 14th International Conference On Principles Of Distributed Systems (OPODIS 2010).
-
V. Bilò, I. Caragiannis, A. Fanelli, G. Monaco:
Improved lower bounds on the price of stability of undirected network design games.
In Proceedings of the 3rd International Symposium on Algorithmic Game Theory (SAGT 10).
-
M. Flammini, A. Marchetti Spaccamela, G. Monaco, L. Moscardelli, S. Zaks:
On the Complexity of the Regenerator Placement Problem in Optical Networks.
In Proceedings of the 21st ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA 2009).
-
V. Bilò, M. Flammini, G. Monaco, L. Moscardelli:
On the performances of Nash Equilibria in Isolation Games.
In Proceedings of the 15th International Computing and Combinatorics Conference
(COCOON 2009).
-
M.Flammini, G.Monaco, L.Moscardelli, H. Shachnai, M.Shalom, T. Tamir, S.Zaks:
Minimizing Total Busy Time in Parallel Scheduling with Application to Optical Networks.
In Proceedings of the 23rd IEEE International Parallel and Distributed Processing Symposium
(IPDPS 2009).
-
M.Flammini, G.Monaco, L.Moscardelli, M.Shalom, S.Zaks:
Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs.
In Proceedings of the 14th International Conference on Parallel and Distributed Computing (EuroPar 2008).
-
I. Caragiannis, G. Monaco:
A 6/5-approximation algorithm for the maximum 3-cover problem.
In Proceedings of the 33rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2008).
-
S. Di Giannantonio, M.Flammini, G.Monaco, L.Moscardelli, M.Shalom, S.Zaks:
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem.
In Proceedings of the 3rd International Workshop On Internet And Network Economics (WINE 2007).
-
M.Flammini, G.Monaco, L.Moscardelli, M.Shalom, S.Zaks:
Minimizing the number of ADMs with and without traffic
grooming: complexity and approximability.
In Proceedings of the 8th International Conference on Transparent Optical Networks (ICTON 2006).
-
M.Flammini, G.Monaco, L.Moscardelli, M.Shalom, S.Zaks:
Approximating the Traffic Grooming Problem in Tree and Star Networks.
In Proceedings of the 32st International Workshop on
Graph-Theoretic Concepts in Computer Science (WG 2006).
PhD Thesis
G.Monaco: Optimization and Non-Cooperative Issues in
Communication Networks. Supervisor Prof. Michele Flammini