| 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 | 93 | 2022 |
| Dynamic taxes for polynomial congestion games V Bilò, C Vinci ACM Transactions on Economics and Computation (TEAC) 7 (3), 1-36, 2019 | 51 | 2019 |
| On the impact of singleton strategies in congestion games V Bilò, C Vinci 25th Annual European Symposium on Algorithms (ESA 2017), 2017 | 35 | 2017 |
| Coordination mechanisms, cost-sharing, and approximation algorithms for scheduling I Caragiannis, V Gkatzelis, C Vinci Web and Internet Economics: 13th International Conference, WINE 2017 …, 2017 | 22 | 2017 |
| The price of anarchy of affine congestion games with similar strategies V Bilò, C Vinci Theoretical Computer Science 806, 641-654, 2020 | 18 | 2020 |
| Uniform mixed equilibria in network congestion games with link failures V Bilò, L Moscardelli, C Vinci 45th International Colloquium on Automata, Languages, and Programming (ICALP …, 2018 | 18 | 2018 |
| Data-driven models of selfish routing: why price of anarchy does depend on network topology F Benita, V Bilò, B Monnot, G Piliouras, C Vinci International Conference on Web and Internet Economics, 252-265, 2020 | 17 | 2020 |
| On stackelberg strategies in affine congestion games V Bilò, C Vinci Theory of Computing Systems 63 (6), 1228-1249, 2019 | 15 | 2019 |
| On Stackelberg strategies in affine congestion games V Bilò, C Vinci Web and Internet Economics: 11th International Conference, WINE 2015 …, 2015 | 12 | 2015 |
| Congestion games with priority-based scheduling V Bilò, C Vinci International Symposium on Algorithmic Game Theory, 67-82, 2020 | 11 | 2020 |
| Better bounds on the adaptivity gap of influence maximization under full-adoption feedback G D'Angelo, D Poddar, C Vinci Artificial Intelligence 318, 103895, 2023 | 10 | 2023 |
| Nash social welfare in selfish and online load balancing V Bilò, G Monaco, L Moscardelli, C Vinci ACM Transactions on Economics and Computation 10 (2), 1-41, 2022 | 10 | 2022 |
| Non-atomic one-round walks in congestion games C Vinci Theoretical Computer Science 764, 61-79, 2019 | 10 | 2019 |
| Improved approximation factor for adaptive influence maximization via simple greedy strategies G D'Angelo, D Poddar, C Vinci arXiv preprint arXiv:2007.09065, 2020 | 8 | 2020 |
| The impact of selfishness in hypergraph hedonic games A Aloisio, M Flammini, C Vinci Proceedings of the AAAI Conference on Artificial Intelligence 34 (02), 1766-1773, 2020 | 8 | 2020 |
| Inequity aversion pricing in multi-unit markets M Flammini, M Mauro, M Tonelli, C Vinci Frontiers in Artificial Intelligence and Applications 325, 91-98, 2020 | 8 | 2020 |
| Distance Polymatrix Coordination Games. A Aloisio, M Flammini, B Kodric, C Vinci IJCAI, 3-9, 2021 | 7 | 2021 |
| On Multidimensional Congestion Games V Bilò, M Flammini, V Gallotti, C Vinci Algorithms 13 (10), 261, 2020 | 6 | 2020 |
| General opinion formation games with social group membership V Bilò, D Ferraioli, C Vinci Proceedings of the Thirty-First International Joint Conference on Artificial …, 2022 | 5 | 2022 |
| Coping with Selfishness in Congestion Games: Analysis and Design Via LP Duality V Bilò, C Vinci Springer Nature, 2023 | 4 | 2023 |
Vittorio BilòAssociate Professor in Computer Science, University of Salento, Lecce, ItalyVerified email at unisalento.it
