Monaco, Gianpiero

Monaco, Gianpiero  

DIPARTIMENTO DI ECONOMIA  

Mostra records
Risultati 1 - 20 di 69 (tempo di esecuzione: 0.031 secondi).
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
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.
Approximating the revenue maximization problem with sharp demands 2017 Bilo', Vittorio; Flammini, Michele; Monaco, Gianpiero
Approximating the Revenue Maximization Problem with Sharp Demands 2014 Bilo', V.; 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
Game-Theoretic Approaches to Optimization Problems in Communication Networks 2010 Bilo', V.; Caragiannis, I.; Fanelli, A.; Flammini, Michele; Kaklamanis, C.; Monaco, Gianpiero; Moscardelli, L.
Generalized budgeted submodular set function maximization 2018 Cellinese, Francesco; D'Angelo, Gianlorenzo; Monaco, Gianpiero; Velaj, Yllka
Generalized budgeted submodular set function maximization 2021 Cellinese, F.; D'Angelo, G.; Monaco, G.; Velaj, Y.
Generalized Graph k-Coloring Games 2020 Carosi, R.; Monaco, G.