Online contention resolution schemes with applications to Bayesian selection problems
From MaRDI portal
Recommendations
- Online contention resolution schemes
- Submodular function maximization via the multilinear relaxation and contention resolution schemes
- Submodular function maximization via the multilinear relaxation and contention resolution schemes
- A stochastic probing problem with applications
- Submodular secretary problem and extensions
Cites work
- A framework for the secretary problem on the intersection of matroids
- A simple \(O(\log\log(\mathrm{rank}))\)-competitive algorithm for the matroid secretary problem
- A stochastic probing problem with applications
- A Unified Continuous Greedy Algorithm for Submodular Maximization
- An Optimal Algorithm for Monte Carlo Estimation
- Bayesian combinatorial auctions: expanding single buyer mechanisms to many buyers
- Combinatorial auctions with decreasing marginal utilities
- Constrained submodular maximization via a nonsymmetric technique
- scientific article; zbMATH DE number 3612176 (Why is no real title available?)
- scientific article; zbMATH DE number 6783427 (Why is no real title available?)
- Matroid prophet inequalities
- Matroid secretary problem in the random-assignment model
- Matroids, secretary problems, and online mechanisms
- Maximizing a monotone submodular function subject to a matroid constraint
- Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
- Maximizing Non-monotone Submodular Functions
- Multi-parameter mechanism design and sequential posted pricing
- Optimal Auction Design
- Optimal online contention resolution schemes via ex-ante prophet inequalities
- Prophet inequalities made easy: stochastic optimization by pricing nonstochastic inputs
- Submodular function maximization via the multilinear relaxation and contention resolution schemes
- Submodular maximization with cardinality constraints
- Submodular secretary problem and extensions
- Submodular stochastic probing on matroids
- The submodular secretary problem goes linear
- When LP is the cure for your matching woes: improved bounds for stochastic matchings
Cited in
(11)- An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint
- Online contention resolution schemes
- Optimal online contention resolution schemes via ex-ante prophet inequalities
- A Framework for the Secretary Problem on the Intersection of Matroids
- Prophet inequalities via the expected competitive ratio
- On submodular prophet inequalities and correlation gap
- Non-adaptive prophet inequalities for minor-closed classes of matroids
- Extending Wormald's differential equation method to one-sided bounds
- Online contention resolution schemes for size-stochastic knapsacks
- Online combinatorial assignment in independence systems
- Online combinatorial assignment in independence systems
This page was built for publication: Online contention resolution schemes with applications to Bayesian selection problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5856151)
