Online learning in online auctions

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Online learning in online auctions

Full text

Pdf (271 KB)

Source

Symposium on Discrete Algorithms archive
Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms table of contents

Baltimore, Maryland

SESSION: Session 4A table of contents

Pages: 202 - 204

Year of Publication: 2003

ISBN:0-89871-538-5

Authors

Avrim Blum	Carnegie Mellon University, Pittsburgh, PA
Vijay Kumar	Amazon.com, Seattle, WA
Atri Rudra	University of Texas at Austin, Austin, TX
Felix Wu	University of California at Berkeley, Berkeley, CA

Sponsors

: SIAM Activity Group on Discrete Mathematics
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Society for Industrial and Applied Mathematics Philadelphia, PA, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 64, Citation Count: 19

Additional Information:

references cited by index terms review collaborative colleagues

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

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	P. Auer , N. Cesa-Bianchi , Y. Freund , R. E. Schapire, Gambling in a rigged casino: The adversarial multi-armed bandit problem, Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS'95), p.322, October 23-25, 1995
	2	Amitabha Bagchi , Amitabh Chaudhary , Rahul Garg , Michael T. Goodrich , Vijay Kumar, Seller-Focused Algorithms for Online Auctioning, Proceedings of the 7th International Workshop on Algorithms and Data Structures, p.135-147, August 08-10, 2001
	3	Ziv Bar-Yossef , Kirsten Hildrum , Felix Wu, Incentive-compatible online auctions for digital goods, Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, p.964-970, January 06-08, 2002, San Francisco, California
	4	Amos Fiat , Andrew V. Goldberg , Jason D. Hartline , Anna R. Karlin, Competitive generalized auctions, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, May 19-21, 2002, Montreal, Quebec, Canada [doi>10.1145/509907.509921]
	5	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
	6	Ron Lavi , Noam Nisan, Competitive analysis of incentive compatible on-line auctions, Proceedings of the 2nd ACM conference on Electronic commerce, p.233-241, October 17-20, 2000, Minneapolis, Minnesota, United States [doi>10.1145/352871.352897]
	7	Nick Littlestone , Manfred K. Warmuth, The weighted majority algorithm, Information and Computation, v.108 n.2, p.212-261, Feb. 1, 1994 [doi>10.1006/inco.1994.1009]

CITED BY 19

	Andrew V. Goldberg , Jason D. Hartline, Competitiveness via consensus, Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, January 12-14, 2003, Baltimore, Maryland
	Ron Lavi , Noam Nisan, Competitive analysis of incentive compatible on-line auctions, Theoretical Computer Science, v.310 n.1-3, p.159-180, 01 January 2004
	Mohammad Taghi Hajiaghayi , Robert Kleinberg , David C. Parkes, Adaptive limited-supply online auctions, Proceedings of the 5th ACM conference on Electronic commerce, May 17-20, 2004, New York, NY, USA
	Avrim Blum , Vijay Kumar , Atri Rudra , Felix Wu, Online learning in online auctions, Theoretical Computer Science, v.324 n.2-3, p.137-146, 20 September 2004
	Ron Lavi , Noam Nisan, Online ascending auctions for gradually expiring items, Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, January 23-25, 2005, Vancouver, British Columbia
	Mohammad T. Hajiaghayi, Online auctions with re-usable goods, Proceedings of the 6th ACM conference on Electronic commerce, p.165-174, June 05-08, 2005, Vancouver, BC, Canada
	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
	Marek Chrobak, 2005: an offline persepctive, ACM SIGACT News, v.37 n.1, March 2006
	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
	Andrew V. Goldberg , Jason D. Hartline, Collusion-resistant mechanisms for single-parameter agents, Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, January 23-25, 2005, Vancouver, British Columbia
	Mohammad Mahdian , Amin Saberi, Multi-unit auctions with unknown supply, Proceedings of the 7th ACM conference on Electronic commerce, p.243-249, June 11-15, 2006, Ann Arbor, Michigan, USA
	Vincent Conitzer , Nikesh Garera, Learning algorithms for online principal-agent problems (and selling goods online), Proceedings of the 23rd international conference on Machine learning, p.209-216, June 25-29, 2006, Pittsburgh, Pennsylvania
	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
	David Pardoe , Peter Stone , Maytal Saar-Tsechansky , Kerem Tomak, Adaptive mechanism design: a metalearning approach, Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet, August 13-16, 2006, Fredericton, New Brunswick, Canada
	Edith Elkind, Designing and learning optimal finite support auctions, Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, p.736-745, January 07-09, 2007, New Orleans, Louisiana
	Hamid Nazerzadeh , Amin Saberi , Rakesh Vohra, Dynamic cost-per-action mechanisms and applications to online advertising, Proceeding of the 17th international conference on World Wide Web, April 21-25, 2008, Beijing, China
	Maria-Florina Balcan , Avrim Blum , Jason D. Hartline , Yishay Mansour, Reducing mechanism design to algorithm design via machine learning, Journal of Computer and System Sciences, v.74 n.8, p.1245-1270, December, 2008
	Mohammad Taghi Hajiaghayi , Robert Kleinberg , Tuomas Sandholm, Automated online mechanism design and prophet inequalities, Proceedings of the 22nd national conference on Artificial intelligence, p.58-65, July 22-26, 2007, Vancouver, British Columbia, Canada
	Jilian Zhang , Hoong Chuin Lau , Jialie Shen, Setting discrete bid levels adaptively in repeated auctions, Proceedings of the 11th International Conference on Electronic Commerce, August 12-15, 2009, Taipei, Taiwan

INDEX TERMS

Primary Classification:
I. Computing Methodologies
I.2 ARTIFICIAL INTELLIGENCE
I.2.6 Learning
Subjects: Concept learning

Additional Classification:
K. Computing Milieux
K.4 COMPUTERS AND SOCIETY
K.4.4 Electronic Commerce

General Terms:
Algorithms, Theory

REVIEW

"Barrett Hazeltine : Reviewer"

Performance of an online auction can be improved by an algorithm that learns from the set of bids already made. An online auction receives bids, and deals with each individually, deciding whether to accept a bid or wait for a higher one. This pape more...

Collaborative Colleagues:

Avrim Blum: colleagues

Vijay Kumar: colleagues

Atri Rudra: colleagues

Felix Wu: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player