Pages that link to "Item:Q3586461"
From MaRDI portal
The following pages link to Online Stochastic Packing Applied to Display Ad Allocation (Q3586461):
Displayed 32 items.
- Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
- A dynamic learning algorithm for online matching problems with concave returns (Q319996) (← links)
- A stochastic algorithm for online bipartite resource allocation problems (Q342502) (← links)
- Online scheduling problems with flexible release dates: applications to infrastructure restoration (Q1651574) (← links)
- On variants of the matroid secretary problem (Q2017872) (← links)
- Improved online algorithms for Knapsack and GAP in the random order model (Q2032350) (← links)
- Online generalized assignment problem with historical information (Q2108140) (← links)
- Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts (Q2285050) (← links)
- Iterative computation of security strategies of matrix games with growing action set (Q2292111) (← links)
- Strategyproof mechanisms for competitive influence in networks (Q2362354) (← links)
- Optimal dynamic multi-keyword bidding policy of an advertiser in search-based advertising (Q2699027) (← links)
- Online k-max Search Algorithms with Applications to the Secretary Problem (Q2830073) (← links)
- How the Experts Algorithm Can Help Solve LPs Online (Q2833109) (← links)
- A Dynamic Near-Optimal Algorithm for Online Linear Programming (Q2931707) (← links)
- Bicriteria Online Matching: Maximizing Weight and Cardinality (Q2937766) (← links)
- Fully Dynamic Matching in Bipartite Graphs (Q3448782) (← links)
- Online Appointment Scheduling in the Random Order Model (Q3452831) (← 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)
- Tractable Equilibria in Sponsored Search with Endogenous Budgets (Q4994152) (← links)
- Budget-Management Strategies in Repeated Auctions (Q5003721) (← links)
- Fair Resource Allocation in a Volatile Marketplace (Q5031013) (← links)
- Multiplicative Pacing Equilibria in Auction Markets (Q5080654) (← links)
- (Q5090369) (← links)
- Online Submodular Maximization Problem with Vector Packing Constraint. (Q5111710) (← links)
- Approximations to Stochastic Dynamic Programs via Information Relaxation Duality (Q5126622) (← links)
- Bandits with Global Convex Constraints and Objective (Q5129206) (← 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)
- (Q5743510) (← links)
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model (Q5875474) (← links)
- Online allocation and display ads optimization with surplus supply (Q6112020) (← links)