The following pages link to Bayesian Mechanism Design (Q2872499):
Displaying 50 items.
- A dynamic learning algorithm for online matching problems with concave returns (Q319996) (← links)
- Autobidding with constraints (Q776226) (← links)
- Mix and match: Markov chains and mixing times for matching in rideshare (Q776248) (← links)
- Online maximum matching with recourse (Q830934) (← links)
- Minimum cost perfect matching with delays for two sources (Q1628601) (← links)
- Online spatio-temporal matching in stochastic and dynamic domains (Q1648078) (← links)
- Online algorithms for maximum cardinality matching with edge arrivals (Q1741843) (← links)
- New online algorithms for story scheduling in web advertising (Q1755774) (← links)
- A polyhedral approach to online bipartite matching (Q1801015) (← links)
- Best fit bin packing with random order revisited (Q1979457) (← links)
- Online stochastic matching: new algorithms and bounds (Q2006938) (← links)
- A stronger impossibility for fully online matching (Q2060387) (← links)
- A \(2/3\)-approximation algorithm for vertex-weighted matching (Q2064284) (← links)
- Learn from history for online bipartite matching (Q2091114) (← links)
- On the quadratic random matching problem in two-dimensional domains (Q2136099) (← 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)
- 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)
- Reward maximization in general dynamic matching systems (Q2326234) (← links)
- Advice complexity of online non-crossing matching (Q2678256) (← links)
- Tighter Bounds for Online Bipartite Matching (Q3295268) (← links)
- Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm (Q3448861) (← links)
- Tractable Equilibria in Sponsored Search with Endogenous Budgets (Q4994152) (← links)
- Matching While Learning (Q4994180) (← links)
- Online Maximum Matching with Recourse (Q5005104) (← links)
- Greedy Bipartite Matching in Random Type Poisson Arrival Model (Q5009497) (← links)
- Competitive analysis for two variants of online metric matching problem (Q5025166) (← links)
- On the Optimal Design of a Bipartite Matching Queueing System (Q5031017) (← links)
- (Q5053286) (← links)
- Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds (Q5058054) (← links)
- (Q5077148) (← links)
- Greedy Matching in Bipartite Random Graphs (Q5084502) (← links)
- Prophet Matching with General Arrivals (Q5085120) (← links)
- Best Fit Bin Packing with Random Order Revisited (Q5089165) (← links)
- (Q5090428) (← 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)
- Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios (Q5144796) (← links)
- Approximation algorithms in combinatorial scientific computing (Q5230524) (← links)
- Minimum Cost Perfect Matching with Delays for Two Sources (Q5283368) (← links)
- (Q5381135) (← links)
- On conceptually simple algorithms for variants of online bipartite matching (Q5915658) (← links)
- Online submodular maximization: beating 1/2 made simple (Q5918911) (← links)
- Accounting for capacity: A real‐time optimization approach to managing observation unit utilization (Q6052603) (← links)
- (Q6062163) (← links)
- Max-min greedy matching problem: hardness for the adversary and fractional variant (Q6138832) (← links)
