{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T19:45:26Z","timestamp":1781552726776,"version":"3.54.5"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030489656","type":"print"},{"value":"9783030489663","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-48966-3_7","type":"book-chapter","created":{"date-parts":[[2020,5,28]],"date-time":"2020-05-28T13:04:23Z","timestamp":1590671063000},"page":"83-96","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the Complexity of Stackelberg Matroid Pricing Problems"],"prefix":"10.1007","author":[{"given":"Toni","family":"B\u00f6hnlein","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Oliver","family":"Schaudt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,5,29]]},"reference":[{"issue":"3","key":"7_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":"7_CR2","doi-asserted-by":"crossref","unstructured":"Balcan, M.-F., Blum, A., Mansour, Y.: Item pricing for revenue maximization. In: Proceedings of the 9th ACM Conference on Electronic Commerce, pp. 50\u201359 (2008)","DOI":"10.1145\/1386790.1386802"},{"key":"7_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":"7_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":"7_CR5","unstructured":"Toni B\u00f6hnlein, S.K., Schaudt, O.: Revenue maximization in stackelberg pricing games: beyond the combinatorial setting. In: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) (2017)"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-030-24766-9_18","volume-title":"Algorithms and Data Structures","author":"T B\u00f6hnlein","year":"2019","unstructured":"B\u00f6hnlein, T., Schaudt, O., Schauer, J.: Stackelberg packing games. In: Friggstad, Z., Sack, J.-R., Salavatipour, M.R. (eds.) WADS 2019. LNCS, vol. 11646, pp. 239\u2013253. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24766-9_18"},{"key":"7_CR7","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"},{"issue":"1","key":"7_CR8","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1002\/net.20457","volume":"60","author":"P Briest","year":"2012","unstructured":"Briest, P., Gual\u00e0, L., Hoefer, M., Ventre, C.: On stackelberg pricing with computationally bounded customers. Networks 60(1), 31\u201344 (2012)","journal-title":"Networks"},{"issue":"3\u20134","key":"7_CR9","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1007\/s00453-010-9480-3","volume":"62","author":"P Briest","year":"2012","unstructured":"Briest, P., Hoefer, M., Krysta, P.: Stackelberg network pricing games. Algorithmica 62(3\u20134), 733\u2013753 (2012)","journal-title":"Algorithmica"},{"key":"7_CR10","unstructured":"Cabello, S.: Stackelberg shortest path tree game, revisited. arXiv preprint arXiv:1207.2317 (2012)"},{"issue":"2","key":"7_CR11","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(2), 129\u2013144 (2011)","journal-title":"Algorithmica"},{"issue":"1","key":"7_CR12","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."},{"issue":"2","key":"7_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":"7_CR14","series-title":"The IBM Research Symposia Series","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103. Springer, Boston (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"issue":"12\u2013part\u20131","key":"7_CR15","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. Manag. Sci. 44(12\u2013part\u20131), 1608\u20131622 (1998)","journal-title":"Manag. Sci."},{"issue":"1","key":"7_CR16","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10479-015-2016-0","volume":"240","author":"M Labb\u00e9","year":"2016","unstructured":"Labb\u00e9, M., Violin, A.: Bilevel programming and price setting problems. Ann. Oper. Res. 240(1), 141\u2013169 (2016)","journal-title":"Ann. Oper. Res."},{"key":"7_CR17","volume-title":"Matroid Theory","author":"JG Oxley","year":"2006","unstructured":"Oxley, J.G.: Matroid Theory, vol. 3. Oxford University Press, USA (2006)"},{"issue":"1","key":"7_CR18","first-page":"57","volume":"46","author":"S Roch","year":"2005","unstructured":"Roch, S., Savard, G., Marcotte, P.: An approximation algorithm for stackelberg network pricing. Netw. Int. J. 46(1), 57\u201367 (2005)","journal-title":"Netw. Int. J."},{"key":"7_CR19","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency, vol. 24. Springer Science & Business Media (2003)"},{"issue":"3","key":"7_CR20","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(3), 1393\u20131402 (2008)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-48966-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T15:14:58Z","timestamp":1710256498000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-48966-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030489656","9783030489663"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-48966-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"29 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bordeaux","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2020.labri.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,8","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5,9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference had to be postponed due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}