Online Submodular Maximization under a Matroid Constraint with Application to Learning Assignments

arXiv: Learning, 2014.

Cited by: 12|Bibtex|Views8
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|arxiv.org

Abstract:

Which ads should we display in sponsored search in order to maximize our revenue? How should we dynamically rank information sources to maximize the value of the ranking? These applications exhibit strong diminishing returns: Redundancy decreases the marginal utility of each ad or information source. We show that these and other problem...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments