{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T02:07:40Z","timestamp":1771466860153,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540921844","type":"print"},{"value":"9783540921851","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-92185-1_32","type":"book-chapter","created":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T11:44:33Z","timestamp":1228909473000},"page":"251-262","source":"Crossref","is-referenced-by-count":10,"title":["Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game"],"prefix":"10.1007","author":[{"given":"Davide","family":"Bil\u00f2","sequence":"first","affiliation":[]},{"given":"Luciano","family":"Gual\u00e0","sequence":"additional","affiliation":[]},{"given":"Guido","family":"Proietti","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Widmayer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","series-title":"Contemporary Mathematics","first-page":"1","volume-title":"Advances in Discrete and Computational Geometry","author":"P.K. Agarwal","year":"1999","unstructured":"Agarwal, P.K., Erickson, J.: Geometric range searching and its relatives. In: Chazelle, B., Goodman, J.E., Pollack, R. (eds.) Advances in Discrete and Computational Geometry. Contemporary Mathematics, vol.\u00a023, pp. 1\u201356. American Mathematical Society Press, Providence (1999)"},{"key":"32_CR2","unstructured":"Briest, P., Hoefer, M., Krysta, P.: Stackelberg network pricing games. In: 25th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pp. 133\u2013142 (2008), \n                    \n                      http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2008\/1340"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-540-73951-7_7","volume-title":"Algorithms and Data Structures","author":"J. Cardinal","year":"2007","unstructured":"Cardinal, J., Demaine, E.D., Fiorini, S., Joret, G., Langerman, S., Newman, I., Weimann, O.: The Stackelberg minimum spanning tree game. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol.\u00a04619, pp. 64\u201376. Springer, Heidelberg (2007)"},{"key":"32_CR4","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press and McGraw-Hill (2001)"},{"key":"32_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-540-31833-0_13","volume-title":"Approximation and Online Algorithms","author":"A. Grigoriev","year":"2005","unstructured":"Grigoriev, A., van Hoesel, S., van der Kraaij, A., Uetz, M., Bouhtou, M.: Pricing network edges to cross a river. In: Persiano, G., Solis-Oba, R. (eds.) WAOA 2004. LNCS, vol.\u00a03351, pp. 140\u2013153. Springer, Heidelberg (2005)"},{"issue":"12","key":"32_CR6","first-page":"608","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. Management Science\u00a044(12), 608\u2013622 (1998)","journal-title":"Management Science"},{"key":"32_CR7","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0167-6377(89)90065-5","volume":"8","author":"K. Malik","year":"1989","unstructured":"Malik, K., Mittal, A.K., Gupta, S.K.: The k most vital arcs in the shortest path problem. Oper. Res. Letters\u00a08, 223\u2013227 (1989)","journal-title":"Oper. Res. Letters"},{"key":"32_CR8","volume-title":"Algorithmic Game Theory","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V. (eds.): Algorithmic Game Theory. Cambridge University Press, New York (2007)"},{"issue":"1","key":"32_CR9","doi-asserted-by":"publisher","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\u00a046(1), 57\u201367 (2005)","journal-title":"Networks"},{"issue":"3","key":"32_CR10","doi-asserted-by":"publisher","first-page":"1393","DOI":"10.1016\/j.ejor.2006.08.064","volume":"189","author":"S. Hoesel van","year":"2008","unstructured":"van Hoesel, S.: An overview of Stackelberg pricing in networks. European Journal of Operational Research\u00a0189(3), 1393\u20131402 (2008)","journal-title":"European Journal of Operational Research"},{"key":"32_CR11","unstructured":"von Stackelberg, H.: Marktform und Gleichgewicht (Market and Equilibrium). Verlag von Julius Springer, Vienna, Austria (1934)"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92185-1_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T04:55:53Z","timestamp":1551675353000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92185-1_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540921844","9783540921851"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92185-1_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}