Adwords in a panorama - MaRDI portal

Cites Work

Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
AdWords and generalized online matching
Online matching with concave returns
Online stochastic matching: online actions based on offline statistics
Title not available (Why is that?)
Online Stochastic Matching: Beating 1-1/e
Online stochastic matching: new algorithms with better bounds
Online stochastic matching with unequal probabilities
Online bipartite matching with unknown distributions
Online bipartite matching with random arrivals, an approach based on strongly factor-revealing LPs
Online matching and ad allocation
Online vertex-weighted bipartite matching and single-bid budgeted allocations
Randomized primal-dual analysis of RANKING for online bipartite matching
Budgeted Allocations in the Full-Information Setting
On the approximability of budgeted allocations and improved lower bounds for submodular welfare maximization and GAP
Online stochastic weighted matching: improved approximation algorithms
A counterexample to a correlation inequality in finite sampling
A stronger impossibility for fully online matching
Two-sided online bipartite matching and vertex cover: beating the greedy algorithm
Online submodular welfare maximization: greedy is optimal
An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions
Online algorithms for maximum cardinality matching with edge arrivals
How to match when all vertices arrive online
Title not available (Why is that?)
Fully online matching
The power of multiple choices in online stochastic matching
Online primal dual meets online matching with stochastic rewards: configuration LP to the rescue
(Fractional) online stochastic matching via fine-grained offline statistics
Title not available (Why is that?)
Edge-weighted online bipartite matching

This page was built for publication: Adwords in a panorama

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6562830)