Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue

DOI10.1007/978-3-540-75520-3_24zbMath1151.68747MaRDI QIDQ3527217

No author found.

Publication date: 25 September 2008

Published in: Algorithms – ESA 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75520-3_24

Mathematics Subject Classification ID

68W40: Analysis of algorithms

91B26: Auctions, bargaining, bidding and selling, and other market models

Related Items

Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order, Unnamed Item, Online Vertex-Weighted Bipartite Matching, Tractable Equilibria in Sponsored Search with Endogenous Budgets, Budget-Management Strategies in Repeated Auctions, Fair Resource Allocation in a Volatile Marketplace, Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds, Prophet Matching with General Arrivals, Online Resource Allocation with Personalized Learning, Interior-Point-Based Online Stochastic Bin Packing, Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios, Online Algorithms for Maximum Cardinality Matching with Edge Arrivals, Online Stochastic Matching: New Algorithms with Better Bounds, Unnamed Item, Online submodular maximization: beating 1/2 made simple, Online ad allocation in bounded-degree graphs, How to allocate goods in an online market?, A dynamic learning algorithm for online matching problems with concave returns, A stochastic algorithm for online bipartite resource allocation problems, A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching, Frequency capping in online advertising, Advertisement allocation for generalized second-pricing schemes, Autobidding with constraints, Competitive online algorithms for resource allocation over the positive semidefinite cone, A primal-dual online algorithm for the \(k\)-server problem on weighted HSTs, Near optimal algorithms for online weighted bipartite matching in adversary model, Online algorithms for maximum cardinality matching with edge arrivals, New online algorithms for story scheduling in web advertising, Online crowdsourced truck delivery using historical information, Online covering with \(\ell_q\)-norm objectives and applications to network design, Clinching auctions with online supply, Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts, Incentive compatible mulit-unit combinatorial auctions: a primal dual approach, Second-price ad auctions with binary bids and markets with good competition, Decentralized online integer programming problems with a coupling cardinality constraint, Bicriteria Online Matching: Maximizing Weight and Cardinality, Stochastization of Weighted Automata, Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm