{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T18:38:35Z","timestamp":1772822315044,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2010,12,4]],"date-time":"2010-12-04T00:00:00Z","timestamp":1291420800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s00453-010-9480-3","type":"journal-article","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T10:34:51Z","timestamp":1291372491000},"page":"733-753","source":"Crossref","is-referenced-by-count":26,"title":["Stackelberg Network Pricing Games"],"prefix":"10.1007","volume":"62","author":[{"given":"Patrick","family":"Briest","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Hoefer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Krysta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,12,4]]},"reference":[{"key":"9480_CR1","volume-title":"Proc. of 31st ICALP","author":"G. Aggarwal","year":"2004","unstructured":"Aggarwal, G., Feder, T., Motwani, R., Zhu, A.: Algorithms for multi-product pricing. In: Proc. of 31st ICALP (2004)"},{"key":"9480_CR2","volume-title":"Proc. of 7th EC","author":"M. Balcan","year":"2006","unstructured":"Balcan, M., Blum, A.: Approximation algorithms and online mechanisms for item pricing. In: Proc. of 7th EC (2006)"},{"key":"9480_CR3","volume-title":"Proc. of 46th FOCS","author":"M. Balcan","year":"2005","unstructured":"Balcan, M., Blum, A., Hartline, J., Mansour, Y.: Mechanism design via machine learning. In: Proc. of 46th FOCS (2005)"},{"key":"9480_CR4","volume-title":"Proc. of 9th EC","author":"M. Balcan","year":"2008","unstructured":"Balcan, M., Blum, A., Mansour, Y.: Item pricing for revenue maximization. In: Proc. of 9th EC (2008)"},{"key":"9480_CR5","volume-title":"Proc. 4th WINE","author":"D. Bil\u00f3","year":"2008","unstructured":"Bil\u00f3, D., Gual\u00e1, L., Proietti, G., Widmayer, P.: Computational aspects of a 2-player Stackelberg shortest paths tree game. In: Proc. 4th WINE (2008)"},{"issue":"4","key":"9480_CR6","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1002\/nav.20216","volume":"54","author":"M. Bouhtou","year":"2007","unstructured":"Bouhtou, M., Grigoriev, A., van Hoesel, S., van\u00a0der Kraaij, A., Uetz, M.: Pricing bridges to cross a river. Nav. Res. Logist. 54(4), 411\u2013420 (2007)","journal-title":"Nav. Res. Logist."},{"key":"9480_CR7","volume-title":"Proc. of 35th ICALP","author":"P. Briest","year":"2008","unstructured":"Briest, P.: Uniform budgets and the envy-free pricing problem. In: Proc. of 35th ICALP (2008)"},{"key":"9480_CR8","unstructured":"Briest, P., Khanna, S.: Improved hardness of approximation for Stackelberg shortest-path pricing. (2009). arXiv:0910.0110"},{"key":"9480_CR9","volume-title":"Proc. of 17th SODA","author":"P. Briest","year":"2006","unstructured":"Briest, P., Krysta, P.: Single-minded unlimited-supply pricing on sparse instances. In: Proc. of 17th SODA (2006)"},{"key":"9480_CR10","volume-title":"Proc. of 18th SODA","author":"P. Briest","year":"2007","unstructured":"Briest, P., Krysta, P.: Buying cheap is expensive: Hardness of non-parametric multi-product pricing. In: Proc. of 18th SODA (2007)"},{"key":"9480_CR11","volume-title":"Proc. of 25th STACS","author":"P. Briest","year":"2008","unstructured":"Briest, P., Hoefer, M., Krysta, P.: Stackelberg network pricing games. In: Proc. of 25th STACS (2008)"},{"key":"9480_CR12","volume-title":"Proc. of 5th WINE","author":"P. Briest","year":"2009","unstructured":"Briest, P., Gual\u00e1, L., Hoefer, M., Ventre, C.: On Stackelberg pricing with computationally bounded consumers. In: Proc. of 5th WINE (2009)"},{"key":"9480_CR13","volume-title":"Proc. of 10th WADS","author":"J. Cardinal","year":"2007","unstructured":"Cardinal, J., Demaine, E., Fiorini, S., Joret, G., Langerman, S., Newman, I., Weimann, O.: The Stackelberg minimum spanning tree game. In: Proc. of 10th WADS (2007)"},{"key":"9480_CR14","volume-title":"Proc. of 5th WINE","author":"J. Cardinal","year":"2009","unstructured":"Cardinal, J., Demaine, E., Fiorini, S., Joret, G., Langerman, S., Newman, I., Weimann, O.: The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs. In: Proc. of 5th WINE (2009)"},{"key":"9480_CR15","volume-title":"Proc. of 8th EC","author":"S. Chawla","year":"2007","unstructured":"Chawla, S., Hartline, J., Kleinberg, R.: Algorithmic pricing via virtual valuations. In: Proc. of 8th EC (2007)"},{"key":"9480_CR16","volume-title":"Combinatorial Auctions","year":"2006","unstructured":"Cramton, P., Shoham, Y., Steinberg, R. (eds.): Combinatorial Auctions. MIT Press, Cambridge (2006)"},{"issue":"4","key":"9480_CR17","doi-asserted-by":"crossref","first-page":"1464","DOI":"10.1137\/060656048","volume":"38","author":"E.D. Demaine","year":"2008","unstructured":"Demaine, E.D., Feige, U., Hajiaghayi, M.T., Salavatipour, M.R.: Combination can be hard: Approximability of the unique coverage problem. SIAM J. Comput. 38(4), 1464\u20131483 (2008)","journal-title":"SIAM J. Comput."},{"key":"9480_CR18","volume-title":"Proc. of 45th FOCS","author":"L. Fleischer","year":"2004","unstructured":"Fleischer, L., Jain, K., Mahdian, M.: Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games. In: Proc. of 45th FOCS (2004)"},{"issue":"1","key":"9480_CR19","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1287\/opre.1050.0252","volume":"54","author":"P. Glynn","year":"2006","unstructured":"Glynn, P., Rusmevichientong, P., Van Roy, B.: A non-parametric approach to multi-product pricing. Oper. Res., 54(1), 82\u201398 (2006)","journal-title":"Oper. Res."},{"key":"9480_CR20","volume-title":"Proc. of 16th SODA","author":"V. Guruswami","year":"2005","unstructured":"Guruswami, V., Hartline, J.D., Karlin, A.R., Kempe, D., Kenyon, C., McSherry, F.: On profit-maximizing envy-free pricing. In: Proc. of 16th SODA (2005)"},{"key":"9480_CR21","volume-title":"Proc. of 8th WADS","author":"J. Hartline","year":"2005","unstructured":"Hartline, J., Koltun, V.: Near-optimal pricing in near-linear time. In: Proc. of 8th WADS (2005)"},{"key":"9480_CR22","volume-title":"Proc. of 45th FOCS","author":"G. Karakostas","year":"2004","unstructured":"Karakostas, G., Kolliopoulos, S.: Edge pricing of multicommodity networks for heterogeneous users. In: Proc. of 45th FOCS (2004)"},{"issue":"1","key":"9480_CR23","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1007\/s00453-007-9018-5","volume":"53","author":"G. Karakostas","year":"2009","unstructured":"Karakostas, G., Kolliopoulos, S.: Stackelberg strategies for selfish routing in general multicommodity networks. Algorithmica 53(1), 132\u2013153 (2009)","journal-title":"Algorithmica"},{"issue":"12","key":"9480_CR24","doi-asserted-by":"crossref","first-page":"1608","DOI":"10.1287\/mnsc.44.12.1608","volume":"44","author":"M. Labb\u00e9","year":"1998","unstructured":"Labb\u00e9, M., Marcotte, P., Savard, G.: A bilevel model of taxation and its application to optimal highway pricing. Manag. Sci. 44(12), 1608\u20131622 (1998)","journal-title":"Manag. Sci."},{"key":"9480_CR25","volume-title":"Proc. of 31st STOC","author":"N. Nisan","year":"1999","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. In: Proc. of 31st STOC (1999)"},{"issue":"1","key":"9480_CR26","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1002\/net.20074","volume":"46","author":"S. Roch","year":"2005","unstructured":"Roch, S., Savard, G., Marcotte, P.: An approximation algorithm for Stackelberg network pricing. Networks 46(1), 57\u201367 (2005)","journal-title":"Networks"},{"issue":"2","key":"9480_CR27","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1137\/S0097539701397059","volume":"33","author":"T. Roughgarden","year":"2004","unstructured":"Roughgarden, T.: Stackelberg scheduling strategies. SIAM J. Comput. 33(2), 332\u2013350 (2004)","journal-title":"SIAM J. Comput."},{"key":"9480_CR28","volume-title":"Proc. of 18th SODA","author":"C. Swamy","year":"2007","unstructured":"Swamy, C.: The effectiveness of Stackelberg strategies and tolls for network congestion games. In: Proc. of 18th SODA (2007)"},{"key":"9480_CR29","unstructured":"van Hoesel, S.: An overview of Stackelberg pricing in networks. Research Memoranda 042, METEOR, Maastricht (2006)"},{"key":"9480_CR30","volume-title":"Marktform und Gleichgewicht (Market and Equilibrium)","author":"H. Stackelberg von","year":"1934","unstructured":"von Stackelberg, H.: Marktform und Gleichgewicht (Market and Equilibrium). Springer, Vienna (1934)"},{"key":"9480_CR31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0191-2615(02)00074-7","volume":"38","author":"H. Yang","year":"2004","unstructured":"Yang, H., Huang, H.-J.: The multi-class, multi-criteria traffic network equilibrium and systems optimum problem. Transp. Res., Part B, Methodol. 38, 1\u201315 (2004)","journal-title":"Transp. Res., Part B, Methodol."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9480-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-010-9480-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9480-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:45:07Z","timestamp":1559123107000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-010-9480-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,4]]},"references-count":31,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["9480"],"URL":"https:\/\/doi.org\/10.1007\/s00453-010-9480-3","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12,4]]}}}