An approximation algorithm for the generalized assignment problem
Mathematical Programming: Series A and B
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
SIAM Journal on Computing
On maximizing welfare when utility functions are subadditive
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Truthful randomized mechanisms for combinatorial auctions
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Mechanisms for multi-unit auctions
Proceedings of the 8th ACM conference on Electronic commerce
Item pricing for revenue maximization
Proceedings of the 9th ACM conference on Electronic commerce
Dynamic and Non-uniform Pricing Strategies for Revenue Maximization
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
On the Power of Randomization in Algorithmic Mechanism Design
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
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
Selective call out and real time bidding
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Mechanism design via correlation gap
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Improved approximation results for stochastic knapsack problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Mechanism design via correlation gap
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Dynamic pricing with limited supply
Proceedings of the 13th ACM Conference on Electronic Commerce
| Hi-index | 0.00 |
We design algorithms for computing approximately revenuemaximizing sequential posted-pricing mechanisms (SPM) in K-unit auctions, in a standard Bayesian model. A seller has K copies of an item to sell, and there are n buyers, each interested in only one copy, and has some value for the item. The seller posts a price for each buyer, using Bayesian information about buyers' valuations, who arrive in a sequence. An SPM specifies the ordering of buyers and the posted prices, and may be adaptive or non-adaptive in its behavior. The goal is to design SPM in polynomial time to maximize expected revenue. We compare against the expected revenue of optimal SPM, and provide a polynomial time approximation scheme (PTAS) for both nonadaptive and adaptive SPMs. This is achieved by two algorithms: an efficient algorithm that gives a (1 - 1/√2πK)-approximation (and hence a PTAS for sufficiently large K), and another that is a PTAS for constant K. The first algorithm yields a non-adaptive SPM that yields its approximation guarantees against an optimal adaptive SPM - this implies that the adaptivity gap in SPMs vanishes as K becomes larger.