Online stochastic packing applied to display ad allocation
From MaRDI portal
Publication:3586461
Recommendations
Cited in
(44)- Online scheduling problems with flexible release dates: applications to infrastructure restoration
- Improved online algorithms for knapsack and GAP in the random order model
- Online generalized assignment problem with historical information
- Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts
- Iterative computation of security strategies of matrix games with growing action set
- Strategyproof mechanisms for competitive influence in networks
- Optimal dynamic multi-keyword bidding policy of an advertiser in search-based advertising
- Online k-max Search Algorithms with Applications to the Secretary Problem
- The online stochastic generalized assignment problem
- Approximation algorithms for stochastic combinatorial optimization problems
- A dynamic near-optimal algorithm for online linear programming
- Bicriteria online matching: maximizing weight and cardinality
- A dynamic learning algorithm for online matching problems with concave returns
- A stochastic algorithm for online bipartite resource allocation problems
- Fully dynamic matching in bipartite graphs
- Online appointment scheduling in the random order model
- How to allocate goods in an online market?
- Primal beats dual on online packing LPs in the random-order model
- Online submodular welfare maximization: greedy beats 1/2 in random order
- Near optimal online algorithms and fast approximation algorithms for resource allocation problems
- Tractable equilibria in sponsored search with endogenous budgets
- Budget-management strategies in repeated auctions
- Fair resource allocation in a volatile marketplace
- Multiplicative Pacing Equilibria in Auction Markets
- Submodular secretary problem with shortlists
- Online Submodular Maximization Problem with Vector Packing Constraint.
- Approximations to stochastic dynamic programs via information relaxation duality
- Planning online advertising using Gini indices
- Bandits with global convex constraints and objective
- An approximation algorithm for network revenue management under nonstationary arrivals
- Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios
- scientific article; zbMATH DE number 7053386 (Why is no real title available?)
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model
- Online allocation and display ads optimization with surplus supply
- A truthful near-optimal mechanism for online linear packing-covering problem in the random order model
- Adversarial bandits with knapsacks
- Edge-weighted online bipartite matching
- A distributed primal-dual hybrid gradient algorithm for fair resource allocation
- Online multi-dimensional generalized assignment problem with predictions
- The average-value allocation problem
- Near-optimal algorithm for supporting small and medium-sized enterprises in ad systems
- Approximate envy-freeness in indivisible resource allocation with budget constraints
- Near-optimal algorithm for supporting small and medium-sized enterprises in ad systems
- Optimal online bipartite matching in degree-2 graphs
This page was built for publication: Online stochastic packing applied to display ad allocation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586461)
