Stochastic Probing with Increasing Precision
From MaRDI portal
Cites work
- A PTAS for a class of stochastic dynamic programs
- A stochastic probing problem with applications
- Adaptive submodularity: theory and applications in active learning and stochastic optimization
- Adaptivity gaps for stochastic probing: submodular and XOS functions
- Algorithms and adaptivity gaps for stochastic probing
- Approximating Matches Made in Heaven
- Approximating the stochastic Knapsack problem: the benefit of adaptivity
- Bayesian combinatorial auctions: expanding single buyer mechanisms to many buyers
- How to probe for an extreme value
- scientific article; zbMATH DE number 3126031 (Why is no real title available?)
- scientific article; zbMATH DE number 67295 (Why is no real title available?)
- scientific article; zbMATH DE number 3638998 (Why is no real title available?)
- Improved approximation results for stochastic knapsack problems
- Improvements and generalizations of stochastic knapsack and Markovian bandits approximation algorithms
- Multi-parameter mechanism design and sequential posted pricing
- Optimal Search for the Best Alternative
- Semiamarts and finite values
- Submodular stochastic probing on matroids
- The Markovian price of information
- The price of information in combinatorial optimization
- When LP is the cure for your matching woes: improved bounds for stochastic matchings
This page was built for publication: Stochastic Probing with Increasing Precision
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6187078)
