Prophet secretary for k-knapsack and l-matroid intersection via continuous exchange property

DOI10.1007/978-3-030-79987-8_30MaRDI QIDQ2115881zbMATH OpenOpenAlexFDO

Authors Soh Kumabe, Takanori Maehara

Publication date 22 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-79987-8_30

zbMATH Keywords

online algorithmknapsackprophet secretary problem

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites work

• scientific article; zbMATH DE number 3383344 (Why is no real title available?)
• A Knapsack Secretary Problem with Applications
• A simple \(O(\log\log(\mathrm{rank}))\)-competitive algorithm for the matroid secretary problem
• Comments on bases in dependence structures
• Comparison of threshold stop rules and maximum for independent nonnegative random variables
• Improved online algorithms for knapsack and GAP in the random order model
• Matroids, secretary problems, and online mechanisms
• Online contention resolution schemes
• Prophet inequalities made easy: stochastic optimization by pricing nonstochastic inputs
• Prophet secretary
• Prophet secretary for combinatorial auctions and matroids
• Prophet secretary through blind strategies
• Semiamarts and finite values

This page was built for publication: Prophet secretary for \(k\)-knapsack and \(l\)-matroid intersection via continuous exchange property

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115881)