{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T01:53:46Z","timestamp":1767837226195,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T00:00:00Z","timestamp":1568073600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,9,10]]},"DOI":"10.1145\/3298689.3347027","type":"proceedings-article","created":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T13:21:31Z","timestamp":1568208091000},"page":"160-168","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["LORE"],"prefix":"10.1145","author":[{"given":"Rahul","family":"Makhijani","sequence":"first","affiliation":[{"name":"Facebook"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shreya","family":"Chakrabarti","sequence":"additional","affiliation":[{"name":"Amazon"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dale","family":"Struble","sequence":"additional","affiliation":[{"name":"Amazon"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Liu","sequence":"additional","affiliation":[{"name":"Amazon"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,9,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2037661.2037665"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2740908.2745398"},{"key":"e_1_3_2_1_3_1","volume-title":"Devanur","author":"Agrawal Shipra","year":"2015","unstructured":"Shipra Agrawal and Nikhil R . Devanur . 2015 . Fast Algorithms for Online Stochastic Convex Programming . (2015), 1405--1424. Shipra Agrawal and Nikhil R. Devanur. 2015. Fast Algorithms for Online Stochastic Convex Programming. (2015), 1405--1424."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/2765026.2765038"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3164539"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/371920.372071"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/120829"},{"key":"e_1_3_2_1_8_1","volume-title":"Using Random Forest to Learn Imbalanced Data. https:\/\/statistics.berkeley.edu\/tech-reports\/666","author":"Chao Chen Andy Liaw","year":"2004","unstructured":"Andy Liaw Chao Chen and Leo Breiman . 2004. Using Random Forest to Learn Imbalanced Data. https:\/\/statistics.berkeley.edu\/tech-reports\/666 ( 2004 ). Andy Liaw Chao Chen and Leo Breiman. 2004. Using Random Forest to Learn Imbalanced Data. https:\/\/statistics.berkeley.edu\/tech-reports\/666 (2004)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2012.02.038"},{"key":"e_1_3_2_1_10_1","unstructured":"Miroslav Dud\u00edk John Langford and Lihong Li. 2011. Doubly Robust Policy Evaluation and Learning. (2011) 1097--1104. http:\/\/dl.acm.org\/citation.cfm?id=3104482.3104620   Miroslav Dud\u00edk John Langford and Lihong Li. 2011. Doubly Robust Policy Evaluation and Learning. (2011) 1097--1104. http:\/\/dl.acm.org\/citation.cfm?id=3104482.3104620"},{"key":"e_1_3_2_1_11_1","first-page":"8","article-title":"Optimal Dynamic Pricing of Inventories with Stochastic Demand over Finite Horizons. Manage","volume":"40","author":"Gallego Guillermo","year":"1994","unstructured":"Guillermo Gallego and Garrett van Ryzin . 1994 . Optimal Dynamic Pricing of Inventories with Stochastic Demand over Finite Horizons. Manage . Sci. 40 , 8 (Aug. 1994), 999--1020. Guillermo Gallego and Garrett van Ryzin. 1994. Optimal Dynamic Pricing of Inventories with Stochastic Demand over Finite Horizons. Manage. Sci. 40, 8 (Aug. 1994), 999--1020.","journal-title":"Sci."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2014.1939"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Trevor Hastie Robert Tibshirani and Jerome Friedman. 2001. The Elements of Statistical Learning. (2001).  Trevor Hastie Robert Tibshirani and Jerome Friedman. 2001. The Elements of Statistical Learning. (2001).","DOI":"10.1007\/978-0-387-21606-5"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1080\/00401706.1995.10484303"},{"key":"e_1_3_2_1_15_1","unstructured":"Kevin Hillstrom. 2008. The MineThatData e-mail analytics and data mining challenge. http:\/\/blog.minethatdata.com\/2008\/03\/minethatdata-e-mailanalytics-and-data.html (2008).  Kevin Hillstrom. 2008. The MineThatData e-mail analytics and data mining challenge. http:\/\/blog.minethatdata.com\/2008\/03\/minethatdata-e-mailanalytics-and-data.html (2008)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1198\/106186008X320456"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACII.2013.47"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2914803"},{"key":"e_1_3_2_1_19_1","unstructured":"Pooria Joulani Andras Gyorgy and Csaba Szepesv\u00e1ri. 2013. Online learning under delayed feedback. (2013) 1453--1461.   Pooria Joulani Andras Gyorgy and Csaba Szepesv\u00e1ri. 2013. Online learning under delayed feedback. (2013) 1453--1461."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3133034"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1348599.1348601"},{"key":"e_1_3_2_1_22_1","unstructured":"Tor Lattimore and Csaba Szepesvari. 2018. Bandit Algorithms. (2018).  Tor Lattimore and Csaba Szepesvari. 2018. Bandit Algorithms. (2018)."},{"key":"e_1_3_2_1_23_1","volume-title":"Large-scale Validation of Counterfactual Learning Methods: A Test-Bed. CoRR abs\/1612.00367","author":"Lefortier Damien","year":"2016","unstructured":"Damien Lefortier , Adith Swaminathan , Xiaotao Gu , Thorsten Joachims , and Maarten de Rijke . 2016. Large-scale Validation of Counterfactual Learning Methods: A Test-Bed. CoRR abs\/1612.00367 ( 2016 ). arXiv:1612.00367 http:\/\/arxiv.org\/abs\/1612.00367 Damien Lefortier, Adith Swaminathan, Xiaotao Gu, Thorsten Joachims, and Maarten de Rijke. 2016. Large-scale Validation of Counterfactual Learning Methods: A Test-Bed. CoRR abs\/1612.00367 (2016). arXiv:1612.00367 http:\/\/arxiv.org\/abs\/1612.00367"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2740908.2742562"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1214\/14-STS500"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1057\/jma.2015.5"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/772862.772872"},{"issue":"1","key":"e_1_3_2_1_28_1","first-page":"77","article-title":"Portfolio Selection","volume":"7","author":"Markowitz Harry","year":"1952","unstructured":"Harry Markowitz . 1952 . Portfolio Selection . The Journal of Finance , vol. 7 , no. 1 , pp. 77 -- 91 (1952). Harry Markowitz. 1952. Portfolio Selection. The Journal of Finance, vol. 7, no. 1, pp. 77--91 (1952).","journal-title":"The Journal of Finance"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1284320.1284321"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102430"},{"key":"e_1_3_2_1_31_1","volume-title":"Proceedings of Credit Scoring and Credit Control VI, Credit Research Centre, University of Edinburgh Management School","author":"Radcliffe N.","year":"1999","unstructured":"N. J.; Radcliffe and P. D. Surry . 1999. Differential response analysis: Modelling true response by isolating the effect of a single action , in Proceedings of Credit Scoring and Credit Control VI, Credit Research Centre, University of Edinburgh Management School ( 1999 ). N. J.; Radcliffe and P. D. Surry. 1999. Differential response analysis: Modelling true response by isolating the effect of a single action, in Proceedings of Credit Scoring and Credit Control VI, Credit Research Centre, University of Edinburgh Management School (1999)."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/70.1.41"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3285029"},{"key":"e_1_3_2_1_34_1","volume-title":"Proceedings of the 20th International Conference on Machine Learning (ICML '03)","author":"Si L.","year":"2003","unstructured":"L. Si and R. Jin . 2003. Flexible mixture model for collaborative filtering . Proceedings of the 20th International Conference on Machine Learning (ICML '03) ( 2003 ), 704--711. L. Si and R. Jin. 2003. Flexible mixture model for collaborative filtering. Proceedings of the 20th International Conference on Machine Learning (ICML '03) (2003), 704--711."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2016.1573"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1155\/2009\/421425"},{"key":"e_1_3_2_1_37_1","unstructured":"Adith Swaminathan and Thorsten Joachims. 2015. The Self-normalized Estimator for Counterfactual Learning. (2015) 3231--3239. http:\/\/dl.acm.org\/citation.cfm?id=2969442.2969600   Adith Swaminathan and Thorsten Joachims. 2015. The Self-normalized Estimator for Counterfactual Learning. (2015) 3231--3239. http:\/\/dl.acm.org\/citation.cfm?id=2969442.2969600"}],"event":{"name":"RecSys '19: Thirteenth ACM Conference on Recommender Systems","location":"Copenhagen Denmark","acronym":"RecSys '19"},"container-title":["Proceedings of the 13th ACM Conference on Recommender Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3298689.3347027","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3298689.3347027","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:12:55Z","timestamp":1750201975000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3298689.3347027"}},"subtitle":["a large-scale offer recommendation engine with eligibility and capacity constraints"],"short-title":[],"issued":{"date-parts":[[2019,9,10]]},"references-count":37,"alternative-id":["10.1145\/3298689.3347027","10.1145\/3298689"],"URL":"https:\/\/doi.org\/10.1145\/3298689.3347027","relation":{},"subject":[],"published":{"date-parts":[[2019,9,10]]},"assertion":[{"value":"2019-09-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}