{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:12:38Z","timestamp":1725570758957},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175718"},{"type":"electronic","value":"9783642175725"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17572-5_7","type":"book-chapter","created":{"date-parts":[[2010,12,6]],"date-time":"2010-12-06T03:54:45Z","timestamp":1291607685000},"page":"75-86","source":"Crossref","is-referenced-by-count":2,"title":["Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game"],"prefix":"10.1007","author":[{"given":"Davide","family":"Bil\u00f2","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luciano","family":"Gual\u00e0","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Leucci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guido","family":"Proietti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-540-92185-1_32","volume-title":"Internet and Network Economics","author":"D. Bil\u00f3","year":"2008","unstructured":"Bil\u00f3, D., Gual\u00e0, L., Proietti, G., Widmayer, P.: Computational aspects of a 2-player Stackelberg shortest paths tree game. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol.\u00a05385, pp. 251\u2013262. Springer, Heidelberg (2008)"},{"key":"7_CR2","unstructured":"Bil\u00f3, D., Gual\u00e0, L., Proietti, G.: Hardness of an asymmetric 2-player Stackelberg network pricing game. In: Electronic Colloquium on Computational Complexity (ECCC), TR09-112 (November 3, 2009)"},{"key":"7_CR3","unstructured":"Briest, P., Hoefer, M., Krysta, P.: Stackelberg network pricing games. In: Proc. of the 25th Ann. Symp. on Theoretical Aspects of Computer Science (STACS), pp. 133\u2013142 (2008), http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2008\/1340"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-642-10841-9_6","volume-title":"Internet and Network Economics","author":"P. Briest","year":"2009","unstructured":"Briest, P., Hoefer, M., Gual\u00e0, L., Ventre, C.: On stackelberg pricing with computationally bounded consumers. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol.\u00a05929, pp. 42\u201354. Springer, Heidelberg (2009)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Cardinal, J., Demaine, E.D., Fiorini, S., Joret, G., Langerman, S., Newman, I., Weimann, O.: The Stackelberg minimum spanning tree game. Algorithmica (2009), doi:10.1007\/s00453-009-9299-y","DOI":"10.1007\/s00453-009-9299-y"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-642-10841-9_13","volume-title":"Internet and Network Economics","author":"J. Cardinal","year":"2009","unstructured":"Cardinal, J., Demaine, E.D., Fiorini, S., Joret, G., Newman, I., Weimann, O.: The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol.\u00a05929, pp. 125\u2013136. Springer, Heidelberg (2009)"},{"key":"7_CR7","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)"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Joret, G.: Stackelberg network pricing is hard to approximate (2009) (manuscript)","DOI":"10.1002\/net.20391"},{"issue":"12","key":"7_CR9","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"},{"issue":"1","key":"7_CR10","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"},{"key":"7_CR11","unstructured":"van Hoesel, S.: An overview of Stackelberg pricing in networks, Research Memoranda 042, Maastricht: METEOR, Maastricht Research School of Economics of Technology and Organization (2006)"},{"key":"7_CR12","volume-title":"Marktform und Gleichgewicht (Market and Equilibrium)","author":"H. Stackelberg von","year":"1934","unstructured":"von Stackelberg, H.: Marktform und Gleichgewicht (Market and Equilibrium). Verlag von Julius Springer, Vienna (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-642-17572-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T16:54:20Z","timestamp":1559840060000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17572-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175718","9783642175725"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17572-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}