Obserwuj
Vittorio Bilò
Vittorio Bilò
Associate Professor in Computer Science, University of Salento, Lecce, Italy
Zweryfikowany adres z unisalento.it
Tytuł
Cytowane przez
Cytowane przez
Rok
Geometric clustering to minimize the sum of cluster sizes
V Bilo, I Caragiannis, C Kaklamanis, P Kanellopoulos
European Symposium on Algorithms, 460-471, 2005
872005
On the packing of selfish items
V Bilo
Proceedings 20th IEEE International Parallel & Distributed Processing …, 2006
632006
Almost envy-free allocations with connected bundles
V Bilò, I Caragiannis, M Flammini, A Igarashi, G Monaco, D Peters, ...
Games and Economic Behavior 131, 197-221, 2022
592022
A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games
V Bilò
Theory of Computing Systems 62 (5), 1288-1317, 2018
512018
Graphical congestion games
V Bilo, A Fanelli, M Flammini, L Moscardelli
Algorithmica 61 (2), 274-297, 2011
472011
The price of stability for undirected broadcast network design with fair cost allocation is constant
V Bilo, M Flammini, L Moscardelli
Games and Economic Behavior 123, 359-376, 2020
402020
Nash stable outcomes in fractional hedonic games: Existence, efficiency and computation
V Bilò, A Fanelli, M Flammini, G Monaco, L Moscardelli
Journal of Artificial Intelligence Research 62, 315-371, 2018
392018
Nash stability in fractional hedonic games
V Bilò, A Fanelli, M Flammini, G Monaco, L Moscardelli
International Conference on Web and Internet Economics, 486-491, 2014
342014
Dynamic taxes for polynomial congestion games
V Bilò, C Vinci
ACM Transactions on Economics and Computation (TEAC) 7 (3), 1-36, 2019
332019
On the price of stability of fractional hedonic games
V Bilò, A Fanelli, M Flammini, G Monaco, L Moscardelli
Proceedings of the 2015 International Conference on Autonomous Agents and …, 2015
332015
Sharing the cost of multicast transmissions in wireless networks
V Bilo, M Flammini, G Melideo, L Moscardelli, A Navarra
Theoretical Computer Science 369 (1-3), 269-284, 2006
322006
On nash equilibria in non-cooperative all-optical networks
V Bilo, M Flammini, L Moscardelli
Annual Symposium on Theoretical Aspects of Computer Science, 448-459, 2005
322005
On the crossing spanning tree problem
V Bilo, V Goyal, R Ravi, M Singh
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2004
322004
A catalog of EXISTS-R-complete decision problems about Nash equilibria in multi-player games
V Bilò, M Mavronicolas
33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), 2016
312016
Improved lower bounds on the price of stability of undirected network design games
V Bilo, I Caragiannis, A Fanelli, G Monaco
Theory of Computing Systems 52 (4), 668-686, 2013
262013
Existential-R-complete decision problems about symmetric Nash equilibria in symmetric multi-player games
V Bilò, M Mavronicolas
34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), 2017
252017
When ignorance helps: Graphical multicast cost sharing games
V Bilò, A Fanelli, M Flammini, L Moscardelli
Theoretical Computer Science 411 (3), 660-671, 2010
242010
The price of anarchy in all-optical networks
V Bilo, L Moscardelli
International Colloquium on Structural Information and Communication …, 2004
242004
Bounds on the price of stability of undirected network design games with three players
V Bilo, R Bove
Journal of Interconnection Networks 12 (01n02), 1-17, 2011
212011
On the impact of singleton strategies in congestion games
V Bilò, C Vinci
25th Annual European Symposium on Algorithms (ESA 2017), 2017
202017
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20