Game-Theoretic Approaches to Optimization Problems in Communication Networks.

Abstract : In this chapter we consider fundamental optimization problems arising in communication networks. We consider scenarios where there is no central authority that coordinates the network users in order to achieve efficient solutions. Instead, the users act in an uncoordinated and selfish manner and reach solutions to the above problems that are consistent only with their selfishness. In this sense, the users act aiming to optimize their own objectives with no regard to the globally optimum system performance. Such a behavior poses several intriguing questions ranging from the definition of reasonable and practical models for studying it to the quantification of the efficiency loss due to the lack of users' cooperation. We present several results we achieved recently in this research area and propose interesting future research directions.
Type de document :
Chapitre d'ouvrage
Arie Koster and Xavier Muñoz. Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless, and Ad Hoc Networks., XXVII, Springer, pp.241-264, 2010, EATCS Texts in Theoretical Computer Science, 978-3-642-02249-4. 〈10.1007/978-3-642-02250-0_9〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00530965
Contributeur : Gianpiero Monaco <>
Soumis le : dimanche 31 octobre 2010 - 16:13:59
Dernière modification le : vendredi 28 janvier 2011 - 17:01:38

Identifiants

Citation

Vittorio Bilò, Ioannis Caragiannis, Angelo Fanelli, Michele Flammini, Christos Kaklamanis, et al.. Game-Theoretic Approaches to Optimization Problems in Communication Networks.. Arie Koster and Xavier Muñoz. Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless, and Ad Hoc Networks., XXVII, Springer, pp.241-264, 2010, EATCS Texts in Theoretical Computer Science, 978-3-642-02249-4. 〈10.1007/978-3-642-02250-0_9〉. 〈inria-00530965〉

Partager

Métriques

Consultations de la notice

39