Publications

Books

1. V. Bilò, C. Vinci: “Copying with Selfishness in Congestion Games - Analysis and Design via LP Duality”, Monographs in Theoretical Computer Science, Springer, 2023.

International Journals

43. V. Bilò, C. Vinci: “Congestion Games with Priority-Based Scheduling”, Theoretical Computer Science, 974:114094 2023.

42. V. Bilò, L. Moscardelli, C. Vinci: “Uniform Mixed Equilibria in Network Congestion Games with Link Failures”, Mathematics of Operations Research, to appear.

41. V. Bilò, L. Gourvès, J. Monnot: “Project Games”, Theoretical Computer Science, 940:97-111, 2023.

40. V. Bilò, G. Monaco, L. Moscardelli, C. Vinci: “Nash Social Welfare in Selfish and Online Load Balancing”, ACM Transactions on Economics and Computation, 10(2):1-41, 2022.

39. V. Bilò, M. Flammini, G. Monaco, L. Moscardelli: “Pricing Problems with Buyer Preselection”, Journal of Artificial Intelligence Research, 74:1791-1822, 2022.

38. D. Bilò, V. Bilò, P. Lenzner, L. Molitor: “Topological Influence and Locality in Swap Schelling Games”, Autonomous Agents and Multi-Agent Systems, 36(2):47, 2022. 

37. V. Bilò: “On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games”, Theoretical Computer Science, 906:94-113, 2022.

36. V. Bilò, I. Caragiannis, M. Flammini, A. Igarashi, G. Monaco, D. Peters, C. Vinci, W. S. Zwicker: “Almost Envy-Free Allocations with Connected Bundles”, Games and Economic Behavior, 131:197-221, 2022.

35. V. Bilò, M. Mavronicolas: “\exists ℝ–Complete Decision Problems about (Symmetric) Nash Equilibria in (Symmetric) Multi-Player Games”, ACM Transactions on Economics and Computation, 9(3):14.1-14.25, 2021.

34. V. Bilò, M. Flammini, L. Moscardelli: “On Nash Equilibria in Non-Cooperative All-Optical Networks”, Algorithms, 14(1):15, 2021.

33. V. Bilò, M. Mavronicolas: “The Complexity of Computational Problems about Nash Equilibria in Symmetric Win-Lose Games”, Algorithmica, 83(2):447-530, 2021. 

32. V. Bilò, M. Flammini, G. Monaco, L. Moscardelli: “Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions”, Distributed Computing, 34(1):1-14: 2021.

31. V. Bilò, M. Flammini, V. Gallotti, C. Vinci: “On Multidimensional Congestion Games”, Algorithms, 13(10):261, 2020.

30. V. Bilò, F. Cellinese, G. Melideo, G. Monaco: “Selfish Colorful Bin Packing Games”, Journal of Combinatorial Optimization, 40(3):610-635, 2020.

29. V. Bilò, M. Flammini, L. Moscardelli: “The Price of Stability for Undirected Broadcast Network Design with Fair Cost Allocation is Constant”, Games and Economic Behavior, 123: 359-376, 2020. Special Issue: Selected Papers on Algorithmic Game Theory from STOCS/FOCS/SODA 2013. 

28. V. Bilò, C. Vinci: “The Price of Anarchy of Affine Congestion Games with Similar Strategies”, Theoretical Computer Science, 806:641-654, 2020. Special Issue: Selected Papers from the 19th Italian Conference on Theoretical Computer Science.

27. V. Bilò, C. Vinci: “Dynamic Taxes for Polynomial Congestion Games”, ACM Transactions on Economics and Computation, 7(3):15.1-15.36, 2019. Special Issue: Selected Papers from the 17th ACM Conference on Economics and Computation. 

26. V. Bilò, C. Vinci: “On Stackelberg Strategy in Affine Congestion Games”, Theory of Computing Systems, 63(6):1228-1249, 2019.

25. V. Bilò, A. Fanelli, M. Flammini, G. Monaco, L. Moscardelli: “Nash Stable Outcomes in Fractional Hedonic Games: Existence, Efficiency and Computation”, Journal of Artificial Intelligence Research, 62:315-371, 2018.

24. V. Bilò, A. Fanelli, L. Moscardelli: “Opinion Formation Games with Dynamic Social Influences”, Theoretical Computer Science, 746: 73-87, 2018.

