AdWords and generalized online matching
From MaRDI portal
Publication:3546342
Recommendations
Cited in
(only showing first 100 items - show all)- The adwords problem with strict capacity constraints
- Secretary markets with local information
- Online vertex-weighted bipartite matching. Beating \(1-\frac{1}{e}\) with random arrivals
- The balloon popping problem revisited: lower and upper bounds
- Budget feasible procurement auctions
- On policies for single-leg revenue management with limited demand information
- Online algorithms for maximum cardinality matching with edge arrivals
- Two-sided online bipartite matching and vertex cover: beating the greedy algorithm
- Stochastic models for budget optimization in search-based advertising
- Oblivious algorithms for the maximum directed cut problem
- A polyhedral approach to online bipartite matching
- A stochastic algorithm for online bipartite resource allocation problems
- Bounding the inefficiency of outcomes in generalized second price auctions
- The sparse awakens: streaming algorithms for matching size estimation in sparse graphs
- A dynamic near-optimal algorithm for online linear programming
- Mediators in position auctions
- Autobidding with constraints
- Model predictive control for dynamic resource allocation
- New online algorithms for story scheduling in web advertising
- Minimum cost perfect matching with delays for two sources
- Online stochastic matching: new algorithms with better bounds
- Online resource allocation with personalized learning
- Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts
- Minimum cost perfect matching with delays for two sources
- Balanced allocation mechanism: an optimal mechanism for multiple keywords sponsored search auctions
- On Revenue Maximization in Second-Price Ad Auctions
- Competitive online algorithms for resource allocation over the positive semidefinite cone
- Fair resource allocation in a volatile marketplace
- A Truthful Mechanism for Offline Ad Slot Scheduling
- Serve or skip: the power of rejection in online bottleneck matching
- On the advice complexity of online bipartite matching and online stable marriage
- Fully dynamic matching in bipartite graphs
- Optimal equilibrium bidding strategies for budget constrained bidders in sponsored search auctions
- Online appointment scheduling in the random order model
- Algorithmic Challenge in Online Advertising
- Near optimal algorithms for online maximum edge-weighted \(b\)-matching and two-sided vertex-weighted \(b\)-matching
- Near optimal algorithms for online weighted bipartite matching in adversary model
- Adwords Auctions with Decreasing Valuation Bids
- Online matching and ad allocation
- Improved online algorithms for knapsack and GAP in the random order model
- Asymptotic analysis for multi-objective sequential stochastic assignment problems
- Primal beats dual on online packing LPs in the random-order model
- An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs
- Advertisement allocation for generalized second-pricing schemes
- Repeated budgeted second price ad auction
- Online collaborative filtering on graphs
- Collecting weighted items from a dynamic queue
- Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
- Shortest augmenting paths for online matchings on trees
- When LP is the cure for your matching woes: improved bounds for stochastic matchings
- A dynamic learning algorithm for online matching problems with concave returns
- Frequency capping in online advertising
- An improved optimization algorithm of ads' allocation in sponsored search and the results of experiments
- Pricing and allocation algorithm designs in dynamic ridesharing system
- Revenue-maximizing rankings for online platforms with quality-sensitive consumers
- Prediction and welfare in ad auctions
- How to allocate goods in an online market?
- Online algorithms for maximum cardinality matching with edge arrivals
- Greedy matching in bipartite random graphs
- Online ad allocation in bounded-degree graphs
- scientific article; zbMATH DE number 7053386 (Why is no real title available?)
- AdCell: ad allocation in cellular networks
- The asymmetric matrix partition problem
- Stochastic conditional gradient methods: from convex minimization to submodular maximization
- Approximation algorithms for stochastic combinatorial optimization problems
- Introduction to computer science and economic theory
- A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching
- Online resource allocation under partially predictable demand
- Online submodular welfare maximization: greedy beats 1/2 in random order
- An approximation algorithm for network revenue management under nonstationary arrivals
- Deterministic primal-dual algorithms for online \(k\)-way matching with delays
- Online allocation and pricing with economies of scale
- Online Matching in Regular Bipartite Graphs with Randomized Adversary
- Online matching with stochastic rewards: advanced analyses using configuration linear programs
- Randomized algorithm for MPMD on two sources
- Online allocation and display ads optimization with surplus supply
- Tighter bounds for online bipartite matching
- Bicriteria online matching: maximizing weight and cardinality
- A hybrid algorithm for the adwords problem
- Impatient Online Matching
- Adversarial bandits with knapsacks
- Edge-weighted online bipartite matching
- Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios
- Online Edge Coloring via Tree Recurrences and Correlation Decay
- Optimal dynamic multi-keyword bidding policy of an advertiser in search-based advertising
- Clinching auctions with online supply
- Simple and fast algorithm for binary integer and online linear programming
- scientific article; zbMATH DE number 7376006 (Why is no real title available?)
- Online total bipartite matching problem
- Stochastic online metric matching
- Maximum stable matching with one-sided ties of bounded length
- Online matching in regular bipartite graphs
- Adwords in a panorama
- Budget-management strategies in repeated auctions
- Prophet matching with general arrivals
- Deterministic primal-dual algorithms for online \(k\)-way matching with delays
- Second-price ad auctions with binary bids and markets with good competition
- Monge properties, optimal greedy policies, and policy improvement for the dynamic stochastic transportation problem
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model
- Online ad assignment with an ad exchange
This page was built for publication: AdWords and generalized online matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546342)
