{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T16:53:11Z","timestamp":1744217591512,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030046118"},{"type":"electronic","value":"9783030046125"}],"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-04612-5_15","type":"book-chapter","created":{"date-parts":[[2018,11,20]],"date-time":"2018-11-20T15:09:45Z","timestamp":1542726585000},"page":"218-231","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Combinatorial Assortment Optimization"],"prefix":"10.1007","author":[{"given":"Nicole","family":"Immorlica","sequence":"first","affiliation":[]},{"given":"Brendan","family":"Lucier","sequence":"additional","affiliation":[]},{"given":"Jieming","family":"Mao","sequence":"additional","affiliation":[]},{"given":"Vasilis","family":"Syrgkanis","sequence":"additional","affiliation":[]},{"given":"Christos","family":"Tzamos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,21]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","unstructured":"Agrawal, S., Avadhanula, V., Goyal, V., Zeevi, A.: A near-optimal exploration-exploitation approach for assortment selection. In: Proceedings of the 2016 ACM Conference on Economics and Computation, EC 2016, pp. 599\u2013600. ACM, New York (2016). https:\/\/doi.org\/10.1145\/2940716.2940779","DOI":"10.1145\/2940716.2940779"},{"issue":"1","key":"15_CR2","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1287\/opre.2015.1459","volume":"64","author":"A Alptekinolu","year":"2016","unstructured":"Alptekinolu, A., Semple, J.H.: The exponomial choice model: a new alternative for assortment and price optimization. Oper. Res. 64(1), 79\u201393 (2016)","journal-title":"Oper. Res."},{"issue":"3","key":"15_CR3","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1287\/opre.1080.0567","volume":"57","author":"JJM Bront","year":"2009","unstructured":"Bront, J.J.M., M\u00e9ndez-D\u00edaz, I., Vulcano, G.: A column generation algorithm for choice-based network revenue management. Oper. Res. 57(3), 769\u2013784 (2009). https:\/\/doi.org\/10.1287\/opre.1080.0567","journal-title":"Oper. Res."},{"key":"15_CR4","doi-asserted-by":"publisher","unstructured":"Cai, Y., Daskalakis, C., Weinberg, S.M.: Optimal multi-dimensional mechanism design: reducing revenue to welfare maximization. In: Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, FOCS 2012, pp. 130\u2013139. IEEE Computer Society, Washington (2012). https:\/\/doi.org\/10.1109\/FOCS.2012.88","DOI":"10.1109\/FOCS.2012.88"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1287\/mnsc.1060.0613","volume":"53","author":"F Caro","year":"2007","unstructured":"Caro, F., Gallien, J.: Dynamic assortment with demand learning for seasonal consumer goods. Manag. Sci. 53, 276\u2013292 (2007)","journal-title":"Manag. Sci."},{"key":"15_CR6","doi-asserted-by":"publisher","unstructured":"Chawla, S., Hartline, J.D., Malec, D.L., Sivan, B.: Multi-parameter mechanism design and sequential posted pricing. In: Proceedings of the Forty-second ACM Symposium on Theory of Computing, STOC 2010, pp. 311\u2013320. ACM, New York (2010). https:\/\/doi.org\/10.1145\/1806689.1806733","DOI":"10.1145\/1806689.1806733"},{"issue":"2","key":"15_CR7","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1287\/opre.2014.1256","volume":"62","author":"JM Davis","year":"2014","unstructured":"Davis, J.M., Gallego, G., Topaloglu, H.: Assortment optimization under variants of the nested logit model. Oper. Res. 62(2), 250\u2013273 (2014). https:\/\/doi.org\/10.1287\/opre.2014.1256","journal-title":"Oper. Res."},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Desir, A., Goyal, V.: Near-optimal algorithms for capacity constrained assortment optimization. Technical report, Department of Industrial Engineering and Operations Research, Columbia University (2015)","DOI":"10.2139\/ssrn.2543309"},{"issue":"1","key":"15_CR9","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1137\/070680977","volume":"39","author":"U Feige","year":"2009","unstructured":"Feige, U.: On maximizing welfare when utility functions are subadditive. SIAM J. Comput. 39(1), 122\u2013142 (2009). https:\/\/doi.org\/10.1137\/070680977","journal-title":"SIAM J. Comput."},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Haghpanah, N., Hartline, J.: Reverse mechanism design. In: Proceedings of the Sixteenth ACM Conference on Economics and Computation, pp. 757\u2013758. ACM (2015)","DOI":"10.1145\/2764468.2764498"},{"key":"15_CR11","doi-asserted-by":"publisher","unstructured":"Kleinberg, J., Mullainathan, S., Ugander, J.: Comparison-based choices. In: Proceedings of the 2017 ACM Conference on Economics and Computation, EC 2017, pp. 127\u2013144. ACM, New York (2017). https:\/\/doi.org\/10.1145\/3033274.3085134","DOI":"10.1145\/3033274.3085134"},{"key":"15_CR12","doi-asserted-by":"publisher","unstructured":"Lehmann, B., Lehmann, D., Nisan, N.: Combinatorial auctions with decreasing marginal utilities. In: Proceedings of the 3rd ACM Conference on Electronic Commerce, EC 2001, pp. 18\u201328. ACM, New York (2001). https:\/\/doi.org\/10.1145\/501158.501161","DOI":"10.1145\/501158.501161"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/j.geb.2017.10.016","volume":"106","author":"RP Leme","year":"2017","unstructured":"Leme, R.P.: Gross substitutability: an algorithmic survey. Games Econ. Behav. 106, 294\u2013316 (2017). https:\/\/doi.org\/10.1016\/j.geb.2017.10.016. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0899825617301884","journal-title":"Games Econ. Behav."},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.dam.2012.03.003","volume":"164","author":"I M\u00e9ndez-D\u00edaz","year":"2014","unstructured":"M\u00e9ndez-D\u00edaz, I., Miranda-Bront, J.J., Vulcano, G., Zabala, P.: A branch-and-cut algorithm for the latent-class logit assortment problem. Discrete Appl. Math. 164, 246\u2013263 (2014). https:\/\/doi.org\/10.1016\/j.dam.2012.03.003","journal-title":"Discrete Appl. Math."},{"issue":"6","key":"15_CR15","doi-asserted-by":"publisher","first-page":"1666","DOI":"10.1287\/opre.1100.0866","volume":"58","author":"P Rusmevichientong","year":"2010","unstructured":"Rusmevichientong, P., Shen, Z.J.M., Shmoys, D.B.: Dynamic assortment optimization with a multinomial logit choice model and capacity constraint. Oper. Res. 58(6), 1666\u20131680 (2010)","journal-title":"Oper. Res."},{"issue":"1","key":"15_CR16","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1287\/mnsc.1030.0147","volume":"50","author":"K Talluri","year":"2004","unstructured":"Talluri, K., van Ryzin, G.: Revenue management under a general discrete choice model of consumer behavior. Manag. Sci. 50(1), 15\u201333 (2004)","journal-title":"Manag. Sci."},{"issue":"4","key":"15_CR17","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1287\/opre.1120.1067","volume":"60","author":"C Ulu","year":"2012","unstructured":"Ulu, C., Honhon, D., Alptekinolu, A.: Learning consumer tastes through dynamic assortments. Oper. Res. 60(4), 833\u2013849 (2012)","journal-title":"Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04612-5_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:34:51Z","timestamp":1709825691000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04612-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046118","9783030046125"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04612-5_15","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":"21 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oxford","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.ox.ac.uk\/conferences\/wine2018\/","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":"Easy Chiar","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","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":"28","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":"8","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":"24% - 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":"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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}