Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue

DOI10.1007/978-3-540-75520-3_24zbMath1151.68747OpenAlexW1496647032MaRDI 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

Analysis of algorithms (68W40) Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items (38)

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

This page was built for publication: Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue