An optimal algorithm for on-line bipartite matching
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
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
The Search: How Google and Its Rivals Rewrote the Rules of Business and Transformed Our Culture
The Search: How Google and Its Rivals Rewrote the Rules of Business and Transformed Our Culture
AdWords and Generalized On-line Matching
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Truthful auctions for pricing search keywords
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Cell Breathing in Wireless LANs: Algorithms and Evaluation
IEEE Transactions on Mobile Computing
Allocating online advertisement space with unreliable estimates
Proceedings of the 8th ACM conference on Electronic commerce
Maximizing throughput in multi-queue switches
Algorithmica
Online budgeted matching in random input models with applications to Adwords
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Online primal-dual algorithms for maximizing ad-auctions revenue
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Click fraud resistant methods for learning click-through rates
WINE'05 Proceedings of the First international conference on Internet and Network Economics
On-line bipartite matching made simple
ACM SIGACT News
A combinatorial allocation mechanism with penalties for banner advertising
Proceedings of the 17th international conference on World Wide Web
Budgeted Allocations in the Full-Information Setting
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Contextual in-image advertising
MM '08 Proceedings of the 16th ACM international conference on Multimedia
A Mechanism for On-line Advertisement Placement to Deter Click Fraud
International Journal of Electronic Commerce
Collecting weighted items from a dynamic queue
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Bid optimization for broad match ad auctions
Proceedings of the 18th international conference on World wide web
Personalized Delivery of On---Line Search Advertisement Based on User Interests
APWeb/WAIM '09 Proceedings of the Joint International Conferences on Advances in Data and Web Management
A Mechanism for On-line Advertisement Placement to Deter Click Fraud
International Journal of Electronic Commerce
Selling ad campaigns: online algorithms with cancellations
Proceedings of the 10th ACM conference on Electronic commerce
The adwords problem: online keyword matching with budgeted bidders under random permutations
Proceedings of the 10th ACM conference on Electronic commerce
Characterizing truthful multi-armed bandit mechanisms: extended abstract
Proceedings of the 10th ACM conference on Electronic commerce
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
Framework for timely and accurate ads on mobile devices
Proceedings of the 18th ACM conference on Information and knowledge management
VideoSense: a contextual in-video advertising system
IEEE Transactions on Circuits and Systems for Video Technology
PageSense: style-wise web page advertising
Proceedings of the 19th international conference on World wide web
Optimal online assignment with forecasts
Proceedings of the 11th ACM conference on Electronic commerce
Strategy and mechanism lessons from the first ad auctions trading agent competition
Proceedings of the 11th ACM conference on Electronic commerce
GameSense: game-like in-image advertising
Multimedia Tools and Applications
How to allocate goods in an online market?
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Linking related documents: combining tag clouds and search queries
ICWE'10 Proceedings of the 10th international conference on Web engineering
Mathematics of Operations Research
OR PRACTICE---Scheduling of Dynamic In-Game Advertising
Operations Research
An expressive mechanism for auctions on the web
Proceedings of the 20th international conference on World wide web
GSP auctions with correlated types
Proceedings of the 12th ACM conference on Electronic commerce
Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs
Proceedings of the forty-third annual ACM symposium on Theory of computing
Frequency capping in online advertising
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
AdCell: ad allocation in cellular networks
ESA'11 Proceedings of the 19th European conference on Algorithms
Repeated budgeted second price ad auction
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Online Optimization with Uncertain Information
ACM Transactions on Algorithms (TALG)
ImageSense: Towards contextual image advertising
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Simultaneous approximations for adversarial and stochastic online budgeted allocation
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Online stochastic matching: online actions based on offline statistics
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Secretary problems via linear programming
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Online prophet-inequality matching with applications to ad allocation
Proceedings of the 13th ACM Conference on Electronic Commerce
The Planning of Guaranteed Targeted Display Advertising
Operations Research
Sponsored search auctions: an overview of research with emphasis on game theoretic aspects
Electronic Commerce Research
Real-time bid optimization for group-buying ads
Proceedings of the 21st ACM international conference on Information and knowledge management
Online Stochastic Matching: Online Actions Based on Offline Statistics
Mathematics of Operations Research
Online constrained optimization with recourse
Information Processing Letters
Optimizing budget constrained spend in search advertising
Proceedings of the sixth ACM international conference on Web search and data mining
Whole-page optimization and submodular welfare maximization with online bidders
Proceedings of the fourteenth ACM conference on Electronic commerce
Efficient parking allocation as online bipartite matching with posted prices
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
New online algorithms for story scheduling in web advertising
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Balanced allocation mechanism: An optimal mechanism for multiple keywords sponsored search auctions
Information Sciences: an International Journal
Repeated Budgeted Second Price Ad Auction
Theory of Computing Systems
| 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 trade-off revealing LP and use it to derive an optimal algorithm achieving a competitive ratio of 1−1/e for this problem.