The following pages link to (Q5365114):
Displaying 48 items.
- 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)
- 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)
- 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)
- Stable secretaries (Q1999964) (← links)
- Online stochastic matching: new algorithms and bounds (Q2006938) (← links)
- A \(2/3\)-approximation algorithm for vertex-weighted matching (Q2064284) (← 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)
- Clinching auctions with online supply (Q2206820) (← links)
- Size versus truthfulness in the house allocation problem (Q2319628) (← links)
- Prompt mechanism for online auctions with multi-unit demands (Q2355988) (← links)
- Prompt Mechanism for Online Auctions with Multi-unit Demands (Q2867113) (← links)
- Social Welfare in One-Sided Matching Markets without Money (Q3088085) (← 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)
- Ranking on Arbitrary Graphs: Rematch via Continuous Linear Programming (Q4581907) (← links)
- Online Vertex-Weighted Bipartite Matching (Q4972684) (← links)
- Min-Cost Bipartite Perfect Matching with Delays (Q5002601) (← links)
- (Q5002758) (← links)
- A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines (Q5048294) (← links)
- Greedy Matching in Bipartite Random Graphs (Q5084502) (← links)
- Impatient Online Matching (Q5091056) (← links)
- Stochastic Online Metric Matching (Q5091225) (← links)
- Online Algorithms for Maximum Cardinality Matching with Edge Arrivals (Q5111708) (← links)
- Online Submodular Maximization Problem with Vector Packing Constraint. (Q5111710) (← 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)
- Minimum Cost Perfect Matching with Delays for Two Sources (Q5283368) (← links)
- On conceptually simple algorithms for variants of online bipartite matching (Q5915658) (← links)
- Online submodular maximization: beating 1/2 made simple (Q5918911) (← links)
- Secretary and online matching problems with machine learned advice (Q6108930) (← links)
- Truthful Matching with Online Items and Offline Agents (Q6492090) (← links)
- Edge-weighted online bipartite matching (Q6551261) (← links)
- Quick or cheap? Breaking points in dynamic markets (Q6559466) (← links)
- Adwords in a panorama (Q6562830) (← links)
- Deterministic primal-dual algorithms for online \(k\)-way matching with delays (Q6591637) (← links)
- Online primal dual meets online matching with stochastic rewards: configuration LP to the rescue (Q6602240) (← links)
- Randomized algorithm for MPMD on two sources (Q6609154) (← links)
- Online matching with stochastic rewards: advanced analyses using configuration linear programs (Q6609158) (← links)
- Improved competitive ratio for edge-weighted online stochastic matching (Q6609171) (← links)
- Improved truthful rank approximation for rank-maximal matchings (Q6609179) (← links)
- Deterministic primal-dual algorithms for online \(k\)-way matching with delays (Q6658298) (← links)
