The submodular secretary problem goes linear

Moran Feldman, Rico Zenklusen

פרסום מחקרי: פרסום בכתב עתמאמרביקורת עמיתים


During the last decade, the matroid secretary problem (MSP) became one of the most prominent classes of online selection problems. The interest in MSP is twofold: on the one hand, there are many interesting applications of MSP, and on the other hand, there is strong hope that MSP admits O(1)-competitive algorithms, which is the claim of the well-known matroid secretary conjecture. Partially linked to its numerous applications in online auctions, substantial interest arose also in the study of nonlinear versions of MSP, with a focus on the submodular MSP (SMSP). The fact that submodularity captures the property of diminishing returns, a very natural property for valuation functions, is a key reason for the interest in SMSP. So far, O(1)-competitive algorithms have been obtained for SMSP over some basic matroid classes. This created some hope that, analogously to the matroid secretary conjecture, one may even obtain O(1)-competitive algorithms for SMSP over any matroid. However, up to now, most questions related to SMSP remained open, including whether SMSP may be substantially more difficult than MSP and, more generally, to what extent MSP and, SMSP are related. Our goal is to address these points by presenting general black-box reductions from SMSP to MSP. In particular, we show that any O(1)-competitive algorithm for MSP, even restricted to a particular matroid class, can be transformed in a black-box way to an O(1)-competitive algorithm for SMSP over the same matroid class. This implies that the matroid secretary conjecture is equivalent to the same conjecture for SMSP. Hence, in this sense SMSP is not harder than MSP. Also, to find O(1)-competitive algorithms for SMSP over a particular matroid class, it suffices to consider MSP over the same matroid class. Using our reductions we obtain many first and improved O(1)-competitive algorithms for SMSP over various matroid classes by leveraging known algorithms for MSP. Moreover, our reductions imply an O(log log(rank))-competitive algorithm for SMSP, thus, matching the currently best asymptotic algorithm for MSP, and substantially improving on the previously best O(log(rank))-competitive algorithm for SMSP.

שפה מקוריתאנגלית
עמודים (מ-עד)330-366
מספר עמודים37
כתב עתSIAM Journal on Computing
מספר גיליון2
מזהי עצם דיגיטלי (DOIs)
סטטוס פרסוםפורסם - 2018

הערה ביבליוגרפית

Funding Information:
∗Received by the editors November 28, 2016; accepted for publication (in revised form) January 2, 2018; published electronically April 3, 2018. A preliminary version of this work appeared in the Proceedings of the 56th Annual Symposium on Foundations of Computer Science (FOCS 2015), IEEE, Piscataway, NJ, 2015, pp. 486–505. Funding: The first author is supported by ISF grant 1357/16, and was supported by ERC Starting Grant 335288-OptApprox. The second author is supported by Swiss National Science Foundation grant 200021 165866, “New Approaches to Constrained Submodular Maximization.” †Department of Mathematics and Computer Science, Open University of Israel moranfe@openu. ‡Department of Mathematics, ETH Zurich (

טביעת אצבע

להלן מוצגים תחומי המחקר של הפרסום 'The submodular secretary problem goes linear'. יחד הם יוצרים טביעת אצבע ייחודית.

פורמט ציטוט ביבליוגרפי