Online bipartite matching in the probe-commit model
From MaRDI portal
Cites work
- A stochastic probing problem with applications
- Algorithms and adaptivity gaps for stochastic probing
- An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions
- Approximating Matches Made in Heaven
- Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts
- Beating \((1 - 1/e)\)-approximation for weighted stochastic matching
- Beating greedy for stochastic bipartite matching
- Dependent rounding and its applications to approximation algorithms
- Dynamic Programming and Decision Theory
- Edge-weighted online stochastic matching: beating \(1- \frac{1}{e}\)
- Geometric algorithms and combinatorial optimization
- Improved analysis of the greedy algorithm for stochastic matching
- Improved approximation algorithms for stochastic matching
- Improved bounds in stochastic matching and optimization
- New algorithms, better bounds, and a novel model for online stochastic matching
- On (random-order) online contention resolution schemes for the matching polytope of (bipartite) graphs
- Online matching frameworks under stochastic rewards, product ranking, and unknown patience
- Online matching with stochastic rewards
- Online primal dual meets online matching with stochastic rewards: configuration LP to the rescue
- Online stochastic matching with unequal probabilities
- Online stochastic matching: online actions based on offline statistics
- Optimal online contention resolution schemes via ex-ante prophet inequalities
- Prophet secretary for combinatorial auctions and matroids
- Prophet secretary through blind strategies
- Randomized primal-dual analysis of RANKING for online bipartite matching
- Secretary Matching Meets Probing with Commitment.
- Semiamarts and finite values
- Stochastic matching with commitment
- Submodular function maximization via the multilinear relaxation and contention resolution schemes
- Submodular stochastic probing on matroids
- The design of approximation algorithms
- The power of multiple choices in online stochastic matching
- Understanding and using linear programming
- When LP is the cure for your matching woes: improved bounds for stochastic matchings
- When the optimum is also blind: a new perspective on universal optimization
This page was built for publication: Online bipartite matching in the probe-commit model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6885419)
