An optimal algorithm for on-line bipartite matching
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Game theory, on-line prediction and boosting
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
An optimal deterministic algorithm for online b-matching
Theoretical Computer Science
Combinatorial auctions with decreasing marginal utilities
Proceedings of the 3rd ACM conference on Electronic Commerce
A new greedy approach for facility location problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A Greedy Facility Location Algorithm Analyzed Using Dual Fitting
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
On-line Network Optimization Problems
Developments from a June 1996 seminar on Online algorithms: the state of the art
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
Journal of the ACM (JACM)
Multi-unit auctions with budget-constrained bidders
Proceedings of the 6th ACM conference on Electronic commerce
Probabilistic computations: Toward a unified measure of complexity
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
An improved approximation algorithm for combinatorial auctions with submodular bidders
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
ACM SIGACT News
Truthful auctions for pricing search keywords
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
An analysis of alternative slot auction designs for sponsored search
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Multi-unit auctions with unknown supply
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
An adaptive algorithm for selecting profitable keywords for search-based advertising services
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Database support for matching: limitations and opportunities
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Budget optimization in search-based advertising auctions
Proceedings of the 8th ACM conference on Electronic commerce
Optimal delivery of sponsored search advertisements subject to budget constraints
Proceedings of the 8th ACM conference on Electronic commerce
Mediators in position auctions
Proceedings of the 8th ACM conference on Electronic commerce
Allocating online advertisement space with unreliable estimates
Proceedings of the 8th ACM conference on Electronic commerce
AdWords and generalized online matching
Journal of the ACM (JACM)
Online budgeted matching in random input models with applications to Adwords
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Budget constrained bidding in keyword auctions and online knapsack problems
Proceedings of the 17th international conference on World Wide Web
AdImage: video advertising by image matching and ad scheduling optimization
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
On the Hardness of Truthful Online Auctions with Multidimensional Constraints
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Competitive analysis of online traffic grooming in WDM rings
IEEE/ACM Transactions on Networking (TON)
A Truthful Mechanism for Offline Ad Slot Scheduling
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Budget Constrained Bidding in Keyword Auctions and Online Knapsack Problems
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Sponsored Search Auctions with Reserve Prices: Going Beyond Separability
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Hybrid keyword search auctions
Proceedings of the 18th international conference on World wide web
Online Primal-Dual Algorithms for Covering and Packing
Mathematics of Operations Research
Computational analysis of perfect-information position auctions
Proceedings of the 10th ACM conference on Electronic commerce
Optimal Auctions Capturing Constraints in Sponsored Search
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Expressive banner ad auctions and model-based online optimization for clearing
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
The Balloon Popping Problem Revisited: Lower and Upper Bounds
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Online Ad Assignment with Free Disposal
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Design and realization of advertisement promotion based on the content of webpage
KSEM'07 Proceedings of the 2nd international conference on Knowledge science, engineering and management
Online primal-dual algorithms for maximizing ad-auctions revenue
ESA'07 Proceedings of the 15th annual European conference on Algorithms
An O(log2k)-competitive algorithm for metric bipartite matching
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Stochastic models for budget optimization in search-based advertising
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Capacity constraints and the inevitability of mediators in adword auctions
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Adwords auctions with decreasing valuation bids
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
An adaptive sponsored search mechanism δ-gain truthful in valuation, time, and budget
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
The stochastic machine replenishment problem
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
A novel strategy for multi-resource load balancing in agent-based systems
International Journal of Intelligent Information and Database Systems
Online scheduling of targeted advertisements for IPTV
INFOCOM'10 Proceedings of the 29th conference on Information communications
ACM Transactions on Internet Technology (TOIT)
When LP is the cure for your matching woes: improved bounds for stochastic matchings
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Improved bounds for online stochastic matching
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Online stochastic packing applied to display ad allocation
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Selective call out and real time bidding
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
Proceedings of the 12th ACM conference on Electronic commerce
GSP auctions with correlated types
Proceedings of the 12th ACM conference on Electronic commerce
Online bipartite matching with unknown distributions
Proceedings of the forty-third annual ACM symposium on Theory of computing
Online algorithms with stochastic input
ACM SIGecom Exchanges
Videoader: a video advertising system based on intelligent analysis of visual content
Proceedings of the Third International Conference on Internet Multimedia Computing and Service
Online vertex-weighted bipartite matching and single-bid budgeted allocations
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Fractional matching via balls-and-bins
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Online stochastic weighted matching: improved approximation algorithms
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Online matching with concave returns
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Asymptotically optimal algorithm for stochastic adwords
Proceedings of the 13th ACM Conference on Electronic Commerce
Advertisement allocation for generalized second-pricing schemes
Operations Research Letters
Online allocation of display ads with smooth delivery
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Model Predictive Control for Dynamic Resource Allocation
Mathematics of Operations Research
Online scheduling of targeted advertisements for IPTV
IEEE/ACM Transactions on Networking (TON)
Second-Price ad auctions with binary bids and markets with good competition
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Proceedings of the 2012 ACM Workshop on Cloud computing security workshop
Estimation of the click volume by large scale regression analysis
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Online load balancing under graph constraints
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
Budget smoothing for internet ad auctions: a game theoretic approach
Proceedings of the fourteenth ACM conference on Electronic commerce
Advertising object in web videos
Neurocomputing
Partner tiering in display advertising
Proceedings of the 7th ACM international conference on Web search and data mining
Proceedings of the 23rd international conference on World wide web
| Hi-index | 0.00 |
How does a search engine company decide what ads to display with each query so as to maximize its revenue? This turns out to be a generalization of the online bipartite matching problem. We introduce the notion of a tradeoff revealing LP and use it to derive two optimal algorithms achieving competitive ratios of 1 - 1/e for this problem.