[La barra dei collegamenti non è disponibile in questo Web]

 

Vittorio Bilò's

Publications

        


        International Journals

2008

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

2006

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

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

2004

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

 


        International Conferences

2009

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), LNCS 5609, Springer, pp. 17-26, 2009.

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), LNCS 5814, Springer, pp.311-322, 2009.

2008

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), LNCS 5162, Springer, pp. 108-119, 2008.

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.

V. Bilò, A. Fanelli, M. Flammini, L. Moscardelli: “Graphical Congestion Games”, Proc. of the 4th International Workshop on Internet and Network Economics (WINE), LNCS 5385, Springer, pp.70-81, 2008.

2007

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), LNCS 4508, Springer, pp. 231-240, 2007.

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), LNCS 4708, Springer, pp. 621-632, 2007.

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

2006

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

2005

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

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), LNCS 3669, Springer, pp. 460-471, 2005.

2004

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.

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.

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

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.

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

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), LNCS 3122, Springer, pp. 51-60, 2004.

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), LNCS 3341, Springer, pp. 172-183, 2004.

2003

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.

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), LNCS 2647, Springer, pp. 33-46, 2003.

2002

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

 


        National Conferences

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”, 2005.