Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Analysis of the strategy "Hiring Above the m-th Best Candidate"

Autor
Helmi, A.; Martinez, C.; Panholzer, A.
Tipus d'activitat
Article en revista
Revista
Algorithmica
Data de publicació
2014-06
Volum
70
Número
2
Pàgina inicial
267
Pàgina final
300
DOI
https://doi.org/10.1007/s00453-014-9895-3 Obrir en finestra nova
Projecte finançador
Investigación fundamental en diseño y análisis de algoritmos
Resum
The hiring problem is a simple model for on-line decision-making, inspired by the well-known and time-honored secretary problem (see, for instance, the surveys of Freeman Int Stat 51:189-206, 1983 or Samuels Handbook of sequential analysis, 1991). In the combinatorial model of the hiring problem (Archibald and Martinez Proc. of the 21st Int. Col. on Formal Power Series and Algebraic Combinatorics (FPSAC), 2009), there is a sequence of candidates of unknown length, and we can rank all candidates ...
Paraules clau
Chinese restaurant process, Hiring problem, On-line decision problems, Permutation, Records, Secretary problem, Sequential selection
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

Participants