{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:28:30Z","timestamp":1750307310087,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,5]],"date-time":"2011-06-05T00:00:00Z","timestamp":1307232000000},"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":[[2011,6,5]]},"DOI":"10.1145\/1993574.1993582","type":"proceedings-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T11:53:52Z","timestamp":1307361232000},"page":"39-48","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Hiring a secretary from a poset"],"prefix":"10.1145","author":[{"given":"Ravi","family":"Kumar","sequence":"first","affiliation":[{"name":"Yahoo! Research, Santa Clara, CA, USA"}]},{"given":"Silvio","family":"Lattanzi","sequence":"additional","affiliation":[{"name":"Google Inc., New York, NY, USA"}]},{"given":"Sergei","family":"Vassilvitskii","sequence":"additional","affiliation":[{"name":"Yahoo! Research, New York, NY, USA"}]},{"given":"Andrea","family":"Vattani","sequence":"additional","affiliation":[{"name":"UC San Diego, San Diego, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2011,6,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480195290017"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496905"},{"key":"e_1_3_2_1_3_1","first-page":"434","volume-title":"Proc. 18th SODA","author":"Babaioff M.","year":"2007","unstructured":"M. Babaioff , N. Immorlica , and R. Kleinberg . Matroids, secretary problems, and online mechanisms . In Proc. 18th SODA , pages 434 -- 443 , 2007 . M. Babaioff, N. Immorlica, and R. Kleinberg. Matroids, secretary problems, and online mechanisms. In Proc. 18th SODA, pages 434--443, 2007."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1399589.1399596"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1019160340"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13036-6_13"},{"key":"e_1_3_2_1_7_1","first-page":"627","article-title":"The optimum choice of the instant for stopping a Markov process","volume":"4","author":"Dynkin E. B.","year":"1963","unstructured":"E. B. Dynkin . The optimum choice of the instant for stopping a Markov process . Sov. Math. Dokl. , 4 : 627 -- 629 , 1963 . E. B. Dynkin. The optimum choice of the instant for stopping a Markov process. Sov. Math. Dokl., 4:627--629, 1963.","journal-title":"Sov. Math. Dokl."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1214\/ss\/1177012493"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1214\/ECP.v15-1579"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.v32:3"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/125\/1160617"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1940179.1940200"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/988772.988784"},{"key":"e_1_3_2_1_14_1","first-page":"630","volume-title":"Proc. 16th SODA","author":"Kleinberg R.","year":"2005","unstructured":"R. Kleinberg . A multiple-choice secretary problem with applications to online auctions . In Proc. 16th SODA , pages 630 -- 631 , 2005 . R. Kleinberg. A multiple-choice secretary problem with applications to online auctions. In Proc. 16th SODA, pages 630--631, 2005."},{"key":"e_1_3_2_1_15_1","first-page":"439","volume-title":"Proc. 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms","author":"Kozik J.","year":"2010","unstructured":"J. Kozik . Dynamic threshold strategy for universal best choice problem . In Proc. 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms , pages 439 -- 452 , 2010 . J. Kozik. Dynamic threshold strategy for universal best choice problem. In Proc. 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms, pages 439--452, 2010."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548301004977"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1886521.1886526"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(97)00091-5"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(99)00053-X"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133133"}],"event":{"name":"EC '11: ACM Conference on Electronic Commerce","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"San Jose California USA","acronym":"EC '11"},"container-title":["Proceedings of the 12th ACM conference on Electronic commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993574.1993582","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993574.1993582","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:00:05Z","timestamp":1750244405000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993574.1993582"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,5]]},"references-count":20,"alternative-id":["10.1145\/1993574.1993582","10.1145\/1993574"],"URL":"https:\/\/doi.org\/10.1145\/1993574.1993582","relation":{},"subject":[],"published":{"date-parts":[[2011,6,5]]},"assertion":[{"value":"2011-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}