Monaco, Gianpiero
Monaco, Gianpiero
DIPARTIMENTO DI ECONOMIA
A 6/5-approximation algorithm for the maximum 3-cover problem
2013-01-01 Caragiannis, I.; Monaco, G.
A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem
2008-01-01 Caragiannis, I.; Monaco, Gianpiero
Additively Separable Hedonic Games with Social Context
2021-01-01 Monaco, Gianpiero; Moscardelli, Luca; Velaj, Yllka
AI for Sustainability: Research at Ud’A Node
2024-01-01 Amato, G.; Amelio, A.; Caroprese, L.; Chiacchiaretta, P.; Fioravanti, F.; Ippoliti, L.; Meo, M. C.; Monaco, G.; Morbidoni, C.; Moscardelli, L.; Parton, M.; Scozzari, F.
AI for Sustainability: Research at Ud’A Node
2024-01-01 Amato, G.; Amelio, A.; Caroprese, L.; Chiacchiaretta, P.; Fioravanti, F.; Ippoliti, L.; Meo, M. C.; Monaco, G.; Morbidoni, C.; Moscardelli, L.; Parton, M.; Scozzari, F.
Almost Envy-Free Allocations with Connected Bundles
2019-01-01 Bilò, Vittorio; Caragiannis, Ioannis; Flammini, Michele; Igarashi, Ayumi; Monaco, Gianpiero; Peters, Dominik; Cosimo, Vinci; Zwicker, William S.
Almost envy-free allocations with connected bundles
2022-01-01 Bilo, V.; Caragiannis, I.; Flammini, M.; Igarashi, A.; Monaco, G.; Peters, D.; Vinci, C.; Zwicker, W. S.
Approximating the Revenue Maximization Problem with Sharp Demands
2014-01-01 Bilo', V.; Flammini, Michele; Monaco, Gianpiero
Approximating the revenue maximization problem with sharp demands
2017-01-01 Bilo', Vittorio; Flammini, Michele; Monaco, Gianpiero
Approximating the Traffic Grooming Problem in Tree and Star Networks
2008-01-01 Flammini, M.; Monaco, G.; Moscardelli, Luca; Shalom, M.; Zaks, S.
Approximating the Traffic Grooming Problem in Tree and Star Networks
2006-01-01 Flammini, M.; Monaco, G.; Moscardelli, Luca; Shalom, M.; Zaks, S.
Approximating the Traffic Grooming Problem with respect to ADMs and OADMs
2008-01-01 Flammini, M.; Monaco, G.; Moscardelli, Luca; Shalom, M.; Zaks, S.
Budget feasible mechanisms on matroids
2017-01-01 Leonardi, S.; Monaco, G.; Sankowski, P.; Zhang, Q.
Budget Feasible Mechanisms on Matroids
2021-01-01 Leonardi, S.; Monaco, G.; Sankowski, P.; Zhang, Q.
Coalition resilient outcomes in max k-cut games
2019-01-01 Carosi, Raffaello; Fioravanti, Simone; Gualà, Luciano; Monaco, Gianpiero
Computing approximate nash equilibria in network congestion games with polynomially decreasing cost functions
2015-01-01 Biló, Vittorio; Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca
Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions
2021-01-01 Bilo, V.; Flammini, M.; Monaco, G.; Moscardelli, L.
Computing Approximate Pure Nash Equilibria in Digraph k-Coloring Games
2017-01-01 Carosi, Raffaello; Flammini, Michele; Monaco, Gianpiero
Digraph k-Coloring Games: From Theory to Practice
2022-01-01 D'Ascenzo, Andrea; D'Emidio, Mattia; Flammini, Michele; Monaco, Gianpiero
Digraph k-Coloring Games: New Algorithms and Experiments
2024-01-01 D'Ascenzo, A.; D'Emidio, M.; Flammini, M.; Monaco, G.
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| A 6/5-approximation algorithm for the maximum 3-cover problem | 2013 | Caragiannis, I.; Monaco, G. | |
| A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem | 2008 | Caragiannis, I.; Monaco, Gianpiero | |
| Additively Separable Hedonic Games with Social Context | 2021 | Monaco, Gianpiero; Moscardelli, Luca; Velaj, Yllka | |
| AI for Sustainability: Research at Ud’A Node | 2024 | Amato, G.; Amelio, A.; Caroprese, L.; Chiacchiaretta, P.; Fioravanti, F.; Ippoliti, L.; Meo, M. C.; Monaco, G.; Morbidoni, C.; Moscardelli, L.; Parton, M.; Scozzari, F. | |
| AI for Sustainability: Research at Ud’A Node | 2024 | Amato, G.; Amelio, A.; Caroprese, L.; Chiacchiaretta, P.; Fioravanti, F.; Ippoliti, L.; Meo, M. C.; Monaco, G.; Morbidoni, C.; Moscardelli, L.; Parton, M.; Scozzari, F. | |
| Almost Envy-Free Allocations with Connected Bundles | 2019 | Bilò, Vittorio; Caragiannis, Ioannis; Flammini, Michele; Igarashi, Ayumi; Monaco, Gianpiero; Peters, Dominik; Cosimo, Vinci; Zwicker, William S. | |
| Almost envy-free allocations with connected bundles | 2022 | Bilo, V.; Caragiannis, I.; Flammini, M.; Igarashi, A.; Monaco, G.; Peters, D.; Vinci, C.; Zwicker, W. S. | |
| Approximating the Revenue Maximization Problem with Sharp Demands | 2014 | Bilo', V.; Flammini, Michele; Monaco, Gianpiero | |
| Approximating the revenue maximization problem with sharp demands | 2017 | Bilo', Vittorio; Flammini, Michele; Monaco, Gianpiero | |
| Approximating the Traffic Grooming Problem in Tree and Star Networks | 2008 | Flammini, M.; Monaco, G.; Moscardelli, Luca; Shalom, M.; Zaks, S. | |
| Approximating the Traffic Grooming Problem in Tree and Star Networks | 2006 | Flammini, M.; Monaco, G.; Moscardelli, Luca; Shalom, M.; Zaks, S. | |
| Approximating the Traffic Grooming Problem with respect to ADMs and OADMs | 2008 | Flammini, M.; Monaco, G.; Moscardelli, Luca; Shalom, M.; Zaks, S. | |
| Budget feasible mechanisms on matroids | 2017 | Leonardi, S.; Monaco, G.; Sankowski, P.; Zhang, Q. | |
| Budget Feasible Mechanisms on Matroids | 2021 | Leonardi, S.; Monaco, G.; Sankowski, P.; Zhang, Q. | |
| Coalition resilient outcomes in max k-cut games | 2019 | Carosi, Raffaello; Fioravanti, Simone; Gualà, Luciano; Monaco, Gianpiero | |
| Computing approximate nash equilibria in network congestion games with polynomially decreasing cost functions | 2015 | Biló, Vittorio; Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca | |
| Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions | 2021 | Bilo, V.; Flammini, M.; Monaco, G.; Moscardelli, L. | |
| Computing Approximate Pure Nash Equilibria in Digraph k-Coloring Games | 2017 | Carosi, Raffaello; Flammini, Michele; Monaco, Gianpiero | |
| Digraph k-Coloring Games: From Theory to Practice | 2022 | D'Ascenzo, Andrea; D'Emidio, Mattia; Flammini, Michele; Monaco, Gianpiero | |
| Digraph k-Coloring Games: New Algorithms and Experiments | 2024 | D'Ascenzo, A.; D'Emidio, M.; Flammini, M.; Monaco, G. |