TY - GEN
T1 - Interviewing secretaries in parallel
AU - Feldman, Moran
AU - Tennenholtz, Moshe
PY - 2012
Y1 - 2012
N2 - Motivated by the parallel nature of on-line internet help-desks and human inspections, we introduce the study of interviewing secretaries in parallel, extending upon the study of the classical secretary problem. In our setting secretaries arrive into multiple queues, and are interviewed in parallel, with the aim of recruiting several secretaries in a timely manner. We consider a variety of new problems that fit this setting, and provide both upper and lower bounds on the efficiency of the corresponding interviewing policies, contrasting them with the classical single queue setting.
AB - Motivated by the parallel nature of on-line internet help-desks and human inspections, we introduce the study of interviewing secretaries in parallel, extending upon the study of the classical secretary problem. In our setting secretaries arrive into multiple queues, and are interviewed in parallel, with the aim of recruiting several secretaries in a timely manner. We consider a variety of new problems that fit this setting, and provide both upper and lower bounds on the efficiency of the corresponding interviewing policies, contrasting them with the classical single queue setting.
KW - competitive analysis
KW - parallelization
KW - secretary problems
KW - time constraints
UR - http://www.scopus.com/inward/record.url?scp=84863514714&partnerID=8YFLogxK
U2 - 10.1145/2229012.2229053
DO - 10.1145/2229012.2229053
M3 - Conference contribution
AN - SCOPUS:84863514714
SN - 9781450314152
T3 - Proceedings of the ACM Conference on Electronic Commerce
SP - 550
EP - 567
BT - EC '12 - Proceedings of the 13th ACM Conference on Electronic Commerce
T2 - 13th ACM Conference on Electronic Commerce, EC '12
Y2 - 4 June 2012 through 8 June 2012
ER -