{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T13:40:33Z","timestamp":1726062033699},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030364113"},{"type":"electronic","value":"9783030364120"}],"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-36412-0_17","type":"book-chapter","created":{"date-parts":[[2019,12,5]],"date-time":"2019-12-05T19:04:15Z","timestamp":1575572655000},"page":"210-222","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Algorithmic Pricing for the Partial Assignment"],"prefix":"10.1007","author":[{"given":"Guichen","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Ning","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hing-Fung","family":"Ting","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yifei","family":"Zou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,23]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Azar, Y., Cohen, I.R., Roytman, A.: Online lower bounds via duality. In: Proceedings of SODA 2017, pp. 1038\u20131050 (2017)","DOI":"10.1137\/1.9781611974782.66"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Immorlica, N., Lucier, B., Weinberg, S.M.: A simple and approximately optimal mechanism for an additive buyer. In: Proceedings of FOCS 2014, pp. 21\u201330 (2014)","DOI":"10.1109\/FOCS.2014.11"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/1.9781611975482.13","volume-title":"Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Xiaohui Bei","year":"2019","unstructured":"Bei, X., Gravin, N., Lu, P., Tang, Z.G.: Correlation-robust analysis of single item auction. In: Proceedings of SODA 2019, pp. 193\u2013208 (2019)"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Cai, Y., Zhao, M.: Simple mechanisms for subadditive buyers via duality. In: Proceedings of STOC 2017, pp. 170\u2013183 (2017)","DOI":"10.1145\/3055399.3055465"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Chawla, S., Hartline, J., Kleinberg, R.: Algorithmic pricing via virtual valuations. In: Proceedings of EC 2007, pp. 243\u2013251 (2007)","DOI":"10.1145\/1250910.1250946"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"1962","DOI":"10.1137\/1.9781611975482.119","volume-title":"Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Shuchi Chawla","year":"2019","unstructured":"Chawla, S., Miller, J.B., Teng, Y.: Pricing for online resource allocation: intervals and paths. In: Proceedings of SODA 2019, pp. 1962\u20131981 (2019)"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Cheung, M., Swamy, C.: Approximation algorithms for single-minded envy-free profit-maximization problems with limited supply. In: Proceedings of FOCS 2008, pp. 35\u201344 (2008)","DOI":"10.1109\/FOCS.2008.15"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-030-04618-7_9","volume-title":"Algorithmic Aspects in Information and Management","author":"FYL Chin","year":"2018","unstructured":"Chin, F.Y.L., Poon, S.-H., Ting, H.-F., Xu, D., Yu, D., Zhang, Y.: Approximation and competitive algorithms for single-minded selling problem. In: Tang, S., Du, D.-Z., Woodruff, D., Butenko, S. (eds.) AAIM 2018. LNCS, vol. 11343, pp. 98\u2013110. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-030-04618-7_9"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"D\u00fctting, P., Feldman, M., Kesselheim, T., Lucier, B.: Prophet inequalities made easy: stochastic optimization by pricing non-stochastic inputs. In: Proceedings of FOCS 2017, pp. 540\u2013551 (2017)","DOI":"10.1109\/FOCS.2017.56"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Feldman, M., Gravin, N., Lucier, B.: Combinatorial auctions via posted prices. In: Proceedings of SODA 2015, pp. 123\u2013135 (2015)","DOI":"10.1137\/1.9781611973730.10"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1137\/1.9781611975482.14","volume-title":"Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Yaonan Jin","year":"2019","unstructured":"Jin, Y., Pinyan, L., Tang, Z.G., Xiao, T.: Tight revenue gaps among simple mechanisms. In: Proceedings of SODA 2019, pp. 209\u2013228 (2019)"},{"key":"17_CR12","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. IRSS, pp. 85\u2013103. Springer, Boston (1972). \nhttps:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"issue":"2","key":"17_CR13","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s10898-013-0043-4","volume":"58","author":"Y Zhang","year":"2014","unstructured":"Zhang, Y., Chin, F.Y., Ting, H.-F.: Online pricing for bundles of multiple items. J. Global Optim. 58(2), 377\u2013387 (2014)","journal-title":"J. Global Optim."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36412-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,5]],"date-time":"2019-12-05T19:10:59Z","timestamp":1575573059000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-36412-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030364113","9783030364120"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36412-0_17","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":"23 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xiamen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"13 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoaconference.org\/index.html","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":"108","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":"49","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":"45% - 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.2","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":"10","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}