{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:16:48Z","timestamp":1750220208635,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T00:00:00Z","timestamp":1657584000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Science Foundation","award":["CMMI-1653477"],"award-info":[{"award-number":["CMMI-1653477"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,12]]},"DOI":"10.1145\/3490486.3538371","type":"proceedings-article","created":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T13:29:36Z","timestamp":1657718976000},"page":"1146-1147","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["The Multi-secretary Problem with Many Types"],"prefix":"10.1145","author":[{"given":"Omar","family":"Besbes","sequence":"first","affiliation":[{"name":"Columbia Business School, New York, NY, USA"}]},{"given":"Yash","family":"Kanoria","sequence":"additional","affiliation":[{"name":"Columbia Business School, New York, NY, USA"}]},{"given":"Akshit","family":"Kumar","sequence":"additional","affiliation":[{"name":"Columbia Business School, New York, NY, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1287\/stsy.2018.0028"},{"key":"e_1_3_2_1_2_1","volume-title":"Survey of dynamic resource constrained reward collection problems: Unified model and analysis. Available at SSRN 3963265","author":"Balseiro S","year":"2021","unstructured":"Balseiro S , Besbes O , Pizarro D ( 2021 ) Survey of dynamic resource constrained reward collection problems: Unified model and analysis. Available at SSRN 3963265 . Balseiro S, Besbes O, Pizarro D (2021) Survey of dynamic resource constrained reward collection problems: Unified model and analysis. Available at SSRN 3963265."},{"key":"e_1_3_2_1_3_1","volume-title":"Does the multisecretary problem always have bounded regret? Available at SSRN 3497056","author":"Bray R","year":"2019","unstructured":"Bray R ( 2019 ) Does the multisecretary problem always have bounded regret? Available at SSRN 3497056 . Bray R (2019) Does the multisecretary problem always have bounded regret? Available at SSRN 3497056."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2019.3365"},{"key":"e_1_3_2_1_5_1","first-page":"18","article-title":"Mathematical questions with their solutions","volume":"23","author":"Cayley A","year":"1875","unstructured":"Cayley A ( 1875 ) Mathematical questions with their solutions . The Educational Times 23 : 18 -- 19 . Cayley A (1875) Mathematical questions with their solutions. The Educational Times 23:18--19.","journal-title":"The Educational Times"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2770661.2770673"},{"key":"e_1_3_2_1_7_1","volume-title":"Who solved the secretary problem? Statistical science 4(3):282--289","author":"Ferguson TS","year":"1989","unstructured":"Ferguson TS ( 1989 ) Who solved the secretary problem? Statistical science 4(3):282--289 . Ferguson TS (1989) Who solved the secretary problem? Statistical science 4(3):282--289."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.2307\/1402748"},{"key":"e_1_3_2_1_9_1","volume-title":"Optimal dynamic pricing of inventories with stochastic demand over finite horizons. Management science 40(8):999--1020","author":"Gallego G","year":"1994","unstructured":"Gallego G , Van Ryzin G ( 1994 ) Optimal dynamic pricing of inventories with stochastic demand over finite horizons. Management science 40(8):999--1020 . Gallego G, Van Ryzin G (1994) Optimal dynamic pricing of inventories with stochastic demand over finite horizons. Management science 40(8):999--1020."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2015.1441"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1070432.1070519"},{"key":"e_1_3_2_1_12_1","volume-title":"The dynamic and stochastic knapsack problem. Operations research 46(1):17--35","author":"Kleywegt AJ","year":"1998","unstructured":"Kleywegt AJ , Papastavrou JD ( 1998 ) The dynamic and stochastic knapsack problem. Operations research 46(1):17--35 . Kleywegt AJ, Papastavrou JD (1998) The dynamic and stochastic knapsack problem. Operations research 46(1):17--35."},{"key":"e_1_3_2_1_13_1","first-page":"289","article-title":"On a problem of cayley","volume":"22","author":"Moser L","year":"1956","unstructured":"Moser L ( 1956 ) On a problem of cayley . Scripta Math 22 : 289 -- 292 . Moser L (1956) On a problem of cayley. Scripta Math 22:289--292.","journal-title":"Scripta Math"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1070.0288"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/b139000"},{"key":"e_1_3_2_1_16_1","volume-title":"Working paper.","author":"Vera A","year":"2020","unstructured":"Vera A , Arlotto A , Gurvich I , Levin E ( 2020 ) Dynamic resource allocation: The geometry and robustness of constant regret. Technical report , Working paper. Vera A, Arlotto A, Gurvich I, Levin E (2020) Dynamic resource allocation: The geometry and robustness of constant regret. Technical report, Working paper."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2020.3624"},{"key":"e_1_3_2_1_18_1","volume-title":"Online allocation and pricing: Constant regret via bellman inequalities. Operations Research","author":"Vera A","year":"2021","unstructured":"Vera A , Banerjee S , Gurvich I ( 2021 ) Online allocation and pricing: Constant regret via bellman inequalities. Operations Research . Vera A, Banerjee S, Gurvich I (2021) Online allocation and pricing: Constant regret via bellman inequalities. Operations Research."}],"event":{"name":"EC '22: The 23rd ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Boulder CO USA","acronym":"EC '22"},"container-title":["Proceedings of the 23rd ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490486.3538371","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490486.3538371","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:03:00Z","timestamp":1750186980000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490486.3538371"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,12]]},"references-count":18,"alternative-id":["10.1145\/3490486.3538371","10.1145\/3490486"],"URL":"https:\/\/doi.org\/10.1145\/3490486.3538371","relation":{},"subject":[],"published":{"date-parts":[[2022,7,12]]},"assertion":[{"value":"2022-07-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}