On competitive recommendations
From MaRDI portal
Publication:5964063
DOI10.1016/j.tcs.2015.10.034zbMath1335.68211OpenAlexW2125475547MaRDI QIDQ5964063
Publication date: 26 February 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.10.034
Learning and adaptive systems in artificial intelligence (68T05) Online algorithms; streaming algorithms (68W27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tell me who I am: An interactive recommendation system
- A competitive analysis of the list update problem with lookahead
- On chromatic sums and distributed resource allocation
- Approximating min sum set cover
- Learning Binary Relations and Total Orders
- Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
- Stochastic Covering and Adaptivity
- Competitive recommendation systems
- Learning with attribute costs
- Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
- Database Theory - ICDT 2005
This page was built for publication: On competitive recommendations