Pages that link to "Item:Q3546342"
From MaRDI portal
The following pages link to AdWords and generalized online matching (Q3546342):
Displaying 36 items.
- Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order (Q4571927) (← links)
- (Q4969174) (← links)
- Budget Feasible Procurement Auctions (Q4971366) (← links)
- Online Vertex-Weighted Bipartite Matching (Q4972684) (← links)
- On Policies for Single-Leg Revenue Management with Limited Demand Information (Q4994151) (← links)
- Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem (Q4995102) (← links)
- (Q5002758) (← links)
- Budget-Management Strategies in Repeated Auctions (Q5003721) (← links)
- Online Resource Allocation Under Partially Predictable Demand (Q5003724) (← links)
- Fair Resource Allocation in a Volatile Marketplace (Q5031013) (← links)
- Tight Revenue Gaps among Multiunit Mechanisms (Q5048292) (← links)
- Multiplicative Pacing Equilibria in Auction Markets (Q5080654) (← links)
- Greedy Matching in Bipartite Random Graphs (Q5084502) (← links)
- Prophet Matching with General Arrivals (Q5085120) (← links)
- Asymptotic analysis for multi-objective sequential stochastic assignment problems (Q5086480) (← links)
- Online Matching in Regular Bipartite Graphs (Q5087843) (← links)
- Impatient Online Matching (Q5091056) (← links)
- Stochastic Online Metric Matching (Q5091225) (← links)
- Online Resource Allocation with Personalized Learning (Q5106359) (← links)
- Dynamic Relaxations for Online Bipartite Matching (Q5106387) (← links)
- Online Algorithms for Maximum Cardinality Matching with Edge Arrivals (Q5111708) (← links)
- The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs (Q5111716) (← links)
- An Approximation Algorithm for Network Revenue Management Under Nonstationary Arrivals (Q5130511) (← 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)
- A Truthful Mechanism for Offline Ad Slot Scheduling (Q5459983) (← links)
- (Q5743510) (← links)
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model (Q5875474) (← links)
- Maximum stable matching with one-sided ties of bounded length (Q5918705) (← links)
- Online submodular maximization: beating 1/2 made simple (Q5918911) (← links)
- Online allocation and display ads optimization with surplus supply (Q6112020) (← links)
- Online ad allocation in bounded-degree graphs (Q6112021) (← links)
- Simple and fast algorithm for binary integer and online linear programming (Q6160284) (← links)
- Online Matching in Regular Bipartite Graphs with Randomized Adversary (Q6163632) (← links)
- Online Edge Coloring via Tree Recurrences and Correlation Decay (Q6203478) (← links)