23. V. Bilò: “A Unifying Tool for Bounding the Quality of Non-Cooperative Solutions in Weighted Congestion Games”, Theory of Computing Systems, 62(5): 1288-1317, 2018.

22. V. Bilò, M. Flammini, G. Monaco: “Approximationg the Revenue Maximization Problem with Sharp Demands”, Theoretical Computer Science, 662: 9-30, 2017.

21. V. Bilò, A. Fanelli, L. Moscardelli: “On Lookahead Equilibria in Congestion Games”, Mathematical Structures in Computer Science, 27(2): 197-214, 2017.

20. V. Bilò, M. Paladini: “On the Performance of Mildly Greedy Players in Cut Games”, Journal of Combinatorial Optimization, 32(4): 1036-1051, 2016. Special Issue: Selected Papers from the 20th Annual International Computing and Combinatorics Conference.

19. V. Bilò, A. Fanelli, M. Flammini, G. Monaco, L. Moscardelli: “The Price of Envy-Freeness in Machine Scheduling”, Theoretical Computer Science, 613: 65-78, 2016.

18. V. Bilò, M. Flammini, G. Monaco, L. Moscardelli: “Some Anomalies of Farsighted Strategic Behavior”, Theory of Computing Systems, 56(1): 156-180, 2015. Special Issue: Selected Papers from the 10th Workshop on Approximation and Online Algorithms. 

17. A. Angelucci, V. Bilò, M. Flammini, L. Moscardelli: “On the Sequential Price of Anarchy of Isolation Games”, Journal of Combinatorial Optimization, 29(1): 165-181, 2015. Special Issue: Selected Papers from the 19th Annual International Computing and Combinatorics Conference.

16. D. Bilò, V. Bilò: “New Bounds for the Balloon Popping Problem”, Journal of Combinatorial Optimization, 29(1): 182-196, 2015. Special Issue: Selected Papers from the 19th Annual International Computing and Combinatorics Conference.

15. V. Bilò, M. Mavronicolas: “The Complexity of Rational and Irrational Nash Equilibria”, Theory of Computing Systems, 54(3): 491-527, 2014. Special Issue: Selected Papers from the 4th International Symposium on Algorithmic Game Theory.

14. V. Bilò, A. Celi, M. Flammini, V. Gallotti: “Social Context Congestion Games”, Theoretical Computer Science, 514: 21-35, 2013. Special Issue: Graph Algorithms and Applications: in Honor of Professor Giorgio Ausiello.

13. V. Bilò, I. Caragiannis, A. Fanelli, G. Monaco: “Improved Lower Bounds on the Price of Stability of Undirected Network Design Games”, Theory of Computing Systems, 52(4): 668-686, 2013.

12. V. Bilò, R. Bove: “Bounds on the Price of Stability of Undirected Network Design with Three Players”, Journal of Interconnection Networks, 12(1-2): 1-17, 2011.

11. V. Bilò, M. Flammini: “Extending the Notion of Rationality of Selfish Agents: Second Order Nash Equilibria”, Theoretical Computer Science, 412(22): 2296-2311, 2011.

10. V. Bilò, A. Fanelli, M. Flammini, L. Moscardelli: “Performance of One-Round Walks in Linear Congestion Games”, Theory of Computing Systems, 49(1): 24-45, 2011. Special Issue: Selected Papers from the 2nd International Symposium on Algorithmic Game Theory.

9. V. Bilò, A. Fanelli, M. Flammini, L. Moscardelli: “Graphical Congestion Games”, Algorithmica, 61(2): 274-297, 2011.

8. V. Bilò, M. Flammini, G. Monaco, L. Moscardelli: “On the performances of Nash Equilibria in Isolation Games”, Journal of Combinatorial Optimization, 22(3): 378-391, 2011. Special Issue: Selected Papers from the 15th International Computing and Combinatorics Conference.

7. V. Bilò: “The Price of Nash Equilibria in Multicast Transmissions Games”, Journal of Interconnection Networks, 11(3-4): 97-120, 2010.

6. V. Bilò, A. Fanelli, M. Flammini, G. Melideo, L. Moscardelli: “Designing Fast Converging Cost Sharing Methods for Multicast Transmissions”, Theory of Computing Systems, 47(2): 507-530, 2010.

5. V. Bilò, A. Fanelli, M. Flammini, L. Moscardelli: “When Ignorance Helps: Graphical Multicast Cost Sharing Games”, Theoretical Computer Science, 411(3): 660-671, 2010.

