Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
From MaRDI portal
Publication:3527217
Recommendations
Cited in
(63)- 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
- A nonmonotone analysis with the primal-dual approach: online routing of virtual circuits with unknown durations
- Incentive compatible mulit-unit combinatorial auctions: a primal dual approach
- Second-price ad auctions with binary bids and markets with good competition
- How to allocate goods in an online market?
- Decentralized online integer programming problems with a coupling cardinality constraint
- A nonmonotone analysis with the primal-dual approach: online routing of virtual circuits with unknown durations
- Bicriteria online matching: maximizing weight and cardinality
- Stochastization of weighted automata
- A dynamic learning algorithm for online matching problems with concave returns
- A stochastic algorithm for online bipartite resource allocation problems
- Two-sided online bipartite matching and vertex cover: beating the greedy algorithm
- Online ad assignment with an ad exchange
- The Design of Competitive Online Algorithms via a Primal—Dual Approach
- Online submodular welfare maximization: greedy beats 1/2 in random order
- Online lower bounds via duality
- A randomized O(^2k)-competitive algorithm for metric bipartite matching
- Frequency capping in online advertising
- Online vertex-weighted bipartite matching. Beating \(1-\frac{1}{e}\) with random arrivals
- Tractable equilibria in sponsored search with endogenous budgets
- scientific article; zbMATH DE number 7376006 (Why is no real title available?)
- 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
- Online algorithms for maximum cardinality matching with edge arrivals
- Interior-point-based online stochastic bin packing
- Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios
- Online stochastic matching: new algorithms with better bounds
- scientific article; zbMATH DE number 7053386 (Why is no real title available?)
- Online ad allocation in bounded-degree graphs
- Advertisement allocation for generalized second-pricing schemes
- Improved and deterministic online service with deadlines or delay
- Edge-weighted online bipartite matching
- Adwords in a panorama
- Online primal dual meets online matching with stochastic rewards: configuration LP to the rescue
- Online matching with stochastic rewards: advanced analyses using configuration linear programs
- Towards a practical, budget-oblivious algorithm for the adwords problem under small bids
- Online matching on 3-uniform hypergraphs
- The average-value allocation problem
- Universal optimization for non-clairvoyant subadditive joint replenishment
- Towards a practical, budget-oblivious algorithm for the adwords problem under small bids
- Tight bounds for online matching in bounded-degree graphs with vertex capacities
- A learning-augmented algorithm for the parking permit problem with three permit types
- Primal-dual algorithms with predictions for online bounded allocation and ad-auctions problems
- Optimal algorithms for online b-matching with variable vertex capacities
- Online stochastic matching with edge arrivals
- The greedy algorithm is not optimal for on-line edge coloring
- Universal optimization for non-clairvoyant subadditive joint replenishment
- Online matching meets sampling without replacement
- Nearly-optimal algorithm for non-clairvoyant service with delay
- Leveraging reusability: improved competitive ratio of greedy for reusable resources
- Optimal online bipartite matching in degree-2 graphs
- Autobidding with constraints
This page was built for publication: Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3527217)
