{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:42:38Z","timestamp":1742996558819,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031598340"},{"type":"electronic","value":"9783031598357"}],"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-59835-7_11","type":"book-chapter","created":{"date-parts":[[2024,5,21]],"date-time":"2024-05-21T07:05:03Z","timestamp":1716275103000},"page":"139-153","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Adaptivity Gaps in\u00a0Two-Sided Assortment Optimization"],"prefix":"10.1007","author":[{"given":"Omar","family":"El Housni","sequence":"first","affiliation":[]},{"given":"Alfredo","family":"Torrico","sequence":"additional","affiliation":[]},{"given":"Ulyssee","family":"Hennebelle","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,22]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Ding, Y., Saberi, A., Ye, Y.: Correlation robust stochastic optimization. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1087\u20131096. SIAM (2010)","DOI":"10.1137\/1.9781611973075.88"},{"issue":"4","key":"11_CR2","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1016\/j.orl.2022.04.002","volume":"50","author":"A Ahmed","year":"2022","unstructured":"Ahmed, A., Sohoni, M.G., Bandi, C.: Parameterized approximations for the two-sided assortment optimization. Oper. Res. Lett. 50(4), 399\u2013406 (2022)","journal-title":"Oper. Res. Lett."},{"issue":"6","key":"11_CR3","doi-asserted-by":"publisher","first-page":"1661","DOI":"10.1287\/opre.2018.1754","volume":"66","author":"A Aouad","year":"2018","unstructured":"Aouad, A., Farias, V., Levi, R., Segev, D.: The approximability of assortment optimization under ranking preferences. Oper. Res. 66(6), 1661\u20131669 (2018)","journal-title":"Oper. Res."},{"issue":"4","key":"11_CR4","doi-asserted-by":"publisher","first-page":"2069","DOI":"10.1287\/mnsc.2022.4464","volume":"69","author":"A Aouad","year":"2023","unstructured":"Aouad, A., Saban, D.: Online assortment optimization for two-sided matching platforms. Manag. Sci. 69(4), 2069\u20132087 (2023)","journal-title":"Manag. Sci."},{"issue":"3","key":"11_CR5","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1287\/msom.2020.0927","volume":"23","author":"N Arnosti","year":"2021","unstructured":"Arnosti, N., Johari, R., Kanoria, Y.: Managing congestion in matching markets. Manuf. Serv. Oper. Manag. 23(3), 620\u2013636 (2021)","journal-title":"Manuf. Serv. Oper. Manag."},{"issue":"5","key":"11_CR6","doi-asserted-by":"publisher","first-page":"2163","DOI":"10.1287\/mnsc.2018.3265","volume":"66","author":"I Ashlagi","year":"2020","unstructured":"Ashlagi, I., Braverman, M., Kanoria, Y., Shi, P.: Clearing matching markets efficiently: informative signals and match recommendations. Manag. Sci. 66(5), 2163\u20132193 (2020)","journal-title":"Manag. Sci."},{"issue":"5","key":"11_CR7","doi-asserted-by":"publisher","first-page":"2784","DOI":"10.1287\/opre.2022.2327","volume":"70","author":"I Ashlagi","year":"2022","unstructured":"Ashlagi, I., Krishnaswamy, A.K., Makhijani, R., Saban, D., Shiragur, K.: Technical note-assortment planning for two-sided sequential matching markets. Oper. Res. 70(5), 2784\u20132803 (2022)","journal-title":"Oper. Res."},{"issue":"4","key":"11_CR8","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/s00453-019-00610-8","volume":"82","author":"G Berbeglia","year":"2020","unstructured":"Berbeglia, G., Joret, G.: Assortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortments. Algorithmica 82(4), 681\u2013720 (2020)","journal-title":"Algorithmica"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Besbes, O., Fonseca, Y., Lobel, I., Zheng, F.: Signaling competition in two-sided markets. Available at SSRN (2023)","DOI":"10.2139\/ssrn.4451693"},{"issue":"4","key":"11_CR10","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1287\/opre.2016.1505","volume":"64","author":"J Blanchet","year":"2016","unstructured":"Blanchet, J., Gallego, G., Goyal, V.: A Markov chain approximation to choice modeling. Oper. Res. 64(4), 886\u2013905 (2016)","journal-title":"Oper. Res."},{"key":"11_CR11","unstructured":"Davis, J., Gallego, G., Topaloglu, H.: Assortment planning under the multinomial logit model with totally unimodular constraint structures. Work in Progress (2013)"},{"issue":"2","key":"11_CR12","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)","journal-title":"Oper. Res."},{"issue":"2","key":"11_CR13","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1287\/mnsc.2018.3230","volume":"66","author":"A D\u00e9sir","year":"2020","unstructured":"D\u00e9sir, A., Goyal, V., Segev, D., Ye, C.: Constrained assortment optimization under the Markov chain-based choice model. Manag. Sci. 66(2), 698\u2013721 (2020)","journal-title":"Manag. Sci."},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Feng, Y., Niazadeh, R., Saberi, A.: Near-optimal Bayesian online assortment of reusable resources. In: Proceedings of the 23rd ACM Conference on Economics and Computation, pp. 964\u2013965 (2022)","DOI":"10.1145\/3490486.3538320"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Fradkin, A.: Search frictions and the design of online marketplaces. Technical report, Working Paper, MIT (2015)","DOI":"10.4108\/eai.8-8-2015.2260850"},{"issue":"6","key":"11_CR16","doi-asserted-by":"publisher","first-page":"1532","DOI":"10.1287\/mnsc.2014.1939","volume":"60","author":"N Golrezaei","year":"2014","unstructured":"Golrezaei, N., Nazerzadeh, H., Rusmevichientong, P.: Real-time optimization of personalized assortments. Manag. Sci. 60(6), 1532\u20131551 (2014)","journal-title":"Manag. Sci."},{"issue":"7","key":"11_CR17","doi-asserted-by":"publisher","first-page":"4772","DOI":"10.1287\/mnsc.2021.4134","volume":"68","author":"XY Gong","year":"2022","unstructured":"Gong, X.Y., Goyal, V., Iyengar, G.N., Simchi-Levi, D., Udwani, R., Wang, S.: Online assortment optimization with reusable resources. Manag. Sci. 68(7), 4772\u20134785 (2022)","journal-title":"Manag. Sci."},{"key":"11_CR18","unstructured":"Goyal, V., Iyengar, G., Udwani, R.: Asymptotically optimal competitive ratio for online allocation of reusable resources. arXiv preprint arXiv:2002.02430 (2020)"},{"issue":"8","key":"11_CR19","doi-asserted-by":"publisher","first-page":"3574","DOI":"10.1287\/mnsc.2017.2797","volume":"64","author":"H Halaburda","year":"2018","unstructured":"Halaburda, H., Jan Piskorski, M., Y\u0131ld\u0131r\u0131m, P.: Competing by restricting choice: the case of matching platforms. Manag. Sci. 64(8), 3574\u20133594 (2018)","journal-title":"Manag. Sci."},{"issue":"1","key":"11_CR20","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1257\/aer.100.1.130","volume":"100","author":"GJ Hitsch","year":"2010","unstructured":"Hitsch, G.J., Horta\u00e7su, A., Ariely, D.: Matching and sorting in online dating. Am. Econ. Rev. 100(1), 130\u201363 (2010)","journal-title":"Am. Econ. Rev."},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-642-17572-5_45","volume-title":"Internet and Network Economics","author":"JJ Horton","year":"2010","unstructured":"Horton, J.J.: Online labor markets. In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 515\u2013522. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17572-5_45"},{"issue":"2","key":"11_CR22","first-page":"345","volume":"35","author":"JJ Horton","year":"2017","unstructured":"Horton, J.J.: The effects of algorithmic labor market recommendations: evidence from a field experiment. J. Law Econ. 35(2), 345\u2013385 (2017)","journal-title":"J. Law Econ."},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Immorlica, N., Lucier, B., Manshadi, V., Wei, A.: Designing approximately optimal search on matching platforms. In: Proceedings of the 22nd ACM Conference on Economics and Computation, pp. 632\u2013633 (2021)","DOI":"10.1145\/3465456.3467530"},{"issue":"10","key":"11_CR24","doi-asserted-by":"publisher","first-page":"5990","DOI":"10.1287\/mnsc.2020.3794","volume":"67","author":"Y Kanoria","year":"2021","unstructured":"Kanoria, Y., Saban, D.: Facilitating the search for partners on matching platforms. Manag. Sci. 67(10), 5990\u20136029 (2021)","journal-title":"Manag. Sci."},{"key":"11_CR25","series-title":"International Series in Operations Research and Management Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-0-387-78902-6_6","volume-title":"Retail Supply Chain Management","author":"AG K\u00f6k","year":"2008","unstructured":"K\u00f6k, A.G., Fisher, M.L., Vaidyanathan, R.: Assortment planning: review of literature and industry practice. In: Agrawal, N., Smith, S. (eds.) Retail Supply Chain Management. ISOR, vol. 122, pp. 99\u2013153. Springer, Boston (2008). https:\/\/doi.org\/10.1007\/978-0-387-78902-6_6"},{"issue":"6","key":"11_CR26","doi-asserted-by":"publisher","first-page":"1787","DOI":"10.1287\/opre.2019.1957","volume":"68","author":"W Ma","year":"2020","unstructured":"Ma, W., Simchi-Levi, D.: Algorithms for online matching, assortment, and pricing with tight weight-dependent competitive ratios. Oper. Res. 68(6), 1787\u20131803 (2020)","journal-title":"Oper. Res."},{"issue":"9","key":"11_CR27","doi-asserted-by":"publisher","first-page":"6572","DOI":"10.1287\/mnsc.2021.4220","volume":"68","author":"V Manshadi","year":"2022","unstructured":"Manshadi, V., Rodilitz, S.: Online policies for efficient volunteer crowdsourcing. Manag. Sci. 68(9), 6572\u20136590 (2022)","journal-title":"Manag. Sci."},{"issue":"4","key":"11_CR28","doi-asserted-by":"publisher","first-page":"1304","DOI":"10.1287\/msom.2022.1107","volume":"25","author":"I Rios","year":"2023","unstructured":"Rios, I., Saban, D., Zheng, F.: Improving match rates in dating markets through assortment optimization. Manuf. Serv. Oper. Manag. 25(4), 1304\u20131323 (2023)","journal-title":"Manuf. Serv. Oper. Manag."},{"key":"11_CR29","unstructured":"Rios, I., Torrico, A.: Platform design in matching markets: a two-sided assortment optimization approach. arXiv preprint arXiv:2308.02584 (2023)"},{"issue":"4","key":"11_CR30","doi-asserted-by":"publisher","first-page":"990","DOI":"10.1162\/154247603322493212","volume":"1","author":"JC Rochet","year":"2003","unstructured":"Rochet, J.C., Tirole, J.: Platform competition in two-sided markets. J. Eur. Econ. Assoc. 1(4), 990\u20131029 (2003)","journal-title":"J. Eur. Econ. Assoc."},{"issue":"6","key":"11_CR31","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":"11","key":"11_CR32","doi-asserted-by":"publisher","first-page":"2023","DOI":"10.1111\/poms.12191","volume":"23","author":"P Rusmevichientong","year":"2014","unstructured":"Rusmevichientong, P., Shmoys, D., Tong, C., Topaloglu, H.: Assortment optimization under the multinomial logit model with random choice parameters. Prod. Oper. Manag. 23(11), 2023\u20132039 (2014)","journal-title":"Prod. Oper. Manag."},{"key":"11_CR33","doi-asserted-by":"crossref","unstructured":"Shi, P.: Optimal match recommendations in two-sided marketplaces with endogenous prices. Available at SSRN 4034950 (2022)","DOI":"10.2139\/ssrn.4034950"},{"issue":"3","key":"11_CR34","doi-asserted-by":"publisher","first-page":"1323","DOI":"10.1287\/mnsc.2022.4444","volume":"69","author":"P Shi","year":"2023","unstructured":"Shi, P.: Optimal matchmaking strategy in two-sided marketplaces. Manag. Sci. 69(3), 1323\u20131340 (2023)","journal-title":"Manag. Sci."},{"issue":"1","key":"11_CR35","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."},{"key":"11_CR36","unstructured":"Torrico, A., Carvalho, M., Lodi, A.: Multi-agent assortment optimization in sequential matching markets. arXiv preprint arXiv:2006.04313 (2023)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-59835-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,21]],"date-time":"2024-05-21T07:12:49Z","timestamp":1716275569000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-59835-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031598340","9783031598357"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-59835-7_11","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":"22 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wroc\u0142aw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","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 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ipco2024.ii.uni.wroc.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}