{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T04:13:48Z","timestamp":1746245628979,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030046170"},{"type":"electronic","value":"9783030046187"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-04618-7_9","type":"book-chapter","created":{"date-parts":[[2018,11,16]],"date-time":"2018-11-16T20:47:58Z","timestamp":1542401278000},"page":"98-110","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Approximation and Competitive Algorithms for Single-Minded Selling Problem"],"prefix":"10.1007","author":[{"given":"Francis Y. L.","family":"Chin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheung-Hung","family":"Poon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hing-Fung","family":"Ting","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongxiao","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,17]]},"reference":[{"issue":"2","key":"9_CR1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/1721837.1721851","volume":"6","author":"N Bansal","year":"2010","unstructured":"Bansal, N., Chen, N., Cherniavsky, N., Rurda, A., Schieber, B., Sviridenko, M.: Dynamic pricing for impatient bidders. ACM Trans. Algorithms 6(2), 35 (2010)","journal-title":"ACM Trans. Algorithms"},{"key":"9_CR2","unstructured":"Briest, P., Krysta, P.: Buying cheap is expensive: hardness of non-parametric multi-product pricing. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 716\u2013725, 07\u201309 January 2007, New Orleans, Louisiana"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-32512-0_7","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"P Chalermsook","year":"2012","unstructured":"Chalermsook, P., Chuzhoy, J., Kannan, S., Khanna, S.: Improved hardness results for profit maximization pricing problems with unlimited supply. In: Gupta, A., Jansen, K., Rolim, J., Servedio, R. (eds.) APPROX\/RANDOM -2012. LNCS, vol. 7408, pp. 73\u201384. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32512-0_7"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Chalermsook, P., Laekhanukit, B., Nanongkai, D.: Independent set, induced matching, and pricing: connections and tight (subexponential time) approximation hardnesses. In: Proceedings of FOCS 2013, pp. 370\u2013379 (2013)","DOI":"10.1109\/FOCS.2013.47"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Chen, N., Ghosh, A., Vassilvitskii, S.: Optimal envy-free pricing with metric substitutability. In: Proceedings of the 9th ACM conference on Electronic commerce (EC 2008), pp. 60\u201369 (2008)","DOI":"10.1145\/1386790.1386803"},{"key":"9_CR6","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 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2008), pp. 35\u201344 (2008)","DOI":"10.1109\/FOCS.2008.15"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.tcs.2015.05.034","volume":"607","author":"FYL Chin","year":"2015","unstructured":"Chin, F.Y.L., et al.: Competitive algorithms for unbounded one-way trading. Theor. Comput. Sci. 607, 35\u201348 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/978-3-319-71150-8_36","volume-title":"Combinatorial Optimization and Applications","author":"FYL Chin","year":"2017","unstructured":"Chin, F.Y.L., Lau, F.C.M., Tan, H., Ting, H.-F., Zhang, Y.: Unbounded one-way trading on distributions with monotone hazard rate. In: Gao, X., Du, H., Han, M. (eds.) COCOA 2017. LNCS, vol. 10627, pp. 439\u2013449. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71150-8_36"},{"issue":"1","key":"9_CR9","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s00453-001-0003-0","volume":"30","author":"R El-Yaniv","year":"2001","unstructured":"El-Yaniv, R., Fiat, A., Karp, R., Turpin, G.: Optimal search and one-way trading online algorithms. Algorithmica 30(1), 101\u2013139 (2001)","journal-title":"Algorithmica"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/978-3-642-10841-9_48","volume-title":"Internet and Network Economics","author":"A Fiat","year":"2009","unstructured":"Fiat, A., Wingarten, A.: Envy, multi envy, and revenue maximization. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 498\u2013504. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10841-9_48"},{"issue":"1","key":"9_CR11","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10878-009-9239-4","volume":"21","author":"H Fujiwara","year":"2011","unstructured":"Fujiwara, H., Iwama, K., Sekiguchi, Y.: Average-case competitive analyses for one-way trading. J. Comb. Optim. 21(1), 83\u2013107 (2011)","journal-title":"J. Comb. Optim."},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-642-17572-5_41","volume-title":"Internet and Network Economics","author":"S Im","year":"2010","unstructured":"Im, S., Lu, P., Wang, Y.: Envy-free pricing with general supply constraints. In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 483\u2013491. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17572-5_41"},{"issue":"2","key":"9_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., Ting, H.-F.: Online pricing for bundles of multiple items. J. Glob. Optim. 58(2), 377\u2013387 (2014)","journal-title":"J. Glob. Optim."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04618-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:57:49Z","timestamp":1710338269000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04618-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046170","9783030046187"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04618-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"17 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Applications in Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aaim2018.wordpress.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}