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