Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract)

The Classical Secretary Problem was introduced during the 60’s of the 20 th century, nobody is sure exactly when. Since its introduction, many variants of the problem have been proposed and researched. In the classical secretary problem, and many of its variant, the input (which is a set of secretaries, or elements) arrives in a random order. In this paper we apply to the secretary problem a simple observation which states that the random order of the input can be generated by independently choosing a random continuous arrival time for each secretary. Surprisingly, this simple observation enables us to improve the competitive ratio of several known and studied variants of the secretary problem. In addition, in some cases the proofs we provide assuming random arrival times are shorter and simpler in comparison to existing proofs. In this work we consider three variants of the secretary problem, all of which have the same objective of maximizing the value of the chosen set of secretaries given a monotone submodular function f. In the first variant we are allowed to hire a set of secretaries only if it is an independent set of a given partition matroid. The second variant allows us to choose any set of up to k secretaries. In the last and third variant, we can hire any set of secretaries satisfying a given knapsack constraint.

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

[2]  F. Mosteller,et al.  Recognizing the Maximum of a Sequence , 1966 .

[3]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[4]  P. Freeman.  The Secretary Problem and its Extensions: A Review , 1983 .

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

[6]  Nimrod Megiddo,et al.  Improved Algorithms and Analysis for Secretary Problems and Generalizations , 2001, SIAM J. Discret. Math..

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

[8]  S. Fienberg,et al.  Selected Papers of Frederick Mosteller , 2007 .

[9]  Vahab Mirrokni,et al.  Maximizing Non-Monotone Submodular Functions , 2007, FOCS 2007.

[10]  Fan Chung Graham,et al.  Internet and Network Economics, Third International Workshop, WINE 2007, San Diego, CA, USA, December 12-14, 2007, Proceedings , 2007, WINE.

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

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

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

[14]  Jan Vondrák,et al.  Symmetry and Approximability of Submodular Maximization Problems , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

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

[16]  Uriel Feige.  On Maximizing Welfare When Utility Functions Are Subadditive , 2009, SIAM J. Comput..

[17]  Hadas Shachnai,et al.  Maximizing submodular set functions subject to multiple linear constraints , 2009, SODA.

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

[19]  Jan Vondrák,et al.  Submodular Maximization over Multiple Matroids via Generalized Exchange Properties , 2009, Math. Oper. Res..

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

[21]  Vahab S. Mirrokni,et al.  Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints , 2009, SIAM J. Discret. Math..

[22]  Jan Vondrák,et al.  Submodular maximization by simulated annealing , 2010, SODA '11.

[23]  Chandra Chekuri,et al.  Submodular function maximization via the multilinear relaxation and contention resolution schemes , 2011, STOC '11.

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

[25]  Yanchun Zhang,et al.  Algorithms and Techniques , 2011 .

[26]  Jan Vondrák,et al.  Maximizing a Monotone Submodular Function Subject to a Matroid Constraint , 2011, SIAM J. Comput..

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