AdWords and generalized online matching
From MaRDI portal
Publication:3546342
DOI10.1145/1284320.1284321zbMATH Open1312.68239OpenAlexW2131951207WikidataQ56609588 ScholiaQ56609588MaRDI QIDQ3546342FDOQ3546342
Umesh V. Vazirani, Amin Saberi, Vijay V. Vazirani, Aranyak Mehta
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 (96)
- Online Resource Allocation Under Partially Predictable Demand
- Stochastic models for budget optimization in search-based advertising
- 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
- Online algorithms for maximum cardinality matching with edge arrivals
- 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
- Budget Feasible Procurement Auctions
- Model predictive control for dynamic resource allocation
- Minimum cost perfect matching with delays for two sources
- Online Appointment Scheduling in the Random Order Model
- Maximum stable matching with one-sided ties of bounded length
- Online Stochastic Matching: New Algorithms with Better Bounds
- 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
- Online total bipartite matching problem
- Greedy Matching in Bipartite Random Graphs
- When LP is the cure for your matching woes: improved bounds for stochastic matchings
- Improved online algorithms for Knapsack and GAP in the random order model
- Algorithmic Challenge in Online Advertising
- Asymptotic analysis for multi-objective sequential stochastic assignment problems
- A Truthful Mechanism for Offline Ad Slot Scheduling
- Competitive online algorithms for resource allocation over the positive semidefinite cone
- Secretary Markets with Local Information
- On Policies for Single-Leg Revenue Management with Limited Demand Information
- An Approximation Algorithm for Network Revenue Management Under Nonstationary Arrivals
- Online Vertex-Weighted Bipartite Matching
- Near optimal algorithms for online maximum edge-weighted \(b\)-matching and two-sided vertex-weighted \(b\)-matching
- Fully Dynamic Matching in Bipartite Graphs
- A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching
- Balanced allocation mechanism: an optimal mechanism for multiple keywords sponsored search auctions
- Repeated budgeted second price ad auction
- A stochastic algorithm for online bipartite resource allocation problems
- Collecting weighted items from a dynamic queue
- Online Resource Allocation with Personalized Learning
- Oblivious algorithms for the maximum directed cut problem
- Autobidding with constraints
- 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
- 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
- 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
- Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm
- How the experts algorithm can help solve LPs online
- Prediction and welfare in ad auctions
- Bounding the inefficiency of outcomes in generalized second price auctions
- Primal Beats Dual on Online Packing LPs in the Random-Order Model
- Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order
- Online stochastic matching: online actions based on offline statistics
- A Dynamic Near-Optimal Algorithm for Online Linear Programming
- Online Algorithms for Maximum Cardinality Matching with Edge Arrivals
- Fair Resource Allocation in a Volatile Marketplace
- Title not available (Why is that?)
- The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs
- Clinching auctions with online supply
- Minimum Cost Perfect Matching with Delays for Two Sources
- Title not available (Why is that?)
- Prophet Matching with General Arrivals
- Stochastic Online Metric Matching
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model
- Online Allocation and Pricing with Economies of Scale
- Adwords in a panorama
- Online Ad Assignment with an Ad Exchange
- Online Matching in Regular Bipartite Graphs
- Dynamic Relaxations for Online Bipartite Matching
- Title not available (Why is that?)
- Simple and fast algorithm for binary integer and online linear programming
- Deterministic primal-dual algorithms for online \(k\)-way matching with delays
- Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem
- Online submodular maximization: beating 1/2 made simple
- Online allocation and display ads optimization with surplus supply
- Bicriteria Online Matching: Maximizing Weight and Cardinality
- Budget-Management Strategies in Repeated Auctions
- 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
- Impatient Online Matching
- Multiplicative Pacing Equilibria in Auction Markets
- Online Edge Coloring via Tree Recurrences and Correlation Decay
- Tight Revenue Gaps among Multiunit Mechanisms
- Deterministic primal-dual algorithms for online \(k\)-way matching with delays
- Tighter Bounds for Online Bipartite Matching
- Adversarial bandits with knapsacks
- Edge-weighted online bipartite matching
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)
