Online learning in online auctions

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 202-204

  Blum, Avrim ^a   Kumar, Vijay ^b   Rudra, Atri ^c   Wu, Felix ^d  

^a Carnegie Mellon University   (United States)

^b SPOT   (United States)

^c University of Texas at Austin   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LEARNING SYSTEMS; ONLINE SYSTEMS; PROBABILITY; SET THEORY;

ONLINE AUCTIONS; ONLINE LEARNING; REVENUE MAXIMIZATION;

ELECTRONIC COMMERCE;

EID: 0037740018     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. Peter Auer, Nicolo Cesa-Bianchi, Yoav Freund, and Robert E. Schapire. Gambling in a rigged casino: The adversarial multi-armed bandit problem. In Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1995.
2. Amitabha Bagchi, Amitabh Chaudhary, Rahul Garg, Michael T. Goodrich, and Vijay Kumar, Seller-focused algorithms for online auctioning. In Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS 2001), volume 2125. Springer Verlag LNCS, 2001.
3. Ziv Bar-Yossef, Kirsten Hildrum, and Felix Wu. Incentive-compatible online auctions for digital goods. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 964-970, 2002.
4. Amos Fiat, Andrew Goldberg, Jason Hartline, and Anna Karlin. Competitive generalized auctions. In Proceedings of the 34th ACM Symposium on Theory of Computing (STOC 02), 2002.
5. Andrew Goldberg, Jason Hartline, and Andrew Wright. Competitive auctions and digital goods. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 735-744, 2001.
6. Ron Lavi and Noam Nisan. Competitive analysis of incentive compatible on-line auctions. In Proceedings of the 2nd ACM Conference on Electronic Commerce (EC-00), pages 233-241, 2000.
7. Nick Littlestone and Manfred K. Warmuth. The weighted majority algorithm. Information and Computation, 108:212-261, 1994.