Submodular secretary problem and extensions
From MaRDI portal
Publication:2933663
DOI10.1145/2500121zbMath1301.91016OpenAlexW2036190740MaRDI QIDQ2933663
MohammadHossein Bateni, Morteza Zadimoghaddam, Mohammad Taghi Hajiaghayi
Publication date: 5 December 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/51336
online algorithmssubmodularmatroid constraintsecretary problemknapsack constraintcompetitive algorithmsstopping theory
Combinatorial optimization (90C27) Auctions, bargaining, bidding and selling, and other market models (91B26) Online algorithms; streaming algorithms (68W27)
Related Items (18)
Prophet Secretary ⋮ The simulated greedy algorithm for several submodular matroid secretary problems ⋮ Streaming Algorithms for Submodular Function Maximization ⋮ Monotone \(k\)-submodular secretary problems: cardinality and knapsack constraints ⋮ A Framework for the Secretary Problem on the Intersection of Matroids ⋮ Fair allocation of indivisible goods: beyond additive valuations ⋮ Algorithms for maximizing monotone submodular function minus modular function under noise ⋮ Know when to persist: deriving value from a stream buffer ⋮ The Submodular Secretary Problem Goes Linear ⋮ Secretary markets with local information ⋮ Unnamed Item ⋮ A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem ⋮ Online Submodular Maximization with Preemption ⋮ Know When to Persist: Deriving Value from a Stream Buffer ⋮ Strong Algorithms for the Ordinal Matroid Secretary Problem ⋮ Online algorithms for the maximum \(k\)-interval coverage problem ⋮ Online Contention Resolution Schemes with Applications to Bayesian Selection Problems ⋮ Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online
This page was built for publication: Submodular secretary problem and extensions
