Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
SIAM Journal on Computing
A multiple-choice secretary algorithm with applications to online auctions
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Matroids, secretary problems, and online mechanisms
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On a universal best choice algorithm for partially ordered sets
Random Structures & Algorithms
Competitive Weighted Matching in Transversal Matroids
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
A Knapsack Secretary Problem with Applications
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Secretary problems: weights and discounts
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Algorithms for Secretary Problems on Graphs and Hypergraphs
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Submodular secretary problem and extensions
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Constrained non-monotone submodular maximization: offline and secretary algorithms
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Hiring a secretary from a poset
Proceedings of the 12th ACM conference on Electronic commerce
Improved competitive ratios for submodular secretary problems
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Secretary problems: laminar matroid and interval scheduling
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Secretary problems via linear programming
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
| Hi-index | 0.00 |
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.