Online Learning of Assignments
暂无分享,去创建一个
[1] Yishay Mansour,et al. From External to Internal Regret , 2005, J. Mach. Learn. Res..
[2] Filip Radlinski,et al. Learning diverse rankings with multi-armed bandits , 2008, ICML '08.
[3] Jon Feldman,et al. Sponsored Search Auctions with Markovian Users , 2008, WINE.
[4] Adam Tauman Kalai,et al. Playing games with approximation algorithms , 2007, STOC '07.
[5] Peter Auer,et al. The Nonstochastic Multiarmed Bandit Problem , 2002, SIAM J. Comput..
[6] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[7] Jan Vondrák,et al. Maximizing a Monotone Submodular Function Subject to a Matroid Constraint , 2011, SIAM J. Comput..
[8] Jan Vondrák,et al. Optimal approximation for the submodular welfare problem in the value oracle model , 2008, STOC.
[9] Jan Vondrák,et al. Submodularity in Combinatorial Optimization , 2007 .
[10] Andreas Krause,et al. Online Learning of Assignments that Maximize Submodular Functions , 2009, ArXiv.
[11] Vahab S. Mirrokni,et al. Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions , 2008, EC '08.
[12] Dafna Shahaf,et al. Turning down the noise in the blogosphere , 2009, KDD.
[13] Andreas Krause,et al. Cost-effective outbreak detection in networks , 2007, KDD '07.
[14] R. Vohra,et al. Algorithmic Game Theory: Sponsored Search Auctions , 2007 .
[15] Anthony V. Fiacco,et al. Mathematical programming study 21 , 1985, Mathematical programming.
[16] David Haussler,et al. How to use expert advice , 1993, STOC.
[17] Jan Vondrák,et al. Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) , 2007, IPCO.
[18] Matthew J. Streeter,et al. An Online Algorithm for Maximizing Submodular Functions , 2008, NIPS.
[19] Jon Feldman,et al. Algorithmic Methods for Sponsored Search Advertising , 2008, ArXiv.