4. V. Bilò, M. Flammini, G. Melideo, L. Moscardelli: “On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks”, Wireless Networks, 12(2): 147-157, 2008.

3. V. Bilò, M. Flammini, G. Melideo, L. Moscardelli, A. Navarra: “Sharing the Cost of Multicast Transmissions in Wireless Networks”, Theoretical Computer Science, 369(1-3): 269-284, 2006.

2. V. Bilò, M. Flammini, L. Moscardelli: “Pareto Approximations for the Bicriteria Scheduling Problem”, Journal of Parallel and Distributed Computing, 66(3): 393-402, 2006.

1. V. Bilò, M. Flammini, R. Giovannelli: “Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem”, Journal of Parallel and Distributed Computing, 64(9): 1086-1100, 2004.

International (Refereed) Conferences

71. A. Aloisio, V. Bilò, A. M. Caruso, M. Flammini, C. Vinci: “Approximately Fair Allocation of Indivisible Items with Random Valuations”, Proc. of the 23rd International Conference on Autonomous Agents and Multiagent Systems (AAMAS), ACM Press, to appear.

70. V. Bilò, M. Flammini, G. Monaco, L. Moscardelli, C. Vinci: “On Green Sustainability of Resource Selection Games with Equitable Cost-Sharing”, Proc. of the 23rd International Conference on Autonomous Agents and Multiagent Systems (AAMAS), ACM Press, to appear.

69. V. Bilò, C. Vinci: “Enhancing the Efficiency of Altruism and Taxes in Affine Congestion Games through Signalling”, Proc. of the 38th AAAI Conference on Artificial Intelligence (AAAI), AAAI Press, pp. 9511-9518, 2024.

68. V. Bilò, L. Bove, C. Vinci: “Utility-Sharing Games: How to Improve the Efficinecy with Limited Subsidies”, Proc. of the 24th Italian Conference on Theoretical Computer Science (ICTCS), CEUR Workshop Proceedings, pp. 314-327, 2023.

67. V. Bilò, K. A. Hansen, M. Mavronicolas: “Computational Complexity of Decision Problems about Nash Equilibria in Win-Lose Multi-Player Games”, Proc. of the 16th Symposium on Algorithmic Game Theory (SAGT), LNCS 14238, Springer, pp. 40-57, 2023.

66. D. Bilò, V. Bilò, M. Doering, P. Lenzner, L. Molitor, J. Schmidt: “Continuous Schelling Games”, Proc. of the 32nd International Joint Conference on Artificial Intelligence (IJCAI), pp. 2520-2527, 2023.

65. V. Bilò, D. Ferraioli, C. Vinci: “General Opinion Formation Games with Social Group Membership”, Proc. of the 31st International Joint Conference on Artificial Intelligence (IJCAI), pp. 88-94, 2022.

64. D. Bilò, V. Bilò, P. Lenzner, L. Molitor: “Tolerance is Necessary for Stability: Single-Peaked Swap Schelling Games”, Proc. of the 31st International Joint Conference on Artificial Intelligence (IJCAI), pp. 81-87, 2022.

63. V. Bilò, G. Monaco, L. Moscardelli: “Hedonic Games with Fixed-Size Coalitions”, Proc. of the 36th AAAI Conference on Artificial Intelligence (AAAI), AAAI Press, pp. 9287-9295, 2022.

62. F. Benita, V. Bilò, B. Monnot, G, Piliouras, C. Vinci: “Data-Driven Models of Selfish Routing: Why Price of Anarchy Does Depend on Network Topology”, Proc. of the 16th Conference on Web and Internet Economics (WINE), LNCS 12495, Springer, pp. 252-265, 2020. 

61. V. Bilò, G. Monaco, L. Moscardelli, C. Vinci: “Nash Social Welfare in Selfish and Online Load Balancing”, Proc. of the 16th Conference on Web and Internet Economics (WINE), LNCS 12495, Springer, pp. 323-337, 2020.

60. V. Bilò, C. Vinci: “Congestion Games with Priority-Based Scheduling”, Proc. of the 13th Symposium on Algorithmic Game Theory (SAGT), LNCS 12283, Springer, pp. 67-82, 2020. 

59. D. Bilò, V. Bilò, P. Lenzner, L. Molitor: “Topological Influence and Locality in Swap Schelling Games”, Proc. of the 45th International Symposium on Mathematical Foundations of Computer Science (MFCS), LIPIcs 170, Leibniz-Zentrum fuer Informatik, pp. 15:1-15:15, 2020.

