Pages that link to "Item:Q2925346"
From MaRDI portal
The following pages link to Online Stochastic Matching: Online Actions Based on Offline Statistics (Q2925346):
Displayed 41 items.
- Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
- A stochastic algorithm for online bipartite resource allocation problems (Q342502) (← links)
- On the advice complexity of online bipartite matching and online stable marriage (Q402379) (← links)
- When LP is the cure for your matching woes: improved bounds for stochastic matchings (Q692633) (← links)
- Near optimal algorithms for online maximum edge-weighted \(b\)-matching and two-sided vertex-weighted \(b\)-matching (Q897954) (← links)
- Online spatio-temporal matching in stochastic and dynamic domains (Q1648078) (← links)
- Near optimal algorithms for online weighted bipartite matching in adversary model (Q1680479) (← links)
- On extensions of the deterministic online model for bipartite matching and max-sat (Q1740687) (← links)
- Online algorithms for maximum cardinality matching with edge arrivals (Q1741843) (← links)
- A polyhedral approach to online bipartite matching (Q1801015) (← links)
- Online stochastic matching: new algorithms and bounds (Q2006938) (← links)
- Learn from history for online bipartite matching (Q2091114) (← links)
- Online total bipartite matching problem (Q2136880) (← links)
- Improved analysis of RANKING for online vertex-weighted bipartite matching in the random order model (Q2152115) (← links)
- Primal-dual analysis for online interval scheduling problems (Q2182859) (← links)
- An optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals (Q2187342) (← links)
- Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts (Q2285050) (← links)
- Advice complexity of online non-crossing matching (Q2678256) (← links)
- A Polyhedral Approach to Online Bipartite Matching (Q3186510) (← links)
- Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm (Q3448861) (← links)
- Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order (Q4571927) (← links)
- Online Vertex-Weighted Bipartite Matching (Q4972684) (← links)
- (Q5002758) (← links)
- Greedy Bipartite Matching in Random Type Poisson Arrival Model (Q5009497) (← links)
- Technical Note—Assortment Planning for Two-Sided Sequential Matching Markets (Q5058044) (← links)
- (Q5077148) (← links)
- Dynamic Stochastic Matching Under Limited Time (Q5106373) (← links)
- Dynamic Relaxations for Online Bipartite Matching (Q5106387) (← links)
- Online Algorithms for Maximum Cardinality Matching with Edge Arrivals (Q5111708) (← links)
- Approximations to Stochastic Dynamic Programs via Information Relaxation Duality (Q5126622) (← links)
- On Matching and Thickness in Heterogeneous Dynamic Markets (Q5129171) (← links)
- Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios (Q5144796) (← links)
- Online Stochastic Matching: New Algorithms with Better Bounds (Q5244859) (← links)
- (Q5365117) (redirect page) (← links)
- (Q5743510) (← links)
- On conceptually simple algorithms for variants of online bipartite matching (Q5915658) (← links)
- Online submodular maximization: beating 1/2 made simple (Q5918911) (← links)
- An Experimental Study of Algorithms for Online Bipartite Matching (Q6039931) (← links)
- Approximation algorithms for stochastic online matching with reusable resources (Q6046972) (← links)
- Online stochastic weighted matching algorithm for real‐time shared parking (Q6080597) (← links)
- Max-min greedy matching problem: hardness for the adversary and fractional variant (Q6138832) (← links)