Learning binary relations and total orders
SIAM Journal on Computing
GroupLens: an open architecture for collaborative filtering of netnews
CSCW '94 Proceedings of the 1994 ACM conference on Computer supported cooperative work
Randomized algorithms
Analysis of recommendation algorithms for e-commerce
Proceedings of the 2nd ACM conference on Electronic commerce
Item-based collaborative filtering recommendation algorithms
Proceedings of the 10th international conference on World Wide Web
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Competitive recommendation systems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Methods and metrics for cold-start recommendations
SIGIR '02 Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval
Convergent algorithms for collaborative filtering
Proceedings of the 4th ACM conference on Electronic commerce
Recommendation Systems: A Probabilistic Analysis
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Collaborative Filtering with Privacy
SP '02 Proceedings of the 2002 IEEE Symposium on Security and Privacy
Shilling recommender systems for fun and profit
Proceedings of the 13th international conference on World Wide Web
Collaboration of untrusting peers with changing interests
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Utility-based neighbourhood formation for efficient and robust collaborative filtering
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Improved recommendation systems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Tell me who I am: an interactive recommendation system
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Online collaborative filtering with nearly optimal dynamic regret
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Asynchronous recommendation systems
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Competitive collaborative learning
Journal of Computer and System Sciences
Finding similar users in social networks: extended abstract
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Asynchronous active recommendation systems
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Collaborative scoring with dishonest participants
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Recommender systems with non-binary grades
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
A novel protocol for communicating reputation in p2p networks
iTrust'06 Proceedings of the 4th international conference on Trust Management
Distributed weighted stable marriage problem
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Improved collaborative filtering
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
| Hi-index | 0.00 |
We consider a model with n players and m objects. Each player has a "preference vector" of length m that models his grade for each object. The grades are unknown to the players. A player can learn his grade for an object by probing that object, but performing a probe incurs cost. The goal of a player is to learn his preference vector with minimal cost, by adopting the results of probes performed by other players. To facilitate communication, we assume that players collaborate by posting their grades for objects on a shared billboard: reading from the billboard is free. We consider players whose preference vectors are popular, i.e., players whose preferences are common to many other players. We present distributed and sequential algorithms to solve the problem with logarithmic cost overhead.