Stochastic on-line knapsack problems
Mathematical Programming: Series A and B
Computer networks (3rd ed.)
Allocating Bandwidth for Bursty Connections
SIAM Journal on Computing
A multiple-choice secretary algorithm with applications to online auctions
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
AdWords and Generalized On-line Matching
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Approximate quantiles and the order of the stream
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Multi-armed bandits in metric spaces
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
A Knapsack Secretary Problem with Applications
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Maximizing submodular set functions subject to multiple linear constraints
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Adaptive bidding for display advertising
Proceedings of the 18th international conference on World wide web
The adwords problem: online keyword matching with budgeted bidders under random permutations
Proceedings of the 10th ACM conference on Electronic commerce
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Bidding for Representative Allocations for Display Advertising
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Online primal-dual algorithms for maximizing ad-auctions revenue
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Multi-parameter mechanism design and sequential posted pricing
Proceedings of the forty-second ACM symposium on Theory of computing
Budget constrained auctions with heterogeneous items
Proceedings of the forty-second ACM symposium on Theory of computing
Optimal online assignment with forecasts
Proceedings of the 11th ACM conference on Electronic commerce
Adaptive Uncertainty Resolution in Bayesian Combinatorial Optimization Problems
ACM Transactions on Algorithms (TALG)
Approximation schemes for sequential posted pricing in multi-unit auctions
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Handling forecast errors while bidding for display advertising
Proceedings of the 21st international conference on World Wide Web
Real-time bidding for online advertising: measurement and analysis
Proceedings of the Seventh International Workshop on Data Mining for Online Advertising
| Hi-index | 0.00 |
Ads on the Internet are increasingly sold via ad exchanges such as RightMedia, AdECN and Doubleclick Ad Exchange. These exchanges allow real-time bidding, that is, each time the publisher contacts the exchange, the exchange "calls out" to solicit bids from ad networks. This solicitation introduces a novel aspect, in contrast to existing literature. This suggests developing a joint optimization framework which optimizes over the allocation and well as solicitation. We model this selective call out as an online recurrent Bayesian decision framework with bandwidth type constraints. We obtain natural algorithms with bounded performance guarantees for several natural optimization criteria. We show that these results hold under different call out constraint models, and different arrival processes. Interestingly, the paper shows that under MHR assumptions, the expected revenue of generalized second price auction with reserve is constant factor of the expected welfare. Also the analysis herein allow us prove adaptivity gap type results for the adwords problem.