The following pages link to (Q3579420):
Displaying 50 items.
- Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
- A stochastic algorithm for online bipartite resource allocation problems (Q342502) (← links)
- Serve or skip: the power of rejection in online bottleneck matching (Q346521) (← links)
- On the advice complexity of online bipartite matching and online stable marriage (Q402379) (← links)
- Advertisement allocation for generalized second-pricing schemes (Q614045) (← links)
- When LP is the cure for your matching woes: improved bounds for stochastic matchings (Q692633) (← links)
- On-line maximum matching in complete multi-partite graphs with an application to optical networks (Q896661) (← links)
- Near optimal algorithms for online maximum edge-weighted \(b\)-matching and two-sided vertex-weighted \(b\)-matching (Q897954) (← links)
- Minimum cost perfect matching with delays for two sources (Q1628601) (← 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)
- Scheduling In the random-order model (Q1979454) (← links)
- Stable secretaries (Q1999964) (← links)
- Learn from history for online bipartite matching (Q2091114) (← links)
- Improved analysis of RANKING for online vertex-weighted bipartite matching in the random order model (Q2152115) (← links)
- Social welfare and profit maximization from revealed preferences (Q2190403) (← links)
- Greedy metric minimum online matchings with random arrivals (Q2294274) (← links)
- Markovian online matching algorithms on large bipartite random graphs (Q2684964) (← links)
- Optimal dynamic multi-keyword bidding policy of an advertiser in search-based advertising (Q2699027) (← links)
- How the Experts Algorithm Can Help Solve LPs Online (Q2833109) (← links)
- Online Stochastic Matching: Online Actions Based on Offline Statistics (Q2925346) (← links)
- A Dynamic Near-Optimal Algorithm for Online Linear Programming (Q2931707) (← links)
- Social Welfare in One-Sided Matching Markets without Money (Q3088085) (← links)
- Tighter Bounds for Online Bipartite Matching (Q3295268) (← links)
- On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology (Q3408178) (← links)
- Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm (Q3448861) (← links)
- Online Allocation and Pricing with Economies of Scale (Q3460785) (← links)
- Primal Beats Dual on Online Packing LPs in the Random-Order Model (Q4554073) (← links)
- Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order (Q4571927) (← links)
- Ranking on Arbitrary Graphs: Rematch via Continuous Linear Programming (Q4581907) (← links)
- Online Vertex-Weighted Bipartite Matching (Q4972684) (← links)
- (Q5002758) (← links)
- Online Maximum Matching with Recourse (Q5005104) (← links)
- Greedy Bipartite Matching in Random Type Poisson Arrival Model (Q5009497) (← links)
- Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds (Q5058054) (← links)
- Multiplicative Pacing Equilibria in Auction Markets (Q5080654) (← links)
- Greedy Matching in Bipartite Random Graphs (Q5084502) (← links)
- Impatient Online Matching (Q5091056) (← links)
- Stochastic Online Metric Matching (Q5091225) (← 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)
- On Matching and Thickness in Heterogeneous Dynamic Markets (Q5129171) (← links)
- Online Stochastic Matching: New Algorithms with Better Bounds (Q5244859) (← links)
- Minimum Cost Perfect Matching with Delays for Two Sources (Q5283368) (← links)
- (Q5875458) (← links)
- On conceptually simple algorithms for variants of online bipartite matching (Q5915658) (← links)
- Online submodular maximization: beating 1/2 made simple (Q5918911) (← links)
