{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:51:46Z","timestamp":1767340306917},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540727088"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72709-5_28","type":"book-chapter","created":{"date-parts":[[2007,10,22]],"date-time":"2007-10-22T05:10:28Z","timestamp":1193029828000},"page":"266-275","source":"Crossref","is-referenced-by-count":4,"title":["Transit Prices Negotiation: Combined Repeated Game and Distributed Algorithmic Approach"],"prefix":"10.1007","author":[{"given":"Dominique","family":"Barth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johanne","family":"Cohen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Loubna","family":"Echabbi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chahinez","family":"Hamlaoui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","volume-title":"25th Conference on Computer Communications, IEEE INFOCOM","author":"M. Afergan","year":"2006","unstructured":"Afergan, M.: Using repeated games to design incentive-based routing systems. In: 25th Conference on Computer Communications, IEEE INFOCOM, IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"28_CR2","first-page":"499","volume":"67","author":"J. Bertrand","year":"1883","unstructured":"Bertrand, J.: Theorie mathematique de la richesse sociale. Journal des Savants\u00a067, 499\u2013508 (1883)","journal-title":"Journal des Savants"},{"unstructured":"Barth, D., Cohen, J., Echabbi, L., Hamlaoui, C.: Transit price negotiation: a repeated game approach. In: PRiSM Report 2006\/76 (2006), \n                    \n                      http:\/\/www.prism.uvsq.fr","key":"28_CR3"},{"key":"28_CR4","volume-title":"Proceedings of the 2002 ACM Symposium on Principles of Distributed Computing","author":"J. Feigenbaum","year":"2002","unstructured":"Feigenbaum, J., Papadimitriou, C., Sami, R., Shenker, S.: A BGP-based mechanism for lowest-cost routing. In: Proceedings of the 2002 ACM Symposium on Principles of Distributed Computing, ACM Press, New York (2002)"},{"issue":"3","key":"28_CR5","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1109\/9.989076","volume":"47","author":"R. La","year":"2002","unstructured":"La, R., Anantharam, V.: Optimal routing control: Repeated game approach. IEEE Transactions on Automatic Control\u00a047(3), 437\u2013450 (2002)","journal-title":"IEEE Transactions on Automatic Control"},{"key":"28_CR6","volume-title":"Osborne. An Introduction to Game Theory","author":"J. Martin","year":"2003","unstructured":"Martin, J.: Osborne. An Introduction to Game Theory. Oxford University Press, USA (2003)"},{"unstructured":"Varga, A.: The omnet++ discrete event simulation system. In: European Simula- tion Multiconference (2001)","key":"28_CR7"}],"container-title":["Lecture Notes in Computer Science","Network Control and Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72709-5_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T05:46:37Z","timestamp":1619502397000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72709-5_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540727088"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72709-5_28","relation":{},"subject":[]}}