{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:29:48Z","timestamp":1742912988954,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031432538"},{"type":"electronic","value":"9783031432545"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-43254-5_2","type":"book-chapter","created":{"date-parts":[[2023,9,3]],"date-time":"2023-09-03T23:04:03Z","timestamp":1693782243000},"page":"22-39","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Stackelberg Vertex Cover on\u00a0a\u00a0Path"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9809-8821","authenticated-orcid":false,"given":"Katharina","family":"Eickhoff","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5791-9195","authenticated-orcid":false,"given":"Lennart","family":"Kauther","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8938-8843","authenticated-orcid":false,"given":"Britta","family":"Peis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,4]]},"reference":[{"key":"2_CR1","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. EC 2008, Association for Computing Machinery, New York, NY, USA (2008)","DOI":"10.1145\/1386790.1386802"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"1174","DOI":"10.1007\/s00453-015-9993-x","volume":"74","author":"M Ba\u00efou","year":"2015","unstructured":"Ba\u00efou, M., Barahona, F.: Stackelberg Bipartite Vertex Cover and the Preflow Algorithm. Algorithmica 74, 1174\u20131183 (2015)","journal-title":"Algorithmica"},{"key":"2_CR3","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":"2_CR4","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":"2_CR5","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.) Internet and Network Economics, pp. 444\u2013454. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17572-5_37"},{"issue":"1","key":"2_CR6","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"},{"key":"2_CR7","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, 733\u2013753 (2012)","journal-title":"Algorithmica"},{"issue":"1","key":"2_CR8","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/s10107-020-01495-0","volume":"187","author":"T B\u00f6hnlein","year":"2021","unstructured":"B\u00f6hnlein, T., Kratsch, S., Schaudt, O.: Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting. Math. Program. 187(1), 653\u2013695 (2021)","journal-title":"Math. Program."},{"key":"2_CR9","unstructured":"Cabello, S.: Stackelberg Shortest Path Tree Game. Revisited. Institute of Mathematics, Physics and Mechanics (2012)"},{"key":"2_CR10","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., et al.: The Stackelberg minimum spanning tree game. In: Dehne, F., Sack, J.R., Zeh, N. (eds.) Algorithms and Data Structures, pp. 64\u201376. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73951-7_7"},{"issue":"1","key":"2_CR11","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10878-011-9414-2","volume":"25","author":"J Cardinal","year":"2011","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 (2011)","journal-title":"J. Comb. Optim."},{"issue":"2","key":"2_CR12","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.orl.2022.01.001","volume":"50","author":"A Cristi","year":"2022","unstructured":"Cristi, A., Schr\u00f6der, M.: Negative prices in network pricing games. Oper. Res. Lett. 50(2), 99\u2013106 (2022)","journal-title":"Oper. Res. Lett."},{"key":"2_CR13","first-page":"16","volume":"38","author":"E Egerv\u00e1ry","year":"1931","unstructured":"Egerv\u00e1ry, E.: \u00dcber kombinatorische Eigenschaften von Matrizen. Mat. Fiz. Lapok 38, 16\u201328 (1931)","journal-title":"Mat. Fiz. Lapok"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Eickhoff, K., Kauther, L., Peis, B.: Stackelberg vertex cover on a path (2023)","DOI":"10.1007\/978-3-031-43254-5_2"},{"issue":"2","key":"2_CR15","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":"2_CR16","doi-asserted-by":"publisher","first-page":"3010","DOI":"10.1287\/moor.2021.1240","volume":"47","author":"K Jungnitsch","year":"2021","unstructured":"Jungnitsch, K., Peis, B., Schr\u00f6der, M.: Stackelberg max closure with multiple followers. Math. Oper. Res. 47, 3010\u20133124 (2021)","journal-title":"Math. Oper. Res."},{"key":"2_CR17","doi-asserted-by":"publisher","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Springer, Boston (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"2_CR18","first-page":"116","volume":"38","author":"D K\u0151nig","year":"1931","unstructured":"K\u0151nig, D.: Graphs and matrices. Mat. Lapok 38, 116\u2013119 (1931)","journal-title":"Mat. Lapok"},{"issue":"12\u2013part\u20131","key":"2_CR19","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(12\u2013part\u20131), 1608\u20131622 (1998)","journal-title":"Manage. Sci."},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.tcs.2019.10.007","volume":"799","author":"U Pferschy","year":"2019","unstructured":"Pferschy, U., Nicosia, G., Pacifici, A.: A Stackelberg knapsack game with weight control. Theoret. Comput. Sci. 799, 149\u2013159 (2019)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"2_CR21","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.ejor.2020.09.007","volume":"291","author":"U Pferschy","year":"2021","unstructured":"Pferschy, U., Nicosia, G., Pacifici, A., Schauer, J.: On the Stackelberg knapsack game. Eur. J. Oper. Res. 291(1), 18\u201331 (2021)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"2_CR22","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 46(1), 57\u201367 (2005)","journal-title":"Networks"},{"key":"2_CR23","doi-asserted-by":"publisher","unstructured":"von Stackelberg, H.: Marktform und Gleichgewicht (Market and Equilibrium). Verlag von Julius Springer (1934). https:\/\/doi.org\/10.1007\/978-3-642-12586-7","DOI":"10.1007\/978-3-642-12586-7"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43254-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T22:40:18Z","timestamp":1703112018000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43254-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031432538","9783031432545"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43254-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"4 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Egham","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2023","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":"sagt2023","order":10,"name":"conference_id","label":"Conference ID","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":"OpenReview","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59","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":"26","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":"44% - 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","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","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)"}}]}}