{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T10:10:09Z","timestamp":1725617409733},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642248283"},{"type":"electronic","value":"9783642248290"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24829-0_25","type":"book-chapter","created":{"date-parts":[[2011,10,3]],"date-time":"2011-10-03T09:11:38Z","timestamp":1317633098000},"page":"278-289","source":"Crossref","is-referenced-by-count":1,"title":["Strategic Pricing in Next-Hop Routing with Elastic Demands"],"prefix":"10.1007","author":[{"given":"Elliot","family":"Anshelevich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ameya","family":"Hate","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Koushik","family":"Kar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"Full version can be found at, http:\/\/www.cs.rpi.edu\/~eanshel\/pubs.html"},{"issue":"6","key":"25_CR2","doi-asserted-by":"publisher","first-page":"1148","DOI":"10.1109\/JSAC.2007.070809","volume":"25","author":"D. Acemoglu","year":"2007","unstructured":"Acemoglu, D., Johari, R., Ozdaglar, A.E.: Partially optimal routing. IEEE Journal on Selected Areas in Communications\u00a025(6), 1148\u20131160 (2007)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"25_CR3","unstructured":"Anshelevich, E., Shepherd, B., Wilfong, G.: Strategic Network Formation through Peering and Service Agreements. Games and Economic Behavior (2011), doi:10.1016\/j.geb, 01.002"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-540-92185-1_44","volume-title":"Internet and Network Economics","author":"E. Anshelevich","year":"2008","unstructured":"Anshelevich, E., Wilfong, G.: Network Formation and Routing by Strategic Agents using Local Contracts. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol.\u00a05385, pp. 386\u2013393. Springer, Heidelberg (2008)"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Archer, A., Tardos, \u00c9.: Frugal path mechanisms. ACM Transactions on Algorithms, TALG (2007)","DOI":"10.1145\/1219944.1219948"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Chawla, S., Niu, F.: The Price of Anarchy in Bertrand Games. In: EC 2009 (2009)","DOI":"10.1145\/1566374.1566418"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-540-79309-0_8","volume-title":"Algorithmic Game Theory","author":"S. Chawla","year":"2008","unstructured":"Chawla, S., Roughgarden, T.: Bertrand Competition in Networks. In: Monien, B., Schroeder, U.-P. (eds.) SAGT 2008. LNCS, vol.\u00a04997, pp. 70\u201382. Springer, Heidelberg (2008)"},{"issue":"1","key":"25_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s00446-005-0122-y","volume":"18","author":"J. Feigenbaum","year":"2005","unstructured":"Feigenbaum, J., Papadimitriou, C.H., Sami, R., Shenker, S.: A BGP-based mechanism for lowest-cost routing. Distributed Computing\u00a018(1), 61\u201372 (2005)","journal-title":"Distributed Computing"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Feigenbaum, J., Schapira, M., Shenker, S.: Distributed Algorithmic Mechanism Design. In: Nisan, N., Roughgarden, T., Tardos, \u00c9., Vazirani, V.V. (eds.) Algorithmic Game Theory, ch. 14, Cambridge University Press, Cambridge","DOI":"10.1145\/570810.570812"},{"issue":"4","key":"25_CR10","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1080\/15427951.2008.10129169","volume":"5","author":"A. Hall","year":"2008","unstructured":"Hall, A., Nikolova, E., Papadimitriou, C.: Incentive-Compatible Interdomain Routing with Linear Utilities. Internet Mathematics\u00a05(4), 395\u2013410 (2008) (Special Issue for Selected papers from WINE 2007)","journal-title":"Internet Mathematics"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Hayrapetyan, A., Tardos, \u00c9., Wexler, T.: A network pricing game for selfish traffic. In: Distributed Computing (March 2007)","DOI":"10.1007\/s00446-006-0020-y"},{"key":"25_CR12","volume-title":"Proceedings of the Internet Global Summit","author":"G. Huston","year":"1999","unstructured":"Huston, G.: Interconnection, peering, and settlements. In: Proceedings of the Internet Global Summit. The Internet Society, San Jose (1999)"},{"issue":"2","key":"25_CR13","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.geb.2005.08.010","volume":"56","author":"R. Johari","year":"2005","unstructured":"Johari, R., Mannor, S., Tsitsiklis, J.N.: A contract-based model for directed network formation. Games and Economic Behavior\u00a056(2), 201\u2013224 (2005)","journal-title":"Games and Economic Behavior"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Levin, H., Schapira, M., Zohar, A.: Interdomain Routing and Games. SIAM Journal on Computing (SICOMP); Special Issue on Selected Papers from STOC 2008","DOI":"10.1145\/1374376.1374388"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Ozdaglar, A., Srikant, R.: Incentives and Pricing in Communication Networks. In: Nisan, N., Roughgarden, T., Tardos, \u00c9., Vazirani, V.V. (eds.) Algorithmic Game Theory, ch. 22, Cambridge University Press, Cambridge","DOI":"10.1017\/CBO9780511800481.024"},{"key":"25_CR16","unstructured":"Papadimitriou, C., Valiant, G.: A New Look at Selfish Routing. Innovations in Computer Science (2010)"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Rekhter, Y., Li, T.: A Border Gateway Protocol 4 (BGP-4). RFC 4271 (January 2006)","DOI":"10.17487\/rfc4271"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Roughgarden, T., Tardos, \u00c9.: How Bad is Selfish Routing? Journal of the ACM (2002)","DOI":"10.1145\/506147.506153"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Schapira, M., Zhu, Y., Rexford, J.: Putting BGP on the right path: A case for next-hop routing. In: Proceedings of HotNets-IX, Monterey, CA (October 2010)","DOI":"10.1145\/1868447.1868450"},{"issue":"2","key":"25_CR20","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1109\/TWC.2004.842950","volume":"4","author":"V. Srinivasan","year":"2005","unstructured":"Srinivasan, V., Nuggehalli, P., Chiasserini, C.F., Rao, R.R.: An Analytical Approach to the Study of Cooperation in Wireless Ad Hoc Networks. IEEE Transactions on Wireless Communications\u00a04(2), 722\u2013733 (2005)","journal-title":"IEEE Transactions on Wireless Communications"},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"Xi, Y., Yeh, E.M.: Pricing, competition, and routing in relay networks. In: Proceedings of the 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009 (2009)","DOI":"10.1109\/ALLERTON.2009.5394772"},{"key":"25_CR22","first-page":"136","volume-title":"Next-Generation Internet Architectures and Protocols","author":"M. Yuksel","year":"2010","unstructured":"Yuksel, M., Gupta, A., Kar, K., Kalyanaraman, S.: Contract-Switching for Managing Inter-Domain Dynamics. In: Ramamurthy, B., Rouskas, G.N., Sivalingam, K.M. (eds.) Next-Generation Internet Architectures and Protocols, pp. 136\u2013153. Cambridge University Press, Cambridge (2010)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24829-0_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T19:57:07Z","timestamp":1560715027000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24829-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642248283","9783642248290"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24829-0_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}