An optimal algorithm for on-line bipartite matching
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Combining fairness with throughput: online routing with multiple objectives
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Fairness in routing and load balancing
Journal of Computer and System Sciences - Special issue on Internet algorithms
On approximately fair allocations of indivisible goods
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
AdWords and Generalized On-line Matching
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Fairness Measures for Resource Allocation
SIAM Journal on Computing
Allocating online advertisement space with unreliable estimates
Proceedings of the 8th ACM conference on Electronic commerce
Online budgeted matching in random input models with applications to Adwords
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Throughput-competitive on-line routing
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Online auctions and generalized secretary problems
ACM SIGecom Exchanges
Improved Approximation Algorithms for Budgeted Allocations
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
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
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
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
Algorithms for Secretary Problems on Graphs and Hypergraphs
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Bidding for Representative Allocations for Display Advertising
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Online Ad Assignment with Free Disposal
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Online Stochastic Matching: Beating 1-1/e
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Online primal-dual algorithms for maximizing ad-auctions revenue
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Adwords auctions with decreasing valuation bids
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Multi-parameter mechanism design and sequential posted pricing
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
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
Proceedings of the 12th ACM conference on Electronic commerce
Online algorithms with stochastic input
ACM SIGecom Exchanges
On variants of the matroid secretary problem
ESA'11 Proceedings of the 19th European conference on Algorithms
Simultaneous approximations for adversarial and stochastic online budgeted allocation
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Risk-aware revenue maximization in display advertising
Proceedings of the 21st international conference on World Wide Web
Handling forecast errors while bidding for display advertising
Proceedings of the 21st international conference on World Wide Web
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
Online prophet-inequality matching with applications to ad allocation
Proceedings of the 13th ACM Conference on Electronic Commerce
SHALE: an efficient algorithm for allocation of guaranteed display advertising
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Online allocation of display ads with smooth delivery
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Geometry of online packing linear programs
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Optimizing budget constrained spend in search advertising
Proceedings of the sixth ACM international conference on Web search and data mining
Budget smoothing for internet ad auctions: a game theoretic approach
Proceedings of the fourteenth ACM conference on Electronic commerce
Strategyproof mechanisms for competitive influence in networks
Proceedings of the 22nd international conference on World Wide Web
Real time bid optimization with smooth budget delivery in online advertising
Proceedings of the Seventh International Workshop on Data Mining for Online Advertising
Real-time bidding for online advertising: measurement and analysis
Proceedings of the Seventh International Workshop on Data Mining for Online Advertising
Partner tiering in display advertising
Proceedings of the 7th ACM international conference on Web search and data mining
Adscape: harvesting and analyzing online display ads
Proceedings of the 23rd international conference on World wide web
Hi-index | 0.00 |
Inspired by online ad allocation, we study online stochastic packing integer programs from theoretical and practical standpoints. We first present a near-optimal online algorithm for a general class of packing integer programs which model various online resource allocation problems including online variants of routing, ad allocations, generalized assignment, and combinatorial auctions. As our main theoretical result, we prove that a simple dual training-based algorithm achieves a (1-o(1))- approximation guarantee in the random order stochastic model. This is a significant improvement over logarithmic or constant-factor approximations for the adversarial variants of the same problems (e.g. factor 1 - 1/e for online ad allocation, and log(m) for online routing). We then focus on the online display ad allocation problem and study the efficiency and fairness of various training-based and online allocation algorithms on data sets collected from real-life display ad allocation system. Our experimental evaluation confirms the effectiveness of training-based algorithms on real data sets, and also indicates an intrinsic trade-off between fairness and efficiency.