Interviewing secretaries in parallel

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.

[1]  Nicole Immorlica,et al.  Matroids, secretary problems, and online mechanisms , 2007, SODA '07.

[2]  David Lindley,et al.  Dynamic Programming and Decision Theory , 1961 .

[3]  Silvio Lattanzi,et al.  Hiring a secretary from a poset , 2011, EC '11.

[4]  Tim Roughgarden,et al.  Proceedings of the 12th ACM conference on Electronic commerce , 2011, EC 2011.

[5]  Roy Schwartz,et al.  Improved competitive ratios for submodular secretary problems , 2011 .

[6]  Robert D. Kleinberg.  A multiple-choice secretary algorithm with applications to online auctions , 2005, SODA '05.

[7]  Małgorzata Kuchta,et al.  On a universal best choice algorithm for partially ordered sets , 2008 .

[8]  Morteza Zadimoghaddam,et al.  Submodular secretary problem and extensions , 2013, TALG.

[9]  Michael Dinitz,et al.  Secretary problems: weights and discounts , 2009, SODA.

[10]  Mohit Singh,et al.  Secretary Problems via Linear Programming , 2010, IPCO.

[11]  C. Greg Plaxton,et al.  Competitive Weighted Matching in Transversal Matroids , 2008, ICALP.

[12]  Nicole Immorlica,et al.  A Knapsack Secretary Problem with Applications , 2007, APPROX-RANDOM.

[13]  Martin Pál,et al.  Algorithms for Secretary Problems on Graphs and Hypergraphs , 2008, ICALP.

[14]  Thomas S. Ferguson,et al.  Who Solved the Secretary Problem , 1989 .

[15]  Aaron Roth,et al.  Constrained Non-monotone Submodular Maximization: Offline and Secretary Algorithms , 2010, WINE.

[16]  Aravind Srinivasan,et al.  Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds , 1997, SIAM J. Comput..

[17]  Yajun Wang,et al.  Secretary problems: laminar matroid and interval scheduling , 2011, SODA '11.