Submodular Secretary Problem and Extensions

DOI10.1007/978-3-642-15369-3_4zbMath1305.91158OpenAlexW1485683624MaRDI QIDQ3588398

Morteza Zadimoghaddam, MohammadHossein Bateni, Mohammad Taghi Hajiaghayi

Publication date: 10 September 2010

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/51336

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Stopping times; optimal stopping problems; gambling theory (60G40) Auctions, bargaining, bidding and selling, and other market models (91B26) Approximation algorithms (68W25)

Related Items (8)

Shrinking maxima, decreasing costs: new online packing and covering problems ⋮ Lending decisions with limits on capital available: the polygamous marriage problem ⋮ Analysis of the ``hiring above the median selection strategy for the hiring problem ⋮ Analysis of the strategy ``hiring above the \(m\)-th best candidate ⋮ Optimal Online Selection of an Alternating Subsequence: A Central Limit Theorem ⋮ On variants of the matroid secretary problem ⋮ Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract) ⋮ Unnamed Item

This page was built for publication: Submodular Secretary Problem and Extensions