BILO', VITTORIO

BILO', VITTORIO  

DIPARTIMENTO DI MATEMATICA E FISICA "ENNIO DE GIORGI"  

Mostra records
Risultati 1 - 20 di 125 (tempo di esecuzione: 0.052 secondi).
Titolo Data di pubblicazione Autore(i) File
$exists ℝ$–Complete Decision Problems about (Symmetric) Nash Equilibria in (Symmetric) Multi-Player Games 1-gen-2021 Bilo', Vittorio; Marios, Mavronicolas
17th Italian Conference on Theoretical Computer Science 1-gen-2016 Caruso, ANTONIO MARIO; Bilo', Vittorio
A Catalog of $ℝ-Complete Decision Problems about Nash Equilibria in Multi-Player Games 1-gen-2016 Bilo', Vittorio; Marios, Mavronicolas
A Unifying Tool for Bounding the Quality of Non-Cooperative Solutions in Weighted Congestion Games 1-gen-2018 Bilo', Vittorio
A Unifying Tool for Bounding the Quality of Non-cooperative Solutions in Weighted Congestion Games 1-gen-2012 Bilo', Vittorio
Almost Envy-Free Allocations with Connected Bundles 1-gen-2019 Bilo', Vittorio; Caragiannis, I.; Flammini, M.; Igarashi, A.; Monaco, Gianpiero; Peters, D.; Vinci, C.; Zwicker, W. S.
Almost envy-free allocations with connected bundles 1-gen-2022 Bilò, Vittorio; Caragiannis, I.; Flammini, M.; Igarashi, A.; Monaco, G.; Peters, D.; Vinci, C.; Zwicker, W. S.
An Improved Approximation Algorithm for the Minimum Energy Consumption Broadcast Subgraph 1-gen-2004 Bilo', Vittorio; Melideo, G.
Approximating the revenue maximization problem with sharp demands 1-gen-2017 Bilo', Vittorio; Flammini, M; Monaco, G.
Approximation the Revenue Maximization Problem with Sharp Demands 1-gen-2014 Bilo', Vittorio; M., Flammini; G., Monaco
Bounds on the Price of Stability of Undirected Network Design with Three Players 1-gen-2011 Bilo', Vittorio; R., Bove
Complexity of Rational and Irrational Nash Equilibria 1-gen-2011 Bilo', Vittorio; M., Mavronicolas
Computational Complexity of Decision Problems about Nash Equilibria in Win-Lose Multi-Player Games 1-gen-2023 Bilo', V.; Hansen, K. A.; Mavronicolas, M.
Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions 1-gen-2015 Bilo', Vittorio; M., Flammini; G., Monaco; L., Moscardelli
Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions 1-gen-2021 Bilo', Vittorio; Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca
Computing Exact and Approximate Nash Equilibria in 2-Player Games 1-gen-2010 Bilo', Vittorio; A., Fanelli
Congestion Games with Priority-Based Scheduling 1-gen-2020 Bilo', Vittorio; Vinci, Cosimo
Congestion games with priority-based scheduling 1-gen-2023 Bilo', V.; Vinci, C.
Coping with Selfishness in Congestion Games - Analysis and Design via LP Duality 1-gen-2023 Bilo', V.; Vinci, C.
Data-Driven Models of Selfish Routing: Why Price of Anarchy Does Depend on Network Topology 1-gen-2020 Benita, Francisco; Bilo', Vittorio; Monnot, Barnabé; Piliouras, Georgios; Vinci, Cosimo