Mohammadhossein Bateni
Mohammadtaghi Hajiaghayi
Abstract
Online auction is the essence of many modern markets, particularly networked markets, in which information about goods, agents, and outcomes is revealed over a period of time, and the agents must make irrevocable decisions without knowing future information. Optimal stopping theory, especially the classic secretary problem, is a powerful tool for analyzing such online scenarios which generally require optimizing an objective function over the input. The secretary problem and its generalization the multiple-choice secretary problem were under a thorough study in the literature. In this article, we consider a very general setting of the latter problem called the submodular secretary problem, in which the goal is to select k secretaries so as to maximize the expectation of a (not necessarily monotone) submodular function which defines efficiency of the selected secretarial group based on their overlapping skills. We present the first constant-competitive algorithm for this case. In a more general setting in which selected secretaries should form an independent (feasible) set in each of l given matroids as well, we obtain an O(l log2 r)-competitive algorithm generalizing several previous results, where r is the maximum rank of the matroids. Another generalization is to consider l knapsack constraints (i.e., a knapsack constraint assigns a nonnegative cost to each secretary, and requires that the total cost of all the secretaries employed be no more than a budget value) instead of the matroid constraints, for which we present an O(l)-competitive algorithm. In a sharp contrast, we show for a more general setting of subadditive secretary problem, there is no õ(√n)-competitive algorithm and thus submodular functions are the most general functions to consider for constant-competitiveness in our setting. We complement this result by giving a matching O(√n)-competitive algorithm for the subadditive case. At the end, we consider some special cases of our general setting as well.
- Ageev, A. A. and Sviridenko, M. I. 1999. An 0.828-approximation algorithm for the uncapacitated facility location problem. Discr. Appl. Math. 93, 2--3, 149--156. Google Scholar
Digital Library
- Ajtai, M., Megiddo, N., and Waarts, O. 2001. Improved algorithms and analysis for secretary problems and generalizations. SIAM J. Discrete Math. 14, 1, 1--27. Google ScholarDigital Library
- Asadpour, A., Nazerzadeh, H., and Saberi, A. 2008. Stochastic submodular maximization. In Proceedings of the WINE. 477--489. Google ScholarDigital Library
- Babaioff, M., Immorlica, N., Kempe, D., and Kleinberg, R. 2007a. A knapsack secretary problem with applications. In Proceedings of the APPROX. 16--28. Google ScholarDigital Library
- Babaioff, M., Immorlica, N., Kempe, D., and Kleinberg, R. 2008. Online auctions and generalized secretary problems. SIGecom Exch. 7, 2, 1--11. DOI: http://dx.doi.org/10.1145/1399589.1399596. Google ScholarDigital Library
- Babaioff, M., Immorlica, N., and Kleinberg, R. 2007b. Matroids, secretary problems, and online mechanisms. In Proceedings of the SODA. 434--443. Google ScholarDigital Library
- Bateni, M., Hajiaghayi, M., and Zadimoghaddam, M. 2009. The Submodular Secretary Problem. Technical Report TD-7UEP26. AT&T Labs--Research.Google Scholar
- Calinescu, G., Chekuri, C., Pál, M., and Vondrák, J. 2007. Maximizing a submodular set function subject to a matroid constraint (extended abstract). In Proceedings of the IPCO. 182--196. Google ScholarDigital Library
- Cornuejols, G., Fisher, M., and Nemhauser, G. L. 1977. On the uncapacitated location problem. In Studies in Integer Programming (Proc. Workshop, Bonn. 1975), North-Holland, Amsterdam, 163--177. Ann. Discrete Math., Vol. 1.Google Scholar
- Cornuejols, G., Fisher, M. L., and Nemhauser, G. L. 1976/77. Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms. Manage. Sci. 23, 8, 789--810.Google Scholar
- Dynkin, E. B. 1963. The optimum choice of the instant for stopping a markov process. Sov. Math. Dokl. 4, 627--629.Google Scholar
- Edmonds, J. 1970. Submodular functions, matroids, and certain polyhedra. In Proceedings of the Calgory International Conference 1969: Combinatorial Structures and their Applications. Gordon and Breach, New York, 69--87.Google Scholar
- Feige, U. 1998. A threshold of ln n for approximating set cover. J. ACM 45, 4, 634--652. DOI: http://dx.doi.org/10.1145/285055.285059. Google ScholarDigital Library
- Feige, U. 2006. On maximizing welfare when utility functions are subadditive. In Proceedings of the STOC. 41--50. Google ScholarDigital Library
- Feige, U. and Goemans, M. X. 1995. Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT. In Proceedings of the ISTCS. 182. Google ScholarDigital Library
- Feige, U., Mirrokni, V. S., and Vondrák, J. 2007. Maximizing non-monotone submodular functions. In Proceedings of the FOCS. 461--471. Google ScholarDigital Library
- Fisher, M. L., Nemhauser, G. L., and Wolsey, L. A. 1978. An analysis of approximations for maximizing submodular set functions. II. Math. Prog. Stud. 8, 73--87. Polyhedral combinatorics.Google ScholarCross Ref
- Freeman, P. R. 1983. The secretary problem and its extensions: a review. Internat. Statist. Rev. 51, 2, 189--206.Google ScholarCross Ref
- Gilbert, J. P. and Mosteller, F. 1966. Recognizing the maximum of a sequence. J. Amer. Statist. Assoc. 61, 35--73.Google ScholarCross Ref
- Glasser, K. S., Holzsager, R., and Barron, A. 1983. The d choice secretary problem. Comm. Statist. C—Sequential Anal. 2, 3, 177--199.Google Scholar
- Goemans, M. X. and Williamson, D. P. 1995. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42, 6, 1115--1145. Google ScholarDigital Library
- Gupta, A., Roth, A., Schoenebeck, G., and Talwar, K. 2010. Constrained non-monotone submodular maximization: offline and secretary algorithms. In Proceedings of the WINE. 246--257. Google ScholarDigital Library
- Hajiaghayi, M. T., Kleinberg, R., and Parkes, D. C. 2004. Adaptive limited-supply online auctions. In Proceedings of the EC. 71--80. Google ScholarDigital Library
- Hajiaghayi, M. T., Kleinberg, R., and Sandholm, T. 2007. Automated online mechanism design and prophet inequalities. In Proceedings of the AAAI. 58--65. Google ScholarDigital Library
- Halperin, E. and Zwick, U. 2001. Combinatorial approximation algorithms for the maximum directed cut problem. In Proceedings of the SODA. 1--7. Google ScholarDigital Library
- Håstad, J. 2001. Some optimal inapproximability results. J. ACM 48, 4, 798--859. Google ScholarDigital Library
- Hazan, E., Safra, S., and Schwartz, O. 2006. On the complexity of approximating k-set packing. Computat. Complex. 15, 1, 20--39. Google ScholarDigital Library
- Immorlica, N., Kleinberg, R. D., and Mahdian, M. 2006. Secretary problems with competing employers. In Proceedings of the WINE. 389--400. Google ScholarDigital Library
- Iwata, S., Fleischer, L., and Fujishige, S. 2001. A combinatorial strongly polynomial algorithm for minimizing submodular functions. J. ACM 48, 4, 761--777. Google ScholarDigital Library
- Khot, S., Kindler, G., Mossel, E., and O'Donnell, R. 2004. Optimal inapproximability results for max-cut and other 2-variable CSPs? In Proceedings of the FOCS. 146--154. Google ScholarDigital Library
- Khuller, S., Moss, A., and Naor, J. 1999. The budgeted maximum coverage problem. Inf. Proc. Lett. 70, 1, 39--45. Google ScholarDigital Library
- Kleinberg, R. 2005. A multiple-choice secretary algorithm with applications to online auctions. In Proceedings of the SODA. 630--631. Google ScholarDigital Library
- Lee, J., Mirrokni, V., Nagarajan, V., and Sviridenko, M. 2009. Maximizing Non-monotone Submodular Functions under Matroid and Knapsack Constraints. In Proceedings of the STOC. 323--332. Google ScholarDigital Library
- Lovász, L. 1983. Submodular functions and convexity. In Mathematical Programming: The State of the Art (Bonn, 1982). Springer, Berlin, 235--257.Google Scholar
- Nemhauser, G. L., Wolsey, A. L., and Fisher, M. L. 1978. An analysis of approximations for maximizing submodular set functions. I. Math. Program. 14, 3, 265--294.Google ScholarDigital Library
- Queyranne, M. 1995. A combinatorial algorithm for minimizing symmetric submodular functions. In Proceedings of the SODA. 98--101. Google ScholarDigital Library
- Schrijver, A. 2000. A combinatorial algorithm minimizing submodular functions in strongly polynomial time. J. Combin. Theory Ser. B 80, 2, 346--355. Google ScholarDigital Library
- Sviridenko, M. 2004. A note on maximizing a submodular set function subject to a knapsack constraint. Oper. Res. Lett. 32, 1, 41--43. Google ScholarDigital Library
- Vanderbei, R. J. 1980. The optimal choice of a subset of a population. Math. Oper. Res. 5, 4, 481--486.Google ScholarCross Ref
- Vondrák, J. 2009. Symmetry and approximability of submodular maximization problems. In Proceedings of the FOCS. 651--670. Google ScholarDigital Library
- Wilson, J. G. 1991. Optimal choice and assignment of the best m of n randomly arriving items. Stochastic Process. Appl. 39, 2, 325--343.Google ScholarCross Ref
Index Terms
- Submodular secretary problem and extensions
Recommendations
Prophet Secretary
Optimal stopping theory is a powerful tool for analyzing scenarios such as online auctions in which we generally require optimizing an objective function over the space of stopping rules for an allocation process under uncertainty. Perhaps the most classic ...
A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem
Only recently, progress has been made in obtaining o(log(rank))-competitive algorithms for the matroid secretary problem. More precisely, Chakraborty and Lachish (2012) presented a O((log(rank))1/2)-competitive procedure, and Lachish (2014) later ...
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 techniquesOnline auction is the essence of many modern markets, particularly networked markets, in which information about goods, agents, and outcomes is revealed over a period of time, and the agents must make irrevocable decisions without knowing future ...
Comments