{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:24:27Z","timestamp":1743153867461,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031710322"},{"type":"electronic","value":"9783031710339"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-71033-9_17","type":"book-chapter","created":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T00:02:17Z","timestamp":1725321737000},"page":"297-314","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Sublogarithmic Approximation for\u00a0Tollbooth Pricing on\u00a0a\u00a0Cactus"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-2875-9678","authenticated-orcid":false,"given":"Andrzej","family":"Turko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3387-0913","authenticated-orcid":false,"given":"Jaros\u0142aw","family":"Byrka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,31]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","unstructured":"Anshelevich, E., Kar, K., Sekar, S.: Envy-free pricing in large markets: approximating revenue and welfare. ACM Trans. Econ. Comput. 5(3) (2017). https:\/\/doi.org\/10.1145\/3105786","DOI":"10.1145\/3105786"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Sekar, S.: Price doubling and item halving: robust revenue guarantees for item pricing (2017)","DOI":"10.1145\/3033274.3085117"},{"key":"17_CR3","doi-asserted-by":"publisher","unstructured":"Balcan, M.F., Blum, A., Mansour, Y.: Item pricing for revenue maximization. In: Proceedings of the 9th ACM Conference on Electronic Commerce, EC 2008, pp. 50\u201359. Association for Computing Machinery, New York (2008). https:\/\/doi.org\/10.1145\/1386790.1386802","DOI":"10.1145\/1386790.1386802"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Briest, P., Krysta, P.: Single-minded unlimited supply pricing on sparse instances. In: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms, pp. 1093\u20131102 (2006)","DOI":"10.1145\/1109557.1109678"},{"key":"17_CR5","doi-asserted-by":"publisher","unstructured":"Cheung, M., Swamy, C.: Approximation algorithms for single-minded envy-free profit-maximization problems with limited supply. In: 2008 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 35\u201344 (2008). https:\/\/doi.org\/10.1109\/FOCS.2008.15","DOI":"10.1109\/FOCS.2008.15"},{"issue":"4","key":"17_CR6","doi-asserted-by":"publisher","first-page":"1464","DOI":"10.1137\/060656048","volume":"38","author":"ED Demaine","year":"2008","unstructured":"Demaine, E.D., Feige, U., Hajiaghayi, M., Salavatipour, M.R.: Combination can be hard: approximability of the unique coverage problem. SIAM J. Comput. 38(4), 1464\u20131483 (2008)","journal-title":"SIAM J. Comput."},{"key":"17_CR7","unstructured":"Elbassioni, K., Fouz, M., Swamy, C.: Approximation algorithms for non-single-minded profit-maximization problems with limited supply (2013)"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1007\/978-3-642-14165-2_49","volume-title":"Automata, Languages and Programming","author":"I Gamzu","year":"2010","unstructured":"Gamzu, I., Segev, D.: A sublogarithmic approximation for highway and tollbooth pricing. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 582\u2013593. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14165-2_49"},{"issue":"2","key":"17_CR9","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1137\/140998846","volume":"45","author":"F Grandoni","year":"2016","unstructured":"Grandoni, F., Rothvo\u00df, T.: Pricing on paths: a PTAS for the highway problem. SIAM J. Comput. 45(2), 216\u2013231 (2016)","journal-title":"SIAM J. Comput."},{"key":"17_CR10","doi-asserted-by":"publisher","unstructured":"Grandoni, F., Wiese, A.: Packing cars into narrow roads: ptass for limited supply highway. In: 27th Annual European Symposium on Algorithms (ESA 2019). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0144, pp. 54:1\u201354:14 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2019.54","DOI":"10.4230\/LIPIcs.ESA.2019.54"},{"key":"17_CR11","unstructured":"Guruswami, V., Hartline, J.D., Karlin, A.R., Kempe, D., Kenyon, C., McSherry, F.: On profit-maximizing envy-free pricing. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, pp. 1164\u20131173. Society for Industrial and Applied Mathematics (2005)"},{"key":"17_CR12","unstructured":"Li, Y., Lu, P., Ye, H.: Revenue maximization with imprecise distribution (2019)"},{"key":"17_CR13","unstructured":"Turko, A., Byrka, J.: Sublogarithmic approximation for tollbooth pricing on a cactus (2023). https:\/\/arxiv.org\/abs\/2305.05405"}],"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-71033-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T00:04:51Z","timestamp":1725321891000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-71033-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031710322","9783031710339"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-71033-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"31 August 2024","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":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cwi.nl\/en\/groups\/networks-and-optimization\/events\/sagt-2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}