MONACO, Gianpiero

MONACO, Gianpiero  

Dipartimento di Ingegneria e scienze dell informazione e matematica  

Mostra records
Risultati 1 - 20 di 68 (tempo di esecuzione: 0.038 secondi).
Titolo Data di pubblicazione Autore(i) File
A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem 1-gen-2008 Caragiannis, I.; Monaco, Gianpiero
A 6/5-approximation algorithm for the maximum 3-cover problem. 1-gen-2013 Caragiannis, I.; Monaco, Gianpiero
Additively separable hedonic games with social context 1-gen-2021 Monaco, G.; Moscardelli, L.; Velaj, Y.
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.
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.
Approximating the revenue maximization problem with sharp demands 1-gen-2017 Bilo', Vittorio; Flammini, Michele; Monaco, Gianpiero
Approximating the Revenue Maximization Problem with Sharp Demands. 1-gen-2014 Bilo', V.; Flammini, Michele; Monaco, Gianpiero
Approximating the Traffic Grooming Problem in Tree and Star Networks 1-gen-2008 Flammini, Michele; Monaco, Gianpiero; Moscardelli, L; Shalom, M; Zaks, S.
Approximating the Traffic Grooming Problem in Tree and Star Networks 1-gen-2006 Flammini, Michele; Monaco, Gianpiero; Moscardelli, L.; Shalom, M.; Zaks, S.
Approximating the Traffic Grooming Problem with respect to ADMs and OADMs 1-gen-2008 Flammini, Michele; Monaco, Gianpiero; Moscardelli, L.; Shalom, M.; Zaks, S.
Budget Feasible Mechanisms on Matroids 1-gen-2017 Leonardi, S.; Monaco, Gianpiero; Sankowski, P.; Zhang, Q.
Budget Feasible Mechanisms on Matroids 1-gen-2021 Leonardi, S.; Monaco, G.; Sankowski, P.; Zhang, Q.
Coalition resilient outcomes in max k-cut games 1-gen-2019 Carosi, Raffaello; Fioravanti, Simone; Gualà, Luciano; Monaco, Gianpiero
Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions 1-gen-2021 Bilo, V.; Flammini, M.; Monaco, G.; Moscardelli, L.
Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions 1-gen-2015 Bilo', V.; Flammini, Michele; Monaco, Gianpiero; Moscardelli, L.
Computing Approximate Pure Nash Equilibria in Digraph k-Coloring Games 1-gen-2017 Carosi, Raffaello; Flammini, Michele; Monaco, Gianpiero
Game-Theoretic Approaches to Optimization Problems in Communication Networks. 1-gen-2010 Bilo', V.; Caragiannis, I.; Fanelli, A.; Flammini, Michele; Kaklamanis, C.; Monaco, Gianpiero; Moscardelli, L.
Generalized budgeted submodular set function maximization 1-gen-2018 Cellinese, Francesco; D'Angelo, Gianlorenzo; Monaco, Gianpiero; Velaj, Yllka
Generalized budgeted submodular set function maximization 1-gen-2021 Cellinese, F.; D'Angelo, G.; Monaco, G.; Velaj, Y.
Generalized Graph k-Coloring Games 1-gen-2018 Carosi, Raffaello; Monaco, Gianpiero