{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:36:10Z","timestamp":1767339370560},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,1,24]],"date-time":"2007-01-24T00:00:00Z","timestamp":1169596800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2007,2,21]]},"DOI":"10.1007\/s00446-006-0020-y","type":"journal-article","created":{"date-parts":[[2007,1,23]],"date-time":"2007-01-23T18:49:38Z","timestamp":1169578178000},"page":"255-266","source":"Crossref","is-referenced-by-count":26,"title":["A network pricing game for selfish traffic"],"prefix":"10.1007","volume":"19","author":[{"given":"Ara","family":"Hayrapetyan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c9va","family":"Tardos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom","family":"Wexler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,1,24]]},"reference":[{"key":"20_CR1","unstructured":"Acemoglu, D., Ozdaglar, A.: Price competition with elastic traffic and multiple user classes. In: Allerton Conference on Communication, Control and Computing (2005)"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Acemoglu, D., Ozdaglar, A.: Competition and efficiency in congested markets (Unpublished Manuscript, 2004)","DOI":"10.3386\/w11201"},{"key":"20_CR3","unstructured":"Acemoglu, D., Ozdaglar, A.: Flow control, routing, and performance from service provider viewpoint (Unpublished Manuscript, 2004)"},{"key":"20_CR4","unstructured":"Af\u00e8che, P.: Incentive-compatible revenue management in queuing systems: optimal strategic idleness and other delaying tactics (Unpublished Manuscript, 2004)"},{"key":"20_CR5","unstructured":"Allon, G., Federgruen, A.: Competition in service industries (Unpublished Manuscript, 2004)"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, \u00c9., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: IEEE Symposium on Foundations of Computer Science, pp. 295\u2013304 (2004)","DOI":"10.1109\/FOCS.2004.68"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Tardos, \u00c9., Wexler, T.: Near-optimal network design with selfish agents. In: ACM Symposium on theory of computing, pp. 511\u2013520 (2003)","DOI":"10.1145\/780542.780617"},{"key":"20_CR8","unstructured":"Beckmann, M., McGuire, C.B., Winsten, C.B.: Studies in the economics of transportation. Yale University Press, New Haven, Connecticut (1956)"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Cole, R., Dodis, Y., Roughgarden, T.: Pricing network edges for heterogeneous selfish users. In: ACM Symposium on Theory of Computing, pp. 521\u2013530 (2003)","DOI":"10.1145\/780542.780618"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Cole, R., Dodis, Y., Roughgarden, T.: How much can taxes help selfish routing. In: ACM Conference on Electronic Commerce, pp. 98\u2013107 (2003)","DOI":"10.1145\/779928.779941"},{"issue":"4","key":"20_CR11","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1287\/moor.1040.0098","volume":"29","author":"JR. Correa","year":"2004","unstructured":"Correa JR., Schulz A.S. and Stier-Moses N.E. (2004). Selfish routing in capacitated networks. Math. Oper. Res. 29(4): 961\u2013976","journal-title":"Math. Oper. Res."},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Krysta, P., V\u00f6cking, B.: Selfish traffic allocation for server farms. In: ACM Symposium on Theory of Computing, pp. 287\u2013296 (2002)","DOI":"10.1145\/509907.509952"},{"key":"20_CR13","unstructured":"Czumaj, A., V\u00f6cking, B.: Tight bounds for worst-case equilibria. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 413\u2013420 (2002)"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C.H., Shenker, S.: On a network creation game. In: ACM SIGACT-SIGOPT Symposium on Principles of Distributed Computing, pp. 247\u2013251 (2003)","DOI":"10.1145\/872035.872088"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Fleischer, L., Jain, K., Mahdian, M.: Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games. In: IEEE Symposium on Foundations of Computer Science, pp. 277\u2013285 (2004)","DOI":"10.1109\/FOCS.2004.69"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Karakostas, G., Kolliopoulos, S.G.: Edge Pricing of Multicommodity Networks for Heterogeneous Selfish Users. In: IEEE Symposium on Foundations of Computer Science, pp. 268\u2013276 (2004)","DOI":"10.1109\/FOCS.2004.26"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Worst-case equilibria. In: International Symposium on Theoretical Aspects of Computer Science, pp. 404\u2013413 (1999)","DOI":"10.1007\/3-540-49116-3_38"},{"issue":"4\u20136","key":"20_CR18","first-page":"809","volume":"45","author":"I.H. Lee","year":"2001","unstructured":"Lee I.H. and Mason R. (2001). Market structure in congestible markets. In: Eur. Econ. Rev. 45(4\u20136): 809\u2013818","journal-title":"In: Eur. Econ. Rev."},{"key":"20_CR19","unstructured":"Pigou, A.C.: The economics of welfare. In: Macmillan, New York (1920)"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: The price of anarchy is independent of the network topology. In: ACM Symposium on Theory of Computing, pp. 428\u2013437 (2002)","DOI":"10.1145\/509907.509971"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Stackelberg scheduling strategies. In: ACM Symposium on Theory of Computing, pp.104\u2013113 (2001)","DOI":"10.1145\/380752.380783"},{"key":"20_CR22","doi-asserted-by":"crossref","unstructured":"Roughgarden, T., Tardos, \u00c9.: How bad is selfish routing? In: IEEE Symposium on Foundations of Computer Science, pp. 93\u2013102 (2000)","DOI":"10.1109\/SFCS.2000.892069"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Suri, S., Toth, C.D., Zhou, Y.: Selfish load balancing and atomic congestion games. In: ACM Symposium on Parallel Algorithms and Architectures, pp. 188\u2013195 (2004)","DOI":"10.1145\/1007912.1007941"},{"key":"20_CR24","doi-asserted-by":"crossref","unstructured":"Vetta, A.: Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions. In: IEEE Symposium on Foundations of Computer Science, pp. 416\u2013425 (2002)","DOI":"10.1109\/SFCS.2002.1181966"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-006-0020-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-006-0020-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-006-0020-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:26:36Z","timestamp":1559136396000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-006-0020-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,1,24]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,2,21]]}},"alternative-id":["20"],"URL":"https:\/\/doi.org\/10.1007\/s00446-006-0020-y","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,1,24]]}}}