Online Collaborative Filtering on Graphs
From MaRDI portal
Publication:2830757
DOI10.1287/opre.2016.1508zbMath1348.68288arXiv1411.2057OpenAlexW2113676952MaRDI QIDQ2830757
Sujay Sanghavi, Siddhartha Banerjee, Sanjay Shakkottai
Publication date: 31 October 2016
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.2057
Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)
Related Items (2)
Big data in humanitarian supply chain management: a review and further research directions ⋮ Preface to the Special Issue on Information and Decisions in Social and Economic Networks
Cites Work
- Unnamed Item
- Unnamed Item
- Asymptotically efficient adaptive allocation rules
- Regret bounds for sleeping experts and bandits
- Competitive weighted matching in transversal matroids
- Linearly Parameterized Bandits
- AdWords and generalized online matching
- Faster Algorithms for Semi-matching Problems (Extended Abstract)
- A Knapsack Secretary Problem with Applications
- Inferring Rankings Using Constrained Sensing
- Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
- Semi-matchings for bipartite graphs and load balancing
- Bounds for Certain Multiprocessing Anomalies
- Finite-time analysis of the multiarmed bandit problem
This page was built for publication: Online Collaborative Filtering on Graphs