{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:40:27Z","timestamp":1759848027937,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030247652"},{"type":"electronic","value":"9783030247669"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-24766-9_18","type":"book-chapter","created":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T23:09:48Z","timestamp":1564528188000},"page":"239-253","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Stackelberg Packing Games"],"prefix":"10.1007","author":[{"given":"Toni","family":"B\u00f6hnlein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oliver","family":"Schaudt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joachim","family":"Schauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,12]]},"reference":[{"issue":"3","key":"18_CR1","doi-asserted-by":"publisher","first-page":"1174","DOI":"10.1007\/s00453-015-9993-x","volume":"74","author":"M Ba\u00efou","year":"2016","unstructured":"Ba\u00efou, M., Barahona, F.: Stackelberg bipartite vertex cover and the preflow algorithm. Algorithmica 74(3), 1174\u20131183 (2016)","journal-title":"Algorithmica"},{"key":"18_CR2","doi-asserted-by":"publisher","unstructured":"Balcan, M., Blum, A., Mansour, Y.: Item pricing for revenue maximization. In: Proceedings 9th ACM Conference on Electronic Commerce (EC-2008), Chicago, IL, USA, pp. 50\u201359, 8\u201312 June 2008. https:\/\/doi.org\/10.1145\/1386790.1386802, http:\/\/doi.acm.org\/10.1145\/1386790.1386802","DOI":"10.1145\/1386790.1386802"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1016\/j.tcs.2014.11.009","volume":"562","author":"D Bil\u00f2","year":"2015","unstructured":"Bil\u00f2, D., Gual\u00e0, L., Leucci, S., Proietti, G.: Specializations and generalizations of the stackelberg minimum spanning tree game. Theoret. Comput. Sci. 562, 643\u2013657 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR4","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\u00f2","year":"2008","unstructured":"Bil\u00f2, 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. 5385, pp. 251\u2013262. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92185-1_32"},{"key":"18_CR5","doi-asserted-by":"publisher","unstructured":"B\u00f6hnlein, T., Kratsch, S., Schaudt, O.: Revenue maximization in stackelberg pricing games: beyond the combinatorial setting. In: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, Warsaw, Poland. pp. 46:1\u201346:13, 10\u201314 July 2017. https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2017.46","DOI":"10.4230\/LIPIcs.ICALP.2017.46"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/978-3-642-17572-5_37","volume-title":"Internet and Network Economics","author":"P Briest","year":"2010","unstructured":"Briest, P., Chalermsook, P., Khanna, S., Laekhanukit, B., Nanongkai, D.: Improved hardness of approximation for stackelberg shortest-path pricing. In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 444\u2013454. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17572-5_37"},{"key":"18_CR7","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. 5929, pp. 42\u201354. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10841-9_6"},{"issue":"3-4","key":"18_CR8","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1007\/s00453-010-9480-3","volume":"62","author":"Patrick Briest","year":"2010","unstructured":"Briest, P., Hoefer, M., Krysta, P.: Stackelberg network pricing games. Algorithmica 62(3\u20134), 733\u2013753 (2012). https:\/\/doi.org\/10.1007\/s00453-010-9480-3, http:\/\/dx.doi.org\/10.1007\/s00453-010-9480-3","journal-title":"Algorithmica"},{"key":"18_CR9","unstructured":"Cabello, S.: Stackelberg Shortest Path Tree Game. arXiv preprint arXiv:1207.2317 (2012)"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s00453-009-9299-y","volume":"59","author":"J Cardinal","year":"2011","unstructured":"Cardinal, J., et al.: The stackelberg minimum spanning tree game. Algorithmica 59, 129\u2013144 (2011)","journal-title":"Algorithmica"},{"issue":"1","key":"18_CR11","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10878-011-9414-2","volume":"25","author":"J Cardinal","year":"2013","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. J. Comb. Optim. 25(1), 19\u201346 (2013)","journal-title":"J. Comb. Optim."},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"1393","DOI":"10.1016\/j.ejor.2006.08.064","volume":"189","author":"S van Hoesel","year":"2008","unstructured":"van Hoesel, S.: An overview of stackelberg pricing in networks. Eur. J. Oper. Res. 189, 1393\u20131402 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"18_CR13","first-page":"117","volume":"57","author":"G Joret","year":"2011","unstructured":"Joret, G.: Stackelberg network pricing is hard to approximate. Networks 57(2), 117\u2013120 (2011)","journal-title":"Networks"},{"key":"18_CR14","doi-asserted-by":"publisher","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. Manage. Sci. 44, 1608\u20131622 (1998)","journal-title":"Manage. Sci."},{"issue":"1","key":"18_CR15","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10479-015-2016-0","volume":"240","author":"Martine Labb\u00e9","year":"2015","unstructured":"Labb\u00e9, M., Violin, A.: Bilevel programming and price setting problems. Annals OR 240(1), 141\u2013169 (2016). https:\/\/doi.org\/10.1007\/s10479-015-2016-0","journal-title":"Annals of Operations Research"},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1002\/net.20074","volume":"46","author":"S Roche","year":"2005","unstructured":"Roche, S., Savard, G., Marcotte, P.: An approximation algorithm for stackelberg network pricing. Networks 46, 57\u201367 (2005)","journal-title":"Networks"},{"key":"18_CR17","volume-title":"Marktform und Gleichgewicht","author":"H von Stackelberg","year":"1934","unstructured":"von Stackelberg, H.: Marktform und Gleichgewicht. Springer, Berlin (1934)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-24766-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:54:03Z","timestamp":1710266043000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-24766-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030247652","9783030247669"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24766-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Edmonton, AB","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wads.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}