default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGianpiero Monaco
Person information
- affiliation: University of Chieti-Pescara, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j29]Andrea D'Ascenzo, Mattia D'Emidio, Michele Flammini, Gianpiero Monaco:
Digraph k-Coloring Games: New Algorithms and Experiments. J. Artif. Intell. Res. 81: 163-202 (2024)- [c47]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Cosimo Vinci:
On Green Sustainability of Resource Selection Games with Equitable Cost-Sharing. AAMAS 2024: 207-215 - [c46]Laurent Gourvès, Gianpiero Monaco:
Nash Stability in Hedonic Skill Games. AAMAS 2024: 706-714 - [c45]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:
AI for Sustainability: Research at Ud'A Node. Ital-IA 2024: 516-521 - 2023
- [c44]Gianpiero Monaco
, Luca Moscardelli:
Nash Stability in Fractional Hedonic Games with Bounded Size Coalitions. WINE 2023: 509-526 - 2022
- [j28]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: 197-221 (2022) - [j27]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Pricing Problems with Buyer Preselection. J. Artif. Intell. Res. 74: 1791-1822 (2022) - [j26]Cosimo Vinci, Vittorio Bilò, Gianpiero Monaco, Luca Moscardelli:
Nash Social Welfare in Selfish and Online Load Balancing. ACM Trans. Economics and Comput. 10(2): 8:1-8:41 (2022) - [c43]Vittorio Bilò, Gianpiero Monaco, Luca Moscardelli:
Hedonic Games with Fixed-Size Coalitions. AAAI 2022: 9287-9295 - [c42]Vittorio Bilò, Gianpiero Monaco, Luca Moscardelli, Cosimo Vinci:
Nash Social Welfare in Selfish and Online Load Balancing. ICTCS 2022: 180-187 - [c41]Angelo Fanelli, Gianpiero Monaco, Luca Moscardelli:
Relaxed Core Stability in Fractional Hedonic Games. ISAIM 2022 - [c40]Andrea D'Ascenzo, Mattia D'Emidio, Michele Flammini, Gianpiero Monaco:
Digraph k-Coloring Games: From Theory to Practice. SEA 2022: 20:1-20:18 - 2021
- [j25]Stefano Leonardi, Gianpiero Monaco, Piotr Sankowski, Qiang Zhang:
Budget Feasible Mechanisms on Matroids. Algorithmica 83(5): 1222-1237 (2021) - [j24]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): 151 (2021) - [j23]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): 1-14 (2021) - [j22]Gianpiero Monaco, Luca Moscardelli, Yllka Velaj:
Additively Separable Hedonic Games with Social Context. Games 12(3): 71 (2021) - [j21]Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj:
Generalized budgeted submodular set function maximization. Inf. Comput. 281: 104741 (2021) - [j20]Michele Flammini, Bojana Kodric, Gianpiero Monaco, Qiang Zhang:
Strategyproof Mechanisms for Additively Separable and Fractional Hedonic Games. J. Artif. Intell. Res. 70: 1253-1279 (2021) - [j19]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
On the Online Coalition Structure Generation Problem. J. Artif. Intell. Res. 72: 1215-1250 (2021) - [c39]Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj:
The Multi-budget Maximum Weighted Coverage Problem. CIAC 2021: 173-186 - [c38]Angelo Fanelli, Gianpiero Monaco, Luca Moscardelli:
Relaxed Core Stability in Fractional Hedonic Games. IJCAI 2021: 182-188 - 2020
- [j18]Gianpiero Monaco, Luca Moscardelli, Yllka Velaj:
Stable outcomes in modified fractional hedonic games. Auton. Agents Multi Agent Syst. 34(1): 4 (2020) - [j17]Vittorio Bilò, Francesco Cellinese, Giovanna Melideo, Gianpiero Monaco:
Selfish colorful bin packing games. J. Comb. Optim. 40(3): 610-635 (2020) - [j16]Raffaello Carosi, Gianpiero Monaco:
Generalized Graph k-Coloring Games. Theory Comput. Syst. 64(6): 1028-1041 (2020) - [c37]Vittorio Bilò, Gianpiero Monaco, Luca Moscardelli, Cosimo Vinci:
Nash Social Welfare in Selfish and Online Load Balancing. WINE 2020: 323-337 - [i9]Vittorio Bilò, Gianpiero Monaco, Luca Moscardelli, Cosimo Vinci:
Nash Social Welfare in Selfish and Online Load Balancing. CoRR abs/2007.08263 (2020)
2010 – 2019
- 2019
- [c36]Raffaello Carosi, Gianpiero Monaco, Luca Moscardelli:
Local Core Stability in Simple Symmetric Fractional Hedonic Games. AAMAS 2019: 574-582 - [c35]Gianpiero Monaco, Luca Moscardelli, Yllka Velaj:
On the Performance of Stable Outcomes in Modified Fractional Hedonic Games with Egalitarian Social Welfare. AAMAS 2019: 873-881 - [c34]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Optimality and Nash Stability in Additive Separable Generalized Group Activity Selection Problems. IJCAI 2019: 102-108 - [c33]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: 14:1-14:21 - [c32]Raffaello Carosi, Simone Fioravanti, Luciano Gualà, Gianpiero Monaco:
Coalition Resilient Outcomes in Max k-Cut Games. SOFSEM 2019: 94-107 - 2018
- [j15]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: 315-371 (2018) - [c31]Gianpiero Monaco, Luca Moscardelli, Yllka Velaj:
Stable Outcomes in Modified Fractional Hedonic Games. AAMAS 2018: 937-945 - [c30]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Online Coalition Structure Generation in Graph Games. AAMAS 2018: 1353-1361 - [c29]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
On the Impact of Buyers Preselection in Pricing Problems. AAMAS 2018: 1871-1873 - [c28]Raffaello Carosi, Gianpiero Monaco:
Generalized Graph k-Coloring Games. COCOON 2018: 268-279 - [c27]Vittorio Bilò, Francesco Cellinese, Giovanna Melideo, Gianpiero Monaco:
On Colorful Bin Packing Games. COCOON 2018: 280-292 - [c26]Gianpiero Monaco, Luca Moscardelli, Yllka Velaj:
Hedonic Games with Social Context. ICTCS 2018: 24-35 - [c25]Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj:
Generalized Budgeted Submodular Set Function Maximization. MFCS 2018: 31:1-31:14 - [c24]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Pricing Problems with Buyer Preselection. MFCS 2018: 47:1-47:16 - [i8]Gianpiero Monaco, Luca Moscardelli, Yllka Velaj:
Stable Outcomes in Modified Fractional Hedonic Games. CoRR abs/1804.05040 (2018) - [i7]Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj:
Generalized budgeted submodular set function maximization. CoRR abs/1808.03085 (2018) - [i6]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 abs/1808.09406 (2018) - [i5]Raffaello Carosi, Simone Fioravanti, Luciano Gualà, Gianpiero Monaco:
Coalition Resilient Outcomes in Max k-Cut Games. CoRR abs/1810.09278 (2018) - 2017
- [j14]Vittorio Bilò, Michele Flammini, Gianpiero Monaco:
Approximating the revenue maximization problem with sharp demands. Theor. Comput. Sci. 662: 9-30 (2017) - [j13]Michele Flammini, Vasco Gallotti, Giovanna Melideo, Gianpiero Monaco, Luca Moscardelli:
Network Movement Games. Theor. Comput. Sci. 667: 101-118 (2017) - [c23]Raffaello Carosi, Michele Flammini, Gianpiero Monaco:
Computing Approximate Pure Nash Equilibria in Digraph k-Coloring Games. AAMAS 2017: 911-919 - [c22]Vittorio Bilò, Ioannis Caragiannis, Angelo Fanelli, Michele Flammini, Gianpiero Monaco:
Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems. ICALP 2017: 125:1-125:13 - [c21]Stefano Leonardi, Gianpiero Monaco, Piotr Sankowski, Qiang Zhang:
Budget Feasible Mechanisms on Matroids. IPCO 2017: 368-379 - [c20]Michele Flammini, Gianpiero Monaco, Qiang Zhang:
Strategyproof Mechanisms for Additively Separable Hedonic Games and Fractional Hedonic Games. WAOA 2017: 301-316 - [i4]Michele Flammini, Gianpiero Monaco, Qiang Zhang:
Strategyproof Mechanisms for Additively Separable Hedonic Games and Fractional Hedonic Games. CoRR abs/1706.09007 (2017) - [i3]Vittorio Bilò, Francesco Cellinese, Giovanna Melideo, Gianpiero Monaco:
On Colorful Bin Packing Games. CoRR abs/1711.03570 (2017) - 2016
- [j12]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
The price of envy-freeness in machine scheduling. Theor. Comput. Sci. 613: 65-78 (2016) - [i2]Stefano Leonardi, Gianpiero Monaco, Piotr Sankowski, Qiang Zhang:
Budget Feasible Mechanisms on Matroids. CoRR abs/1612.03150 (2016) - 2015
- [j11]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Some Anomalies of Farsighted Strategic Behavior. Theory Comput. Syst. 56(1): 156-180 (2015) - [j10]Angelo Fanelli, Dariusz Leniowski, Gianpiero Monaco, Piotr Sankowski:
The ring design game with fair cost allocation. Theor. Comput. Sci. 562: 90-100 (2015) - [c19]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
On the Price of Stability of Fractional Hedonic Games. AAMAS 2015: 1239-1247 - [c18]Gianpiero Monaco, Piotr Sankowski, Qiang Zhang:
Revenue Maximization Envy-Free Pricing for Homogeneous Resources. IJCAI 2015: 90-96 - [c17]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions. WINE 2015: 118-131 - 2014
- [j9]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): 671-691 (2014) - [c16]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
The Price of Envy-Freeness in Machine Scheduling. MFCS (2) 2014: 106-117 - [c15]Vittorio Bilò, Michele Flammini, Gianpiero Monaco:
Approximating the Revenue Maximization Problem with Sharp Demands. SWAT 2014: 74-85 - [c14]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Nash Stability in Fractional Hedonic Games. WINE 2014: 486-491 - 2013
- [j8]Ioannis Caragiannis, Gianpiero Monaco:
A 6/5-approximation algorithm for the maximum 3-cover problem. J. Comb. Optim. 25(1): 60-77 (2013) - [j7]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): 668-686 (2013) - [i1]Vittorio Bilò, Michele Flammini, Gianpiero Monaco:
Approximating the Revenue Maximization Problem with Sharp Demands. CoRR abs/1312.3892 (2013) - 2012
- [c13]Michele Flammini, Vasco Gallotti, Giovanna Melideo, Gianpiero Monaco, Luca Moscardelli:
Mobile Network Creation Games. SIROCCO 2012: 159-170 - [c12]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Some Anomalies of Farsighted Strategic Behavior. WAOA 2012: 229-241 - [c11]Angelo Fanelli, Dariusz Leniowski, Gianpiero Monaco, Piotr Sankowski:
The Ring Design Game with Fair Cost Allocation - [Extended Abstract]. WINE 2012: 546-552 - 2011
- [j6]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
On the performances of Nash equilibria in isolation games. J. Comb. Optim. 22(3): 378-391 (2011) - [j5]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Optimizing regenerator cost in traffic grooming. Theor. Comput. Sci. 412(52): 7109-7121 (2011) - [j4]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): 498-511 (2011) - [c10]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: 96-111 - 2010
- [j3]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): 3553-3562 (2010) - [c9]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Optimizing Regenerator Cost in Traffic Grooming - (Extended Abstract). OPODIS 2010: 443-458 - [c8]Vittorio Bilò, Ioannis Caragiannis, Angelo Fanelli, Gianpiero Monaco:
Improved Lower Bounds on the Price of Stability of Undirected Network Design Games. SAGT 2010: 90-101 - [p2]Tibor Cinkler, David Coudert, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Xavier Muñoz, Ignasi Sau, Mordechai Shalom, Shmuel Zaks:
Traffic Grooming: Combinatorial Results and Practical Resolutions. Graphs and Algorithms in Communication Networks 2010: 63-94 - [p1]Vittorio Bilò, Ioannis Caragiannis, Angelo Fanelli, Michele Flammini, Christos Kaklamanis, Gianpiero Monaco, Luca Moscardelli:
Game-Theoretic Approaches to Optimization Problems in Communication Networks. Graphs and Algorithms in Communication Networks 2010: 241-263
2000 – 2009
- 2009
- [c7]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
On the Performances of Nash Equilibria in Isolation Games. COCOON 2009: 17-26 - [c6]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: 1-12 - [c5]Michele Flammini, Alberto Marchetti-Spaccamela, Gianpiero Monaco, Luca Moscardelli, Shmuel Zaks:
On the complexity of the regenerator placement problem in optical networks. SPAA 2009: 154-162 - 2008
- [j2]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): 1721-1731 (2008) - [j1]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): 939-948 (2008) - [c4]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs. Euro-Par 2008: 920-929 - [c3]Ioannis Caragiannis, Gianpiero Monaco:
A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem. MFCS 2008: 205-216 - 2007
- [c2]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: 404-411 - 2006
- [c1]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Approximating the Traffic Grooming Problem in Tree and Star Networks. WG 2006: 147-158
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-09 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