58. V. Bilò, M. Flammini, C. Vinci: “The Quality of Content Publishing in the Digital Era”, Proc. of the 24th European Conference on Artificial Intelligence (ECAI), FAIA 325, IOS Press, pp. 35-42, 2020. 

57. V. Bilò, L. Gourvès, J. Monnot: “On a Simple Hedonic Game with Graph-Restricted Communication”, Proc. of the 12th International Symposium on Algorithmic Game Theory (SAGT), LNCS 11801, Springer, pp. 252-265, 2019. 

56. V. Bilò, A. Fanelli, M. Flammini, G. Monaco, L. Moscardelli: “Optimality and Nash Stability in Additively Separable Generalized Group Activity Selection Problems”, Proc. of the 28th International Joint Conference on Artificial Intelligence (IJCAI), pp. 102-108, 2019.

55. V. Bilò, L. Gourves, J. Monnot: “Project Games”, Proc. of the 11th International Conference on Algorithms and Complexity (CIAC), LNCS 11485, pp. 75-86, 2019. 

54. V. Bilò, I. Caragiannis, M. Flammini, A. Igarashi, G. Monaco, D. Peters, C. Vinci, W. S. Zwicker: “Almost Envy-Free Allocations with Connected Bundles”, Proc. of the 10th Innovations in Theoretical Computer Science Conference (ITCS), LIPIcs 124, pp. 14:1-14:21, 2019.

53. V. Bilò, C. Vinci: “The Price of Anarchy of Affine Congestion Games with Similar Strategies”, Proc. of the 19th Italian Conference on Theoretical Computer Science (ICTCS), CEUR Workshop Proceedings, pp. 48-59, 2018.

52. V. Bilò, M. Flammini, G. Monaco, L. Moscardelli: “Pricing Problems with Buyer Preselection”, Proc. of the 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS), Leibniz-Zentrum fuer Informatik, pp. 47:1-47:16, 2018.

51. V. Bilò, F. Cellinese, G. Melideo, G. Monaco: “On Colorful Bin Packing Games”, Proc. of the 24th International Computing and Combinatorics Conference (COCOON), LNCS 10976, Springer, pp. 280-292, 2018.

50. V. Bilò, M. Flammini, G. Monaco, L. Moscardelli: “On the Impact of Buyers Preselection in Pricing Problems”, Proc. of the 17th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), ACM Press, pp. 1871-1873, 2018.

49. V. Bilò, L. Moscardelli, C. Vinci: “Uniform Mixed Equilibria in Network Congestion Games with Link Failures”, Proc. of the 45th International Colloqium on Automata, Languages, and Programming (ICALP), Leibniz-Zentrum fuer Informatik, pp. 146:1-146:14, 2018.

48. V. Bilò, C. Vinci: “On the Impact of Singleton Strategies in Congestion Games”, Proc. of the 25th Annual European Symposium on Algorithms (ESA), Leibniz-Zentrum fuer Informatik, pp. 17:1-17:14, 2017.

47. V. Bilò, I. Caragiannis, A. Fanelli, M. Flammini, G. Monaco: “Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems”, Proc. of the 44th International Colloqium on Automata, Languages, and Programming (ICALP), Leibniz-Zentrum fuer Informatik, pp. 125:1-125:13, 2017.

46. V. Bilò, M. Mavronicolas: “\exists ℝ-Complete Decision Problems about Symmetric Nash Equilibria in Symmetric Multi-Player Games”, Proc. of the 34th International Symposium on Theoretical Aspects of Computer Science (STACS), Leibniz-Zentrum fuer Informatik, pp. 13:1-13:14, 2017.

45. V. Bilò, A. Fanelli, L. Moscardelli: “Opinion Formation Games with Dynamic Social Influences”, Proc. of the 12th Conference on Web and Internet Economics (WINE), LNCS 10123, Springer, pp. 444-458, 2016.

44. V. Bilò: “On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games”, Proc. of the 9th International Symposium on Algorithmic Game Theory (SAGT), LNCS 9928, Springer, pp. 93-104, 2016.

43. V. Bilò, C. Vinci: “Dynamic Taxes for Polynomial Congestion Games”, Proc. of the 17th ACM Conference on Economics and Computation (EC), ACM Press, pp. 839-856, 2016.

