Mechanism design, machine learning, and pricing problems

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Mechanism design, machine learning, and pricing problems

Full text

Pdf (72 KB)

Source

ACM SIGecom Exchanges archive
Volume 7 , Issue 1 (December 2007) table of contents

Pages 34-36

Year of Publication: 2007

Authors

Maria-Florina Balcan	School of Computer Science, Carnegie Mellon University
Avrim Blum	School of Computer Science, Carnegie Mellon University

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 18, Citation Count: 0

Additional Information:

references index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1345037.1345045 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Gagan Aggarwal , Jason D. Hartline, Knapsack auctions, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, p.1083-1092, January 22-26, 2006, Miami, Florida [doi>10.1145/1109557.1109677]
	2	Martin M. Anthony , Peter Bartlett, Learning in Neural Networks: Theoretical Foundations, Cambridge University Press, New York, NY, 1999
	3	Maria-Florina Balcan , Avrim Blum, Approximation algorithms and online mechanisms for item pricing, Proceedings of the 7th ACM conference on Electronic commerce, p.29-35, June 11-15, 2006, Ann Arbor, Michigan, USA [doi>10.1145/1134707.1134711]
	4	BALCAN, M.-F., BLUM, A., CHAN, H., AND HAJIAGHAYI, M. 2007. A theory of loss-leaders: Making money by pricing below cost. In Proc. 3rd International Workshop on Internet and Network Economics. Lecture Notes in Computer Science.
	5	Maria-Florina Balcan , Avrim Blum, Mechanism Design via Machine Learning, Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, p.605-614, October 23-25, 2005 [doi>10.1109/SFCS.2005.50]
	6	Avrim Blum , Jason D. Hartline, Near-optimal online auctions, Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, January 23-25, 2005, Vancouver, British Columbia
	7	Patrick Briest , Piotr Krysta, Single-minded unlimited supply pricing on sparse instances, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, p.1093-1102, January 22-26, 2006, Miami, Florida [doi>10.1145/1109557.1109678]
	8	GOLDBERG, A., HARTLINE, J., KARLIN, A., SAKS, M., AND WRIGHT, A. 2006. Competitive Auctions and Digital Goods. Games and Economic Behavior.
	9	Andrew V. Goldberg , Jason D. Hartline , Andrew Wright, Competitive auctions and digital goods, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, p.735-744, January 07-09, 2001, Washington, D.C., United States
	10	Venkatesan Guruswami , Jason D. Hartline , Anna R. Karlin , David Kempe , Claire Kenyon , Frank McSherry, On profit-maximizing envy-free pricing, Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, January 23-25, 2005, Vancouver, British Columbia
	11	MYERSON, R. 1981. Optimal Auction Design. Mathematics of Opperations Research 6, 58-73.
	12	VAPNIK, V. 1998. Statistical Learning Theory. Springer-Verlag.