AdWords and generalized online matching
From MaRDI portal
Publication:3546342
DOI10.1145/1284320.1284321zbMath1312.68239WikidataQ56609588 ScholiaQ56609588MaRDI QIDQ3546342
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
68W40: Analysis of algorithms
90C05: Linear programming
91B26: Auctions, bargaining, bidding and selling, and other market models
90B60: Marketing, advertising
91B68: Matching models
68M11: Internet topics
Related Items
Primal Beats Dual on Online Packing LPs in the Random-Order Model, Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order, Unnamed Item, Unnamed Item, Budget Feasible Procurement Auctions, Online Vertex-Weighted Bipartite Matching, On Policies for Single-Leg Revenue Management with Limited Demand Information, Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem, Budget-Management Strategies in Repeated Auctions, Online Resource Allocation Under Partially Predictable Demand, Fair Resource Allocation in a Volatile Marketplace, Tight Revenue Gaps among Multiunit Mechanisms, Multiplicative Pacing Equilibria in Auction Markets, Greedy Matching in Bipartite Random Graphs, Prophet Matching with General Arrivals, Asymptotic analysis for multi-objective sequential stochastic assignment problems, Online Matching in Regular Bipartite Graphs, Online Resource Allocation with Personalized Learning, Dynamic Relaxations for Online Bipartite Matching, An Approximation Algorithm for Network Revenue Management Under Nonstationary Arrivals, Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios, Impatient Online Matching, Stochastic Online Metric Matching, The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs, Online Algorithms for Maximum Cardinality Matching with Edge Arrivals, Online Stochastic Matching: New Algorithms with Better Bounds, Minimum Cost Perfect Matching with Delays for Two Sources, A Truthful Mechanism for Offline Ad Slot Scheduling, Unnamed Item, Maximum stable matching with one-sided ties of bounded length, Online submodular maximization: beating 1/2 made simple, Improved Online Algorithms for Knapsack and GAP in the Random Order Model, Online allocation and display ads optimization with surplus supply, Online ad allocation in bounded-degree graphs, Simple and fast algorithm for binary integer and online linear programming, Online Matching in Regular Bipartite Graphs with Randomized Adversary, How to allocate goods in an online market?, Approximation algorithms for stochastic combinatorial optimization problems, A stochastic algorithm for online bipartite resource allocation problems, Serve or skip: the power of rejection in online bottleneck matching, Optimal equilibrium bidding strategies for budget constrained bidders in sponsored search auctions, On the advice complexity of online bipartite matching and online stable marriage, A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching, Frequency capping in online advertising, Prediction and welfare in ad auctions, Stochastic models for budget optimization in search-based advertising, Advertisement allocation for generalized second-pricing schemes, The balloon popping problem revisited: lower and upper bounds, When LP is the cure for your matching woes: improved bounds for stochastic matchings, Autobidding with constraints, Mediators in position auctions, Near optimal algorithms for online maximum edge-weighted \(b\)-matching and two-sided vertex-weighted \(b\)-matching, Balanced allocation mechanism: an optimal mechanism for multiple keywords sponsored search auctions, Minimum cost perfect matching with delays for two sources, Competitive online algorithms for resource allocation over the positive semidefinite cone, Repeated budgeted second price ad auction, Near optimal algorithms for online weighted bipartite matching in adversary model, Online algorithms for maximum cardinality matching with edge arrivals, Shortest augmenting paths for online matchings on trees, New online algorithms for story scheduling in web advertising, A polyhedral approach to online bipartite matching, Collecting weighted items from a dynamic queue, Improved online algorithms for Knapsack and GAP in the random order model, Online total bipartite matching problem, Clinching auctions with online supply, Introduction to computer science and economic theory, Bounding the inefficiency of outcomes in generalized second price auctions, Pricing and allocation algorithm designs in dynamic ridesharing system, Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts, Oblivious algorithms for the maximum directed cut problem, An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs, Optimal dynamic multi-keyword bidding policy of an advertiser in search-based advertising, Online Collaborative Filtering on Graphs, How the Experts Algorithm Can Help Solve LPs Online, Model Predictive Control for Dynamic Resource Allocation, Online Stochastic Matching: Online Actions Based on Offline Statistics, A Dynamic Near-Optimal Algorithm for Online Linear Programming, Bicriteria Online Matching: Maximizing Weight and Cardinality, Tighter Bounds for Online Bipartite Matching, Fully Dynamic Matching in Bipartite Graphs, Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm, Secretary Markets with Local Information, Online Appointment Scheduling in the Random Order Model, Online Ad Assignment with an Ad Exchange, Online Allocation and Pricing with Economies of Scale