42. V. Bilò, M. Mavronicolas: “A Catalog of $ℝ-Complete Decision Problems about Nash Equilibria in Multi-Player Games”, Proc. of the 33rd International Symposium on Theoretical Aspects of Computer Science (STACS), Leibniz-Zentrum fuer Informatik, pp. 17:1-17:13, 2016.

41. V. Bilò, C. Vinci: “On Stackelberg Strategy in Affine Congestion Games”, Proc. of the 11th Conference on Web and Internet Economics (WINE), LNCS 9470, Springer, pp.  132-145. 2015.

40. V. Bilò, M. Flammini, G. Monaco, L. Moscardelli: “Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions”, Proc. of the 11th Conference on Web and Internet Economics (WINE), LNCS 9470, Springer, pp. 118-131, 2015.

39. V. Bilò, A. Fanelli, M. Flammini, G. Monaco, L. Moscardelli: “On the Price of Stability of Fractional Hedonic Games”, Proc. of the International Conference on Autonomous Agents & Multiagent Systems (AAMAS), ACM Press, pp. 1239-1247, 2015.

38. V. Bilò, A. Fanelli, M. Flammini, G. Monaco, L. Moscardelli: “Nash Stability in Fractional Hedonic Games”, Proc. of the 10th Conference on Web and Internet Economics (WINE), LNCS 8877, Springer, pp. 486-491, 2014.

37.  C. Vinci, V. Bilò: “On the Stackelberg Fuel Pricing Game”,  Proc. of the 15th Italian Conference on Theoretical Computer Science (ICTCS), CEUR Workshop Proceedings, pp. 213-224, 2014.

36. V. Bilò, A. Fanelli, M. Flammini, G. Monaco, L. Moscardelli: “The Price of Envy-Freeness in Machine Scheduling”, Proc. of the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS), LNCS 8653, Springer, pp. 106-117, 2014.

35. V. Bilò, M. Flammini, G. Monaco: “Approximationg the Revenue Maximization Problem with Sharp Demands”, Proc. of the 14th Scandinavian Symposium and Workshops on Algorithmic Theory (SWAT), Lecture Notes in Computer Science 8503, Springer, pp. 74-85, 2014.

34. V. Bilò: “On Linear Congestion Games with Altruistic Social Context”, Proc. of the 20th Annual International Computing and Combinatorics Conference (COCOON), Lecture Notes in Computer Science 8591, Springer, pp. 547-558, 2014.

33. V. Bilò, M. Paladini: “On the Performance of Mildly Greedy Players in Cut Games”, Proc. of the 20th Annual International Computing and Combinatorics Conference (COCOON), Lecture Notes in Computer Science 8591, Springer, pp. 513-524, 2014.

32. V. Bilò, A. Fanelli, L. Moscardelli: “On Lookahead Equilibria in Linear Congestion Games”, Proc. of the 9th International Workshop On Internet And Network Economics (WINE), Lecture Notes in Computer Science 8289, Springer, pp. 54-67, 2013.

31. V. Bilò, M. Flammini, L. Moscardelli: “The Price of Stability for Undirected Broadcast Network Design with Fair Cost Allocation is Constant”, Proc. of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society, pp. 638-647, 2013.

30. A. Angelucci, V. Bilò, M. Flammini, L. Moscardelli: “On the Sequential Price of Anarchy of Isolation Games”, Proc. of the 19th Annual International Computing and Combinatorics Conference (COCOON), Lecture Notes in Computer Science 7936, Springer, pp. 17-28, 2013.

29. D. Bilò, V. Bilò: “New Bounds for the Balloon Popping Problem”, Proc. of the 19th Annual International Computing and Combinatorics Conference (COCOON), Lecture Notes in Computer Science 7936, Springer, pp. 5-16, 2013.

28. V. Bilò, M. Flammini, G. Monaco, L. Moscardelli: “Some Anomalies of Farsighted Strategic Behavior”, Proc. of the 10th Workshop on Approximation and Online Algorithms (WAOA), Lecture Notes in Computer Science 7846, Springer, pp. 229-241, 2012.

27. V. Bilò: “A Unifying Tool for Bounding the Quality of Non-Cooperative Solutions in Weighted Congestion Games”, Proc. of the 10th Workshop on Approximation and Online Algorithms (WAOA), Lecture Notes in Computer Science 7846, Springer, pp. 215-228, 2012.

