Order-competitive ratio
From MaRDI portal
Cites work
- ``Who is next in line? On the significance of knowing the arrival order in Bayesian online settings
- A sharp lower bound for choosing the maximum of an independent sequence
- Adaptivity gaps for stochastic probing: submodular and XOS functions
- Algorithms and adaptivity gaps for stochastic probing
- Approximating the stochastic Knapsack problem: the benefit of adaptivity
- Beyond matroids: secretary problem and prophet inequality with general constraints
- Combinatorial auctions via posted prices
- Comparison of optimal value and constrained maxima expectations for independent random variables
- Comparison of threshold stop rules and maximum for independent nonnegative random variables
- Competitive Analysis with a Sample and the Secretary Problem
- scientific article; zbMATH DE number 5764797 (Why is no real title available?)
- scientific article; zbMATH DE number 7650393 (Why is no real title available?)
- scientific article; zbMATH DE number 7650408 (Why is no real title available?)
- scientific article; zbMATH DE number 7788459 (Why is no real title available?)
- scientific article; zbMATH DE number 7788460 (Why is no real title available?)
- Improved revenue bounds for posted-price and second-price mechanisms
- Matroid prophet inequalities
- Matroid prophet inequalities and applications to multi-dimensional mechanism design
- On the adaptivity gap of stochastic orienteering
- Online weighted matching with a sample
- Optimal prophet inequality with less than one sample
- Optimal stopping of independent random variables and maximizing prophets
- Order selection prophet inequality: from threshold optimization to arrival time design
- Polymatroid Prophet Inequalities
- Prophet inequalities made easy: stochastic optimization by pricing nonstochastic inputs
- Prophet inequalities vs. approximating optimum online
- Prophet Inequalities with Limited Information
- Prophet Inequality for Bipartite Matching: Merits of Being Simple and Nonadaptive
- Prophet secretary
- Prophet secretary for combinatorial auctions and matroids
- Prophet secretary through blind strategies
- Prophet-type inequalities for multi-choice optimal stopping
- Sample-Driven Optimal Stopping: From the Secretary Problem to the i.i.d. Prophet Inequality
- Semiamarts and finite values
- Single-sample prophet inequalities via greedy-ordered selection
- Stochastic Covering and Adaptivity
- Stochastic submodular cover with limited adaptivity
- Submodular norms with applications to online facility location and stochastic probing
- The importance of knowing the arrival order in combinatorial Bayesian settings
- The Two-Sided Game of Googol and Sample-Based Prophet Inequalities
- When LP is the cure for your matching woes: improved bounds for stochastic matchings
- Who solved the secretary problem
This page was built for publication: Order-competitive ratio
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6834452)
