{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:47:54Z","timestamp":1760147274699,"version":"build-2065373602"},"reference-count":7,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2023,1,21]],"date-time":"2023-01-21T00:00:00Z","timestamp":1674259200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Chair of the Department of Electrical and Computer Engineering, University of New Mexico"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>We find closed-form expressions for the variance and the third moment of the number of hires in the assistant hiring algorithm, as well as asymptotic values for higher moments of this variable.<\/jats:p>","DOI":"10.3390\/a16020070","type":"journal-article","created":{"date-parts":[[2023,1,23]],"date-time":"2023-01-23T04:19:22Z","timestamp":1674447562000},"page":"70","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Moments of the Number of Hires in the Assistant Hiring Algorithm"],"prefix":"10.3390","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7805-8219","authenticated-orcid":false,"given":"Leeseok","family":"Kim","sequence":"first","affiliation":[{"name":"Electrical and Computer Engineering Department, The University of New Mexico, Albuquerque, NM 87131, USA"}]},{"given":"Jos\u00e9 Luis","family":"Palacios","sequence":"additional","affiliation":[{"name":"Electrical and Computer Engineering Department, The University of New Mexico, Albuquerque, NM 87131, USA"}]}],"member":"1968","published-online":{"date-parts":[[2023,1,21]]},"reference":[{"key":"ref_1","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., and Stein, C. (2009). Introduction to Algorithms, The MIT Press. [3rd ed.]."},{"key":"ref_2","unstructured":"Knuth, D. (1997). The Art of Computer Programming, Addison-Wesley. [3rd ed.]."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1145\/355592.365627","article-title":"A note on Linear Programming algorithm design: A combinatorial problem","volume":"9","author":"Roes","year":"1966","journal-title":"Commun. ACM"},{"key":"ref_4","first-page":"185","article-title":"On a power series having only a finite number of algebraico-logarithmic singularities on its circle of convergence","volume":"30","author":"Narumi","year":"1929","journal-title":"Tohoku Math. J."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Merris, R. (2003). Combinatorics, Wiley-Interscience. [2nd ed.].","DOI":"10.1002\/0471449687"},{"key":"ref_6","first-page":"282","article-title":"Who solved the secretary problem?","volume":"4","author":"Ferguson","year":"1989","journal-title":"Stat. Sci."},{"key":"ref_7","first-page":"3","article-title":"The postdoc variant of the secretary problem","volume":"49","author":"Vanderbei","year":"2021","journal-title":"Math. Appl. Ann. Soc. Math. Pol."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/2\/70\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T18:13:08Z","timestamp":1760119988000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/2\/70"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,21]]},"references-count":7,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2023,2]]}},"alternative-id":["a16020070"],"URL":"https:\/\/doi.org\/10.3390\/a16020070","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2023,1,21]]}}}