26. V. Bilò, M. Mavronicolas: “The Complexity of Decision Problems about Nash Equilibria in Win-Lose Games”, Proc. of the 5th International Symposium on Algorithmic Game Theory (SAGT), Lecture Notes in Computer Science 7615, Springer, pp. 37-48, 2012.

25. V. Bilò, M. Flammini, V. Gallotti: “On Bidimensional Congestion Games”, Proc. of the 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Lecture Notes in Computer Science 7355, Springer, pp. 147-158, 2012.

24. V. Bilò, M. Mavronicolas: “The Complexity of Rational and Irrational Nash Equilibria”, Proc. of the 4th International Symposium on Algorithmic Game Theory (SAGT), Lecture Notes in Computer Science 6982, Springer, pp. 200-211, 2011.

23. V. Bilò, A. Celi, M. Flammini, V. Gallotti: “Social Context Congestion Games”, Proc. of the 18th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Lecture Notes in Computer Science 6796, Springer, pp. 282-293, 2011.

22. V. Bilò, I. Caragiannis, A. Fanelli, G. Monaco: “Improved Lower Bounds on the Price of Stability of Undirected Network Design Games”, Proc. of the 3rd International Symposium on Algorithmic Game Theory (SAGT), Lecture Notes in Computer Science 6386, Springer, pp. 90-101, 2010.

21. V. Bilò, A. Fanelli: “Computing Exact and Approximate Nash Equilibria in 2-Player Games”, Proc. of the 6th International Conference on Algorithmic Aspects in Information and Management (AAIM), Lecture Notes in Computer Science 6124, Springer, pp. 58-69, 2010.

20. V. Bilò, A. Fanelli, M. Flammini, L. Moscardelli: “Performances of One-Round Walks in Linear Congestion Games”, Proc. of the 2nd International Symposium on Algorithmic Game Theory (SAGT), Lecture Notes in Computer Science 5814, Springer, pp. 311-322, 2009.

19. V. Bilò, M. Flammini, G. Monaco, L. Moscardelli: “On the Performances of Nash Equilibria in Isolation Games”, Proc. of the 15th Annual International Conference on Computing and Combinatorics (COCOON), Lecture Notes in Computer Science 5609, Springer, pp. 17-26, 2009.

18. V. Bilò, A. Fanelli, M. Flammini, L. Moscardelli: “Graphical Congestion Games”, Proc. of the 4th International Workshop On Internet And Network Economics (WINE), Lecture Notes in Computer Science 5385, Springer, pp. 70-81, 2008.

17. V. Bilò, A. Fanelli, M. Flammini, L. Moscardelli: “Graphical Congestion Games with Linear Latencies”, Proc. of the 20th ACM Symposium on Parallelism on Algorithms and Architectures (SPAA), ACM press, pp. 194-196, 2008.

16. V. Bilò, A. Fanelli, M. Flammini, L. Moscardelli: “When Ignorance Helps: Graphical Multicast Cost Sharing Games”, Proc. of the 33rd International Symposium on Mathematical Foundations of Computer Science (MFCS), Lecture Notes in Computer Science 5162, Springer, pp. 108-119, 2008.

15. V. Bilò: “The Price of Nash Equilibria in Multicast Transmissions Games”, Proc. of the 18th International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science 4835, Springer, pp. 390-401, 2007.

14. V. Bilò, M. Flammini: “Extending the Notion of Rationality of Selfish Agents: Second Order Nash Equilibria”, Proc. of the 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS), Lecture Notes in Computer Science 4708, Springer, pp. 621-632, 2007.

13. V. Bilò: “On Satisfiability Games and the Power of Congestion Games”, Proc. of the 3rd International Conference on Algorithmic Aspects in Information and Management (AAIM), Lecture Notes in Computer Science 4508, Springer, pp. 231-240, 2007.

12. V. Bilò: “On the Packing of Selfish Items”, Proc. of the 20th IEEE International Parallel and Distributed Processing Symposium (IPDPS), IEEE Computer Society, 2006.

11. V. Bilò, I. Caragiannis, C. Kaklamanis, P. Kanellopoulos: “Geometric clustering to minimize the sum of cluster sizes”, Proc. of the 13th Annual European Symposium on Algorithms (ESA), Lecture Notes in Computer Science 3669, Springer, pp. 460-471, 2005.

