{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,8]],"date-time":"2025-02-08T00:40:02Z","timestamp":1738975202977,"version":"3.37.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,3,4]],"date-time":"2009-03-04T00:00:00Z","timestamp":1236124800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2010,7]]},"DOI":"10.1007\/s00224-009-9197-3","type":"journal-article","created":{"date-parts":[[2009,3,3]],"date-time":"2009-03-03T19:01:54Z","timestamp":1236106914000},"page":"15-37","source":"Crossref","is-referenced-by-count":6,"title":["Non-Cooperative Cost Sharing Games via Subsidies"],"prefix":"10.1007","volume":"47","author":[{"given":"Niv","family":"Buchbinder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liane","family":"Lewin-Eytan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph","family":"(Seffi)\u00a0Naor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ariel","family":"Orda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,3,4]]},"reference":[{"key":"9197_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.: The online set cover problem. In: Proc. of the 35th Annual ACM Symposium on the Theory of Computation, pp. 100\u2013105 (2003)","DOI":"10.1145\/780542.780558"},{"key":"9197_CR2","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1145\/1198513.1198522","volume":"2","author":"N. Alon","year":"2006","unstructured":"Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.: A general approach to online network optimization problems. ACM Trans. Algorithms 2, 640\u2013660 (2006)","journal-title":"ACM Trans. Algorithms"},{"key":"9197_CR3","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: Proc. of the 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 295\u2013304 (2004)","DOI":"10.1109\/FOCS.2004.68"},{"key":"9197_CR4","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Naor, J.: Online primal-dual algorithms for covering and packing problems. In: Proc. of the 13th Annual European Symposium on Algorithms, pp. 689\u2013701 (2005)","DOI":"10.1007\/11561071_61"},{"key":"9197_CR5","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: Taxes for linear atomic congestion games. In: Proc. of the 14th Conference on Annual European Symposium, pp. 184\u2013195 (2006)","DOI":"10.1007\/11841036_19"},{"key":"9197_CR6","doi-asserted-by":"crossref","unstructured":"Charikar, M., Karloff, H., Mathieu, C., Saks, M., Naor, J.: Online multicast with egalitarian cost sharing, In: Proc. of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures, pp. 70\u201376 (2008)","DOI":"10.1145\/1378533.1378544"},{"key":"9197_CR7","doi-asserted-by":"crossref","first-page":"1193","DOI":"10.1109\/JSAC.2007.070813","volume":"25","author":"C. Chekuri","year":"2007","unstructured":"Chekuri, C., Chuzhoy, J., Lewin-Eytan, L., Naor, J., Orda, A.: Non-cooperative multicast and facility location games. IEEE J. Sel. Areas Commun. 25, 1193\u20131206 (2007) (Special Issue on Non-Cooperative Behavior in Networking)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"9197_CR8","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E., Nanavati, A.: Coordination mechanisms. In: Proc. of the 31st Inter. Colloq. on Automata, Languages and Programming, pp. 345\u2013357 (2004)","DOI":"10.1007\/978-3-540-27836-8_31"},{"issue":"4","key":"9197_CR9","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1145\/1054916.1054933","volume":"35","author":"M. Chrobak","year":"2004","unstructured":"Chrobak, M., Koutsoupias, E.: Coordination mechanisms for congestion games. ACM SIGACT News 35(4), 58\u201371 (2004)","journal-title":"ACM SIGACT News"},{"key":"9197_CR10","doi-asserted-by":"crossref","unstructured":"Cole, R., Dodis, Y., Roughgarden, T.: How much can taxes help selfish routing? In: Proc. of the 4th ACM Conference on Electronic Commerce, pp. 98\u2013107 (2003)","DOI":"10.1145\/779928.779941"},{"key":"9197_CR11","doi-asserted-by":"crossref","unstructured":"Fleischer, L.K., Jain, K., Mahdian M.: Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games. In: Proc. of the 45th Annual Symposium of the Foundations of Computer Science, pp. 277\u2013285 (2004)","DOI":"10.1109\/FOCS.2004.69"},{"issue":"1","key":"9197_CR12","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1109\/90.554730","volume":"5","author":"Y.A. Korilis","year":"1997","unstructured":"Korilis, Y.A., Lazar, A.A., Orda, A.: Achieving network optima using Stackelberg routing strategies. IEEE\/ACM Trans. Netw. 5(1), 161\u2013173 (1997)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"9197_CR13","doi-asserted-by":"crossref","unstructured":"Immorlica, N., Li, L., Mirrokni, V., Schulz, A.: Coordination mechanisms for selfish scheduling. In: Proc. of the 1st Inter. Workshop on Internet and Network Economics, pp. 55\u201369 (2005)","DOI":"10.1007\/11600930_7"},{"key":"9197_CR14","doi-asserted-by":"crossref","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. In: Proc. of the 31th Annual ACM Symp. on the Theory of Computation\u2014STOC\u201999, pp. 129\u2013140 (1999)","DOI":"10.1145\/301250.301287"},{"key":"9197_CR15","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R.W. Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A class of games possessing pure strategy Nash equilibria. Int. J. Game Theory 2, 65\u201367 (1973)","journal-title":"Int. J. Game Theory"},{"key":"9197_CR16","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Stackelberg scheduling strategies. In: Proc. of the 33rd Annual ACM Symp. on the Theory of Computation\u2014STOC\u201901, pp. 104\u2013113 (2001)","DOI":"10.1145\/380752.380783"},{"key":"9197_CR17","unstructured":"Swamy, C.: The effectiveness of Stackelberg strategies and tolls for network congestion games. In: Proc. of the 18th Annual ACM-SIAM Symp. on Discrete Algorithms, pp. 1133\u20131142 (2007)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-009-9197-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-009-9197-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-009-9197-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,7]],"date-time":"2025-02-07T23:58:17Z","timestamp":1738972697000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-009-9197-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3,4]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["9197"],"URL":"https:\/\/doi.org\/10.1007\/s00224-009-9197-3","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2009,3,4]]}}}