Approximation algorithms and online mechanisms for item pricing

Proceedings of the ACM Conference on Electronic Commerce

Volumn 2006, Issue , 2006, Pages 29-35

  Balcan, Maria Florina ^a   Blum, Avrim ^a  

^a Carnegie Mellon University   (United States)

Author keywords

Approximation Algorithms; Combinatorial Auctions; Online Optimization; Single Minded; Unlimited Supply

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; ONLINE SYSTEMS; OPTIMIZATION; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS; COMBINATORIAL AUCTIONS; ONLINE OPTIMIZATION; SINGLE MINDED; UNLIMITED SUPPLY;

ELECTRONIC COMMERCE;

EID: 33748702881     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1134707.1134711     Document Type: Conference Paper

References (16)

1. B. Awerbuch and R. Kleinberg. Adaptive Routing With End-to-End Feedback: Distributed Learning and Geometric Approaches. In Proceedings of the 36th A CM Symposium on Theory of Computing, pages 45-53, 2004.
2. M.-F. Balcan, A. Blum, J. Hartline, and Y. Mansour. Mechanism Design via Machine Learning. In 46th Annual IEEE Symposium on Foundations of Computer Science, pages 605-614, 2005.
3. A. Blum and J. Hartline. Near-Optimal Online Auctions. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1156-1163, 2005.
4. A. Blum, V. Kumar, A. Rudra, and F. Wu. Online Learning in Online Auctions. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 202-204, 2003.
5. P. Briest and P. Krysta. Single-Minded Unlimited Supply Pricing on Sparse Instances. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1093-1102, 2006.
6. V. Dani and T. P. Hayes, Robbing the Bandit: Less Regret in Online Geometric Optimization Against an Adaptive Adversary. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 937-943, 2006.
7. E. D. Demaine, U. Feige, M. Hajiaghayi, and M. R. Salavatipour, Combination Can Be Hard: Approximability of the Unique Coverage Problem. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 162-171, 2006,
8. G. Even, O. Goldreich, M. Luby, N. Nisan, and B. Velickovic. Efficient Approximation of Product Distributions. Random Structures and Algorithms, 1998.
9. A. Goldberg, J. Hartline, A. Karlin, M. Saks, and A. Wright. Competitive auctions. Games and Economic Behavior. (To appear). An earlier version available as InterTrust Technical Report STAR-TR-99.09.01.
10. A. Goldberg, J. Hartline, and A. Wright. Competitive Auctions and Digital Goods. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 735-744, 2001.
11. V. Guruswami, J. Hartline, A. Karlin, D. Kempe, C. Kenyon, and F. McSherry. On Profit-Maximizing Envy-Free Pricing. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1164-1173, 2005.
12. J. Hartline and V. Koltun. Near-Optimal Pricing in Near-Linear Time . In 9th Workshop on Algorithms and Data Structures, pages 422-431, 2005.
13. A. Kalai and S. Vempala. Efficient algorithms for online decision problems. Journal of Computer and System Sciences, 71(3):291-307, 2005. An earlier version appeared in COLT 2003.
14. M. Luby and A. Wigderson. Pairwise Independence and Derandomization. Technical Report: CSD-95-880, 1995.
15. H. B. McMahan and A. Blum. Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary. In Proceedings of 17th Conference on Computational Learning Theory, pages 109-123, 2004.
16. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.