Interviewing secretaries in parallel

Moran Feldman, Moshe Tennenholtz

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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.

Original languageEnglish
Title of host publicationEC '12 - Proceedings of the 13th ACM Conference on Electronic Commerce
Number of pages18
StatePublished - 2012
Externally publishedYes
Event13th ACM Conference on Electronic Commerce, EC '12 - Valencia, Spain
Duration: 4 Jun 20128 Jun 2012

Publication series

NameProceedings of the ACM Conference on Electronic Commerce


Conference13th ACM Conference on Electronic Commerce, EC '12


  • competitive analysis
  • parallelization
  • secretary problems
  • time constraints

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Computer Networks and Communications


Dive into the research topics of 'Interviewing secretaries in parallel'. Together they form a unique fingerprint.

Cite this