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

DOI10.1007/978-3-030-79987-8_30OpenAlexW3174508056MaRDI QIDQ2115881FDOQ2115881

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

• Title not available (Why is that?)
• A Knapsack Secretary Problem with Applications
• Matroids, secretary problems, and online mechanisms
• Online contention resolution schemes
• 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
• Semiamarts and finite values
• Prophet inequalities made easy: stochastic optimization by pricing nonstochastic inputs
• Improved online algorithms for knapsack and GAP in the random order model
• Prophet secretary for combinatorial auctions and matroids
• Prophet secretary through blind strategies
• Prophet secretary

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)