Online learning of assignments

Advances in Neural Information Processing Systems 22 - Proceedings of the 2009 Conference

Volumn , Issue , 2009, Pages 1794-1802

  Streeter, Matthew ^a   Golovin, Daniel ^b   Krause, Andreas ^c  

^a GOOGLE INC   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; E-LEARNING;

INFORMATION SOURCES; MARGINAL UTILITY; ONLINE LEARNING; ONLINE OPTIMIZATION; OPTIMAL CONSTANT; PERFORMANCE RATIO; REAL-WORLD; SPONSORED SEARCHES; SUBMODULAR FUNCTIONS; THEORETICAL GUARANTEES;

ECONOMICS;

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

References (20)

1. Gagan Aggarwal, Jon Feldman, S. Muthukrishnan, and Martin Pál. Sponsored search auctions with markovian users. In WINE, pages 621-628, 2008.
2. Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, and Robert E. Schapire. The nonstochastic multiarmed bandit problem. SIAM Journal on Computing, 32(1):48-77, 2002.
3. Avrim Blum and Yishay Mansour. From external to internal regret. Journal of Machine Learning Research, 8:1307-1324, 2007.
4. Gruia Calinescu, Chandra Chekuri, Martin Pál, and Jan Vondrák. Maximizing a submodular set function subject to a matroid constraint. SIAM Journal on Computing. To appear.
5. Nicolò Cesa-Bianchi, Yoav Freund, David Haussler, David P. Helmbold, Robert E. Schapire, and Manfred K. Warmuth. How to use expert advice. J. ACM, 44(3):427-485, 1997.
6. Benjamin Edelman, Michael Ostrovsky, and Michael Schwarz. Internet advertising and the generalized second price auction: Selling billions of dollars worth of keywords. American Economic Review, 97(1):242-259, 2007.
7. Jon Feldman and S. Muthukrishnan. Algorithmic methods for sponsored search advertising. In Zhen Liu and Cathy H. Xia, editors, Performance Modeling and Engineering. 2008.
8. Marshall L. Fisher, George L. Nemhauser, and Laurence A. Wolsey. An analysis of approximations for maximizing submodular set functions - II. Mathematical Programming Study, (8):73-87, 1978.
9. Daniel Golovin, Andreas Krause, and Matthew Streeter. Online learning of assignments that maximize submodular functions. CoRR, abs/0908.0772, 2009.
10. Sham M. Kakade, Adam Tauman Kalai, and Katrina Ligett. Playing games with approximation algorithms. In STOC, pages 546-555, 2007.
11. Andreas Krause and Carlos Guestrin. Beyond convexity: Submodularity in machine learning. Tutorial at ICML 2008. http://www.select.cs.cmu.edu/tutorials/ icml08submodularity.html.
12. Sébastien Lahaie, David M. Pennock, Amin Saberi, and Rakesh V. Vohra. Sponsored search auctions. In Noam Nisan, Tim Roughgarden, Eva Tardos, and Vijay V. Vazirani, editors, Algorithmic Game Theory. Cambridge University Press, New York, NY, USA, 2007.
13. Jure Leskovec, Andreas Krause, Carlos Guestrin, Christos Faloutsos, Jeanne VanBriesen, and Natalie Glance. Cost-effective outbreak detection in networks. In KDD, pages 420-429, 2007.
14. Vahab Mirrokni, Michael Schapira, and Jan Vondrák. Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions. In EC, pages 70-77, 2008.
15. George L. Nemhauser, Laurence A. Wolsey, and Marshall L. Fisher. An analysis of approximations for maximizing submodular set functions - I. Mathematical Programming, 14(1):265-294, 1978.
16. Filip Radlinski, Robert Kleinberg, and Thorsten Joachims. Learning diverse rankings with multi-armed bandits. In ICML, pages 784-791, 2008.
17. Matthew Streeter and Daniel Golovin. An online algorithm for maximizing submodular functions. Technical Report CMU-CS-07-171, Carnegie Mellon University, 2007.
18. Matthew Streeter and Daniel Golovin. An online algorithm for maximizing submodular functions. In NIPS, pages 1577-1584, 2008.
19. Jan Vondrák. Submodularity in Combinatorial Optimization. PhD thesis, Charles University, Prague, Czech Republic, 2007.
20. Jan Vondrák. Optimal approximation for the submodular welfare problem in the value oracle model. In STOC, pages 67-74, 2008.