Transit prices negotiation: Combined repeated game and distributed algorithmic approach

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4465 LNCS, Issue , 2007, Pages 266-275

  Barth, Dominique ^a   Cohen, Johanne ^b   Echabbi, Loubna ^c   Hamlaoui, Chahinez ^a  

^a UNIVERSITY OF VERSAILLES   (France)

^b IORIA   (France)

^c National Institute of Posts and Telecommunications Morocco   (Morocco)

Author keywords

Distributed algorithmic; Interdomain routing; Repeated games

Indexed keywords

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; GAME THEORY; NETWORK ROUTING; PROBLEM SOLVING;

DISTRIBUTED ALGORITHMIC; INTERDOMAIN ROUTING; REPEATED GAMES;

COSTS;

EID: 37149000647     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72709-5_28     Document Type: Conference Paper

References (7)

1. M. Afergan. Using repeated games to design incentive-based routing systems. In 25th Conference on Computer Communications, IEEE INFOCOM, 2006.
2. D. Barth, J. Cohen, L. Echabbi, and C. Hamlaoui. Transit price negotiation : a repeated game approach. In PRiSM Report 2006/76, www.prism.uvsq.fr, 2006.
3. J. Bertrand. Theorie mathematique de la richesse sociale,. Journal des Savants, 67:499 - 508, 1883.
4. J. Feigenbaum, C. Papadimitriou, R. Sami, and S. Shenker. A BGP-based mechanism for lowest-cost routing. In Proceedings of the 2002 ACM Symposium on Principles of Distributed Computing., 2002.
5. R. La and V. Anantharam. Optimal routing control: Repeated game approach. IEEE Transactions on Automatic Control, 47(3) :437 - 450, 2002.
6. Martin J. Osborne. An Introduction to Game Theory. Oxford University Press, USA, 2003.
7. A. Varga. The omnet++ discrete event simulation system. In In European Simulation Multiconference, 2001.