MONACO, GIANPIERO
MONACO, GIANPIERO
Dipartimento di Ingegneria e scienze dell'informazione e matematica
Digraph k-Coloring Games: New Algorithms and Experiments
2024-01-01 D'Ascenzo, Andrea; D'Emidio, Mattia; Flammini, Michele; Monaco, Gianpiero
Pricing Problems with Buyer Preselection
2022-01-01 Bilo, V.; Flammini, M.; Monaco, G.; Moscardelli, L.
Digraph k-Coloring Games: From Theory to Practice
2022-01-01 D'Ascenzo, Andrea; D'Emidio, Mattia; Flammini, Michele; Monaco, Gianpiero
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.
Generalized budgeted submodular set function maximization
2021-01-01 Cellinese, F.; D'Angelo, G.; Monaco, G.; Velaj, Y.
Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions
2021-01-01 Bilo, V.; Flammini, M.; Monaco, G.; Moscardelli, L.
Relaxed Core Stability in Fractional Hedonic Games
2021-01-01 Fanelli, A.; Monaco, G.; Moscardelli, L.
The Multi-budget Maximum Weighted Coverage Problem
2021-01-01 Cellinese, F.; D'Angelo, G.; Monaco, G.; Velaj, Y.
On the Online Coalition Structure Generation Problem
2021-01-01 Flammini, M.; Monaco, G.; Moscardelli, L.; Shalom, M.; Zaks, S.
Strategyproof mechanisms for additively separable and fractional hedonic games
2021-01-01 Flammini, M.; Kodric, B.; Monaco, G.; Zhang, Q.
The traffic grooming problem in optical networks with respect to adms and oadms: Complexity and approximation
2021-01-01 Flammini, M.; Monaco, G.; Moscardelli, L.; Shalom, M.; Zaks, S.
Budget Feasible Mechanisms on Matroids
2021-01-01 Leonardi, S.; Monaco, G.; Sankowski, P.; Zhang, Q.
Additively separable hedonic games with social context
2021-01-01 Monaco, G.; Moscardelli, L.; Velaj, Y.
Nash Social Welfare in Selfish and Online Load Balancing
2020-01-01 Bilo, V.; Monaco, G.; Moscardelli, L.; Vinci, C.
Stable outcomes in modified fractional hedonic games
2020-01-01 Monaco, G.; Moscardelli, L.; Velaj, Y.
Selfish colorful bin packing games
2020-01-01 Bilo, V.; Cellinese, F.; Melideo, G.; Monaco, G.
Generalized Graph k-Coloring Games
2020-01-01 Carosi, R.; Monaco, G.
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.
Local core stability in simple symmetric fractional hedonic games
2019-01-01 Carosi, R.; Monaco, G.; Moscardelli, L.
Optimality and nash stability in additively separable generalized group activity selection problems
2019-01-01 Bilo, V.; Fanelli, A.; Flammini, M.; Monaco, G.; Moscardelli, L.
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| Digraph k-Coloring Games: New Algorithms and Experiments | 1-gen-2024 | D'Ascenzo, Andrea; D'Emidio, Mattia; Flammini, Michele; Monaco, Gianpiero | |
| Pricing Problems with Buyer Preselection | 1-gen-2022 | Bilo, V.; Flammini, M.; Monaco, G.; Moscardelli, L. | |
| Digraph k-Coloring Games: From Theory to Practice | 1-gen-2022 | D'Ascenzo, Andrea; D'Emidio, Mattia; Flammini, Michele; Monaco, Gianpiero | |
| Almost envy-free allocations with connected bundles | 1-gen-2022 | Bilo, V.; Caragiannis, I.; Flammini, M.; Igarashi, A.; Monaco, G.; Peters, D.; Vinci, C.; Zwicker, W. S. | |
| Generalized budgeted submodular set function maximization | 1-gen-2021 | Cellinese, F.; D'Angelo, G.; Monaco, G.; Velaj, Y. | |
| Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions | 1-gen-2021 | Bilo, V.; Flammini, M.; Monaco, G.; Moscardelli, L. | |
| Relaxed Core Stability in Fractional Hedonic Games | 1-gen-2021 | Fanelli, A.; Monaco, G.; Moscardelli, L. | |
| The Multi-budget Maximum Weighted Coverage Problem | 1-gen-2021 | Cellinese, F.; D'Angelo, G.; Monaco, G.; Velaj, Y. | |
| On the Online Coalition Structure Generation Problem | 1-gen-2021 | Flammini, M.; Monaco, G.; Moscardelli, L.; Shalom, M.; Zaks, S. | |
| Strategyproof mechanisms for additively separable and fractional hedonic games | 1-gen-2021 | Flammini, M.; Kodric, B.; Monaco, G.; Zhang, Q. | |
| The traffic grooming problem in optical networks with respect to adms and oadms: Complexity and approximation | 1-gen-2021 | Flammini, M.; Monaco, G.; Moscardelli, L.; Shalom, M.; Zaks, S. | |
| Budget Feasible Mechanisms on Matroids | 1-gen-2021 | Leonardi, S.; Monaco, G.; Sankowski, P.; Zhang, Q. | |
| Additively separable hedonic games with social context | 1-gen-2021 | Monaco, G.; Moscardelli, L.; Velaj, Y. | |
| Nash Social Welfare in Selfish and Online Load Balancing | 1-gen-2020 | Bilo, V.; Monaco, G.; Moscardelli, L.; Vinci, C. | |
| Stable outcomes in modified fractional hedonic games | 1-gen-2020 | Monaco, G.; Moscardelli, L.; Velaj, Y. | |
| Selfish colorful bin packing games | 1-gen-2020 | Bilo, V.; Cellinese, F.; Melideo, G.; Monaco, G. | |
| Generalized Graph k-Coloring Games | 1-gen-2020 | Carosi, R.; Monaco, G. | |
| Almost Envy-Free Allocations with Connected Bundles | 1-gen-2019 | Bilò, Vittorio; Caragiannis, Ioannis; Flammini, Michele; Igarashi, Ayumi; Monaco, Gianpiero; Peters, Dominik; Cosimo, Vinci; Zwicker, William S. | |
| Local core stability in simple symmetric fractional hedonic games | 1-gen-2019 | Carosi, R.; Monaco, G.; Moscardelli, L. | |
| Optimality and nash stability in additively separable generalized group activity selection problems | 1-gen-2019 | Bilo, V.; Fanelli, A.; Flammini, M.; Monaco, G.; Moscardelli, L. |