10. V. Bilò, M. Flammini, L. Moscardelli: “On Nash Equilibria in Non-Cooperative All-Optical Networks”, Proc. of the 37th Symposium on Theoretical Aspects of Computer Science (STACS), Lecture Notes in Computer Science 3404, Springer, pp. 448-459, 2005.

9. V. Bilò, M. Flammini, G. Melideo, L. Moscardelli: “On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks”, Proc. of the 15th Annual International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science 3341, Springer, pp. 172-183, 2004.

8. V. Bilò, V. Goyal, R. Ravi, M. Singh: “On the Crossing Spanning Tree Problem”, Proc. of the 7th International Workshop on Approximation Algorithms for Combinatorial Problems (APPROX), Lecture Notes in Computer Science 3122, Springer, pp. 51-60, 2004.

7. V. Bilò, G. Melideo: “An Improved Approximation Algorithm for the Minimum Energy Consumption Broadcast Subgraph”, Proc. of the EURO-PAR 2004 Parallel Processing, Lecture Notes in Computer Science 3149, Springer, pp. 949-956, 2004.

6. V. Bilò, C. Di Francescomarino, M. Flammini, G. Melideo: “Sharing the Cost of Multicast Transmissions in Wireless Networks”, Proc. of the 16th Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press, pp. 180-187, 2004.

5. V. Bilò, L. Moscardelli: “The Price of Anarchy in All-Optical Networks”, Proc. of the 11th Colloquium on Structural Information and Communication Complexity (SIROCCO), Lecture Notes in Computer Science 3104, Springer, pp. 13-22, 2004.

4. V. Bilò, M. Flammini, L. Moscardelli: “Pareto Approximations for the Bicriteria Scheduling Problem”, Proc. of the 18th International Parallel and Distributed Processing Symposium (IPDPS), IEEE Computer Society, 2004.

3. V. Bilò, M. Flammini: “On the IP Routing Tables Minimization with Addresses Reassignments”, Proc. of the 18th International Parallel and Distributed Processing Symposium (IPDPS), IEEE Computer Society, 2004.

2. V. Bilò, M. Flammini, R. Giovannelli: “Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem”, Proc. of the 2nd International Workshop on Experimental and Efficient Algorithms (WEA), Lecture Notes in Computer Science 2647, Springer, pp. 33-46, 2003.  

1. V. Bilò, A. Di Pasquale, F. Fioravanti, M. Flammini, L. Forlizzi, F. Lo Presti, G. Melideo, E. Nardelli, A. Navarra, G. Proietti: “Quality of Service in Wireless Networks”, Proc. of the IEEE IPDPS Workshop on Wireless, Mobile and Ad Hoc Networks (WMAN), IEEE Computer Society, 2003.

Volume Editor (Proceedings)

2. V. Bilò, M. Flammini: Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT 2017), L'Aquila, Italy, September 12-14, 2017, Lecture Notes in Computer Science 10504, Springer 2017.

1. V. Bilò, A. Caruso: Proceedings of the 17th Italian Conference on Theoretical Computer Science (ICTCS 2016), Lecce, Italy, September 7-9, 2016. CEUR Workshop Proceedings 1720, CEUR-WS.org 2016.

Book Chapters

1. V. Bilò, I. Caragiannis, A. Fanelli, M. Flammini, C. Kaklamanis, G. Monaco, L. Moscardelli: “Game-Theoretic Approaches to Optimization Problems in Communication Networks”. In Graphs and Algorithms in Communication Networks, Springer-Verlag, 2009.

Surveys and Letters

2. V. Bilò, M. Flammini, L. Moscardelli. The Price of Stability of Fair Undirected Broadcast Games is Constant. SIGecom Exchanges, 12(2): 42-45, 2013.

1. V. Bilò. One-round Walks in Linear Congestion Games. Bulletin of the EATCS, 101: 45-63, 2010.

Invited Contributions in Unrefereed Conferences

2. V. Bilò, M. Flammini: “On Multiprocessor Scheduling under Multiple Objectives”, Proc. of the International Conference on Operations Research (OR), 2002.

1. V. Bilò, M. Flammini: “Time vs Memory Tradeoffs for Multiprocessor Scheduling”, Proc. of the 33rd Annual Conference of the Italian Operations Research Society (AIRO), 2002.

Ph.D. Thesis

V. Bilò, “Pricing and Equilibria in Non-Cooperative Networks”, University of L'Aquila, 2005.