AdWords and generalized online matching
From MaRDI portal
Publication:3546342
DOI10.1145/1284320.1284321zbMATH Open1312.68239OpenAlexW2131951207WikidataQ56609588 ScholiaQ56609588MaRDI QIDQ3546342FDOQ3546342
Authors: Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vijay V. Vazirani 
Publication date: 21 December 2008
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1284320.1284321
Recommendations
Linear programming (90C05) Analysis of algorithms (68W40) Auctions, bargaining, bidding and selling, and other market models (91B26) Marketing, advertising (90B60) Internet topics (68M11) Matching models (91B68)
Cited In (only showing first 100 items - show all)
- Stochastic models for budget optimization in search-based advertising
- Online matching and ad allocation
- Primal beats dual on online packing LPs in the random-order model
- The adwords problem with strict capacity constraints
- On the advice complexity of online bipartite matching and online stable marriage
- How to allocate goods in an online market?
- Mediators in position auctions
- Pricing and allocation algorithm designs in dynamic ridesharing system
- On Revenue Maximization in Second-Price Ad Auctions
- Online algorithms for maximum cardinality matching with edge arrivals
- Secretary markets with local information
- New online algorithms for story scheduling in web advertising
- Introduction to computer science and economic theory
- Online collaborative filtering on graphs
- Shortest augmenting paths for online matchings on trees
- Model predictive control for dynamic resource allocation
- Fully dynamic matching in bipartite graphs
- Online algorithms for maximum cardinality matching with edge arrivals
- Minimum cost perfect matching with delays for two sources
- Minimum cost perfect matching with delays for two sources
- Approximation algorithms for stochastic combinatorial optimization problems
- A polyhedral approach to online bipartite matching
- Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts
- Stochastic conditional gradient methods: from convex minimization to submodular maximization
- The sparse awakens: streaming algorithms for matching size estimation in sparse graphs
- Fair resource allocation in a volatile marketplace
- Online submodular welfare maximization: greedy beats 1/2 in random order
- Improved online algorithms for knapsack and GAP in the random order model
- When LP is the cure for your matching woes: improved bounds for stochastic matchings
- Algorithmic Challenge in Online Advertising
- Asymptotic analysis for multi-objective sequential stochastic assignment problems
- Revenue-maximizing rankings for online platforms with quality-sensitive consumers
- Online resource allocation under partially predictable demand
- A dynamic learning algorithm for online matching problems with concave returns
- A Truthful Mechanism for Offline Ad Slot Scheduling
- Competitive online algorithms for resource allocation over the positive semidefinite cone
- Two-sided online bipartite matching and vertex cover: beating the greedy algorithm
- Near optimal algorithms for online maximum edge-weighted \(b\)-matching and two-sided vertex-weighted \(b\)-matching
- A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching
- How experts can solve LPs online
- A dynamic near-optimal algorithm for online linear programming
- Online stochastic matching: new algorithms with better bounds
- Balanced allocation mechanism: an optimal mechanism for multiple keywords sponsored search auctions
- Repeated budgeted second price ad auction
- Budget feasible procurement auctions
- A stochastic algorithm for online bipartite resource allocation problems
- Collecting weighted items from a dynamic queue
- AdCell: ad allocation in cellular networks
- Oblivious algorithms for the maximum directed cut problem
- Autobidding with constraints
- Serve or skip: the power of rejection in online bottleneck matching
- Near optimal algorithms for online weighted bipartite matching in adversary model
- Advertisement allocation for generalized second-pricing schemes
- Adwords Auctions with Decreasing Valuation Bids
- Frequency capping in online advertising
- The balloon popping problem revisited: lower and upper bounds
- Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
- Greedy matching in bipartite random graphs
- An improved optimization algorithm of ads' allocation in sponsored search and the results of experiments
- Optimal equilibrium bidding strategies for budget constrained bidders in sponsored search auctions
- An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs
- Online ad allocation in bounded-degree graphs
- Prediction and welfare in ad auctions
- Bounding the inefficiency of outcomes in generalized second price auctions
- Online stochastic matching: online actions based on offline statistics
- The asymmetric matrix partition problem
- An approximation algorithm for network revenue management under nonstationary arrivals
- On policies for single-leg revenue management with limited demand information
- Online appointment scheduling in the random order model
- Online vertex-weighted bipartite matching. Beating \(1-\frac{1}{e}\) with random arrivals
- Title not available (Why is that?)
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model
- Online resource allocation with personalized learning
- Bicriteria online matching: maximizing weight and cardinality
- Adwords in a panorama
- Tight revenue gaps among multiunit mechanisms
- Dynamic Relaxations for Online Bipartite Matching
- Title not available (Why is that?)
- Second-price ad auctions with binary bids and markets with good competition
- Simple and fast algorithm for binary integer and online linear programming
- Deterministic primal-dual algorithms for online \(k\)-way matching with delays
- Maximum stable matching with one-sided ties of bounded length
- Online submodular maximization: beating 1/2 made simple
- Online allocation and display ads optimization with surplus supply
- Online total bipartite matching problem
- Online Matching in Regular Bipartite Graphs with Randomized Adversary
- Prophet matching with general arrivals
- Online matching with stochastic rewards: advanced analyses using configuration linear programs
- Randomized algorithm for MPMD on two sources
- Stochastic online metric matching
- Tighter bounds for online bipartite matching
- Online matching in regular bipartite graphs
- Impatient Online Matching
- Multiplicative Pacing Equilibria in Auction Markets
- Online Edge Coloring via Tree Recurrences and Correlation Decay
- Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios
- Optimal dynamic multi-keyword bidding policy of an advertiser in search-based advertising
- Monge properties, optimal greedy policies, and policy improvement for the dynamic stochastic transportation problem
- Online allocation and pricing with economies of scale
- Deterministic primal-dual algorithms for online \(k\)-way matching with delays
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)
