Sfoglia per Autore  

Opzioni
Mostrati risultati da 41 a 60 di 70
Titolo Data di pubblicazione Autore(i) File
On the impact of buyers preselection in pricing problems 2018 Bilò, Vittorio; Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca
Online coalition structure generation in graph games 2018 Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Zaks, Shmuel; Shalom, Mordechai
On Colorful Bin Packing Games 2018 Bilò, Vittorio; Cellinese, Francesco; Melideo, Giovanna; Monaco, Gianpiero
Generalized Graph k-Coloring Games 2018 Carosi, Raffaello; Monaco, Gianpiero
Stable outcomes in modified fractional hedonic games 2018 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.
Coalition resilient outcomes in max k-cut games 2019 Carosi, Raffaello; Fioravanti, Simone; Gualà, Luciano; Monaco, Gianpiero
Optimality and nash stability in additively separable generalized group activity selection problems 2019 Bilo, V.; Fanelli, A.; Flammini, M.; Monaco, G.; Moscardelli, L.
Local core stability in simple symmetric fractional hedonic games 2019 Carosi, R.; Monaco, G.; Moscardelli, L.
On the performance of stable outcomes in modified fractional hedonic games with egalitarian social welfare 2019 Monaco, G.; Moscardelli, L.; Velaj, Y.
Nash Social Welfare in Selfish and Online Load Balancing 2020 Bilò, V.; Monaco, G.; Moscardelli, L.; Vinci, C.
Generalized Graph k-Coloring Games 2020 Carosi, R.; Monaco, G.
Stable outcomes in modified fractional hedonic games 2020 Monaco, G.; Moscardelli, L.; Velaj, Y.
Selfish colorful bin packing games 2020 Bilo, V.; Cellinese, F.; Melideo, G.; Monaco, G.
Relaxed Core Stability in Fractional Hedonic Games 2021 Fanelli, Angelo; Monaco, Gianpiero; Moscardelli, Luca
The Multi-budget Maximum Weighted Coverage Problem 2021 Cellinese, F.; D'Angelo, G.; Monaco, G.; Velaj, Y.
The traffic grooming problem in optical networks with respect to adms and oadms: Complexity and approximation 2021 Flammini, M.; Monaco, G.; Moscardelli, L.; Shalom, M.; Zaks, S.
Strategyproof mechanisms for additively separable and fractional hedonic games 2021 Flammini, M.; Kodric, B.; Monaco, G.; Zhang, Q.
Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions 2021 Bilo, V.; Flammini, M.; Monaco, G.; Moscardelli, L.
Additively Separable Hedonic Games with Social Context 2021 Monaco, Gianpiero; Moscardelli, Luca; Velaj, Yllka
Mostrati risultati da 41 a 60 di 70
Legenda icone

  •  file ad accesso aperto
  •  file disponibili sulla rete interna
  •  file disponibili agli utenti autorizzati
  •  file disponibili solo agli amministratori
  •  file sotto embargo
  •  nessun file disponibile