Article

Collaborate with strangers to find own preferences

Authors:

Baruch Awerbuch,

Boaz Patt-Shamir,

Mark R. TuttleAuthors Info & Claims

SPAA '05: Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures

Pages 263 - 269

https://doi.org/10.1145/1073970.1074014

Published: 18 July 2005 Publication History

Abstract

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.

References

[1]

B. Awerbuch, B. Patt-Shamir, D. Peleg, and M. Tuttle. Collaboration of untrusting peers with changing interests. In Proc. 5th ACM Conf. on Electronic Commerce (EC), pages 112--119, May 2004.

Digital Library

[2]

B. Awerbuch, B. Patt-Shamir, D. Peleg, and M. Tuttle. Improved recommendation systems. In Proc. 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1174--1183, January 2005.

Digital Library

[3]

Y. Azar, A. Fiat, A. Karlin, F. McSherry, and J. Saia. Spectral analysis of data. In Proc. 33rd ACM Symp. on Theory of Computing (STOC), pages 619--626, 2001.

Digital Library

[4]

J. F. Canny. Collaborative filtering with privacy. In IEEE Symposium on Security and Privacy, pages 45--57, 2002.

Digital Library

[5]

P. Drineas, I. Kerenidis, and P. Raghavan. Competitive recommendation systems. In Proc. 34th ACM Symp. on Theory oand that the identities of objects form a random permutation off Computing (STOC), pages 82--90, 2002.

Digital Library

[6]

S. A. Goldman, R. L. Rivest, and R. E. Schapire. Learning binary relations and total orders. SIAM J. Computing, 22(5):1006--1034, October 1993.

Digital Library

[7]

J. Kleinberg and M. Sandler. Convergent algorithms for collaborative filtering. In Proc. 4th ACM Conf. on Electronic Commerce (EC), pages 1--10, 2003.

Digital Library

[8]

R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Recommendation systems: A probabilistic analysis. In Proc. IEEE Symp. on Foundations of Computer Science (FOCS), pages 664--673, 1998.

Digital Library

[9]

S. K. Lam and J. Riedl. Shilling recommender systems for fun and profit. In 13th conference on World Wide Web, pages 393--402. ACM Press, 2004.

Digital Library

[10]

R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.

Digital Library

[11]

M. P. OMahony, N. J. Hurley, and G. C. M. Silvestre. Utility-based neighbourhood formation for efficient and robust collaborative filtering. In 5th ACM conference on Electronic Commerce, pages 260--261, 2004.

Digital Library

[12]

P. Resnick, N. Iacovou, M. Suchak, P. Bergstrom, and J. Riedl. Grouplens: an open architecture for collaborative filtering of netnews. In 1994 ACM conference on Computer supported cooperative work, pages 175--186. ACM Press, 1994.

Digital Library

[13]

B. Sarwar, G. Karypis, J. Konstan, and J. Reidl. Item-based collaborative filtering recommendation algorithms. In 10th international conference on World Wide Web, pages 285--295. ACM Press, 2001.

Digital Library

[14]

B. Sarwar, G. Karypis, J. Konstan, and J. Riedl. Analysis of recommendation algorithms for e-commerce. In 2nd ACM conference on Electronic Commerce, pages 158--167. ACM Press, 2000.

Digital Library

[15]

A. I. Schein, A. Popescul, L. H. Ungar, and D. M. Pennock. Methods and metrics for cold-start recommendations. In 25th annual international ACM SIGIR conference on Research and development in information retrieval (SIGIR '02), pages 253--260, 2002.

Digital Library

Cited By

Azar YNisgav APatt-Shamir BMeyer auf der Heide FRajaraman R(2011)Recommender systems with non-binary gradesProceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures10.1145/1989493.1989528(245-252)Online publication date: 4-Jun-2011
https://dl.acm.org/doi/10.1145/1989493.1989528
Li H(2011)A Recommendation System in Cognitive Radio Networks With Random Data TrafficIEEE Transactions on Vehicular Technology10.1109/TVT.2011.211877760:4(1352-1364)Online publication date: May-2011
https://doi.org/10.1109/TVT.2011.2118777
Nisgav APatt-Shamir B(2011)Finding Similar Users in Social NetworksTheory of Computing Systems10.1007/s00224-010-9307-249:4(720-737)Online publication date: 1-Nov-2011
https://dl.acm.org/doi/10.1007/s00224-010-9307-2
Show More Cited By

Index Terms

Collaborate with strangers to find own preferences

Recommendations

Tell Me Who I Am: An Interactive Recommendation System
Special Issue: Symposium on Parallelism in Algorithms and Architectures 2006; Guest Editors: Robert Kleinberg and Christian Scheideler

We consider a model of recommendation systems, where each member from a given set of players has a binary preference to each element in a given set of objects: intuitively, each player either likes or dislikes each object. However, the players do not ...
Tell me who I am: an interactive recommendation system
SPAA '06: Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures

We consider a model of recommendation systems, where each member from a given set of players has a binary preference to each element in a given set of objects: intuitively, each player either likes or dislikes each object. However, the players do not ...
Collaborate with Strangers to Find Own Preferences

We consider a model with n players and m objects. Each player has a “preference vector” of length m, that models his grades for all objects. The grades are initially unknown to the players. A player can learn his grade for an object by probing that ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SPAA '05: Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures

July 2005

346 pages

ISBN:1581139861

DOI:10.1145/1073970

General Chair:
Phil Gibbons
Intel Research
,
Program Chair:
Paul Spirakis
Research and Academic Computer Technology Institute, Greece

Copyright © 2005 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 18 July 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SPAA05

Sponsor:

SPAA05: 17th ACM Symposium on Parallelism in Algorithms and Architectures 2005

July 18 - 20, 2005

Nevada, Las Vegas, USA

Acceptance Rates

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Upcoming Conference

SPAA '25

Sponsor:
sigact
sigact

37th ACM Symposium on Parallelism in Algorithms and Architectures

July 28 - August 1, 2025

Portland , OR , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

18
Total Citations
View Citations
273
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Azar YNisgav APatt-Shamir BMeyer auf der Heide FRajaraman R(2011)Recommender systems with non-binary gradesProceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures10.1145/1989493.1989528(245-252)Online publication date: 4-Jun-2011
https://dl.acm.org/doi/10.1145/1989493.1989528
Li H(2011)A Recommendation System in Cognitive Radio Networks With Random Data TrafficIEEE Transactions on Vehicular Technology10.1109/TVT.2011.211877760:4(1352-1364)Online publication date: May-2011
https://doi.org/10.1109/TVT.2011.2118777
Nisgav APatt-Shamir B(2011)Finding Similar Users in Social NetworksTheory of Computing Systems10.1007/s00224-010-9307-249:4(720-737)Online publication date: 1-Nov-2011
https://dl.acm.org/doi/10.1007/s00224-010-9307-2
Nisgav APatt-Shamir B(2011)Improved collaborative filteringProceedings of the 22nd international conference on Algorithms and Computation10.1007/978-3-642-25591-5_44(425-434)Online publication date: 5-Dec-2011
https://dl.acm.org/doi/10.1007/978-3-642-25591-5_44
Gilbert SGuerraoui RRad FZadimoghaddam Mauf der Heide FPhillips C(2010)Collaborative scoring with dishonest participantsProceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures10.1145/1810479.1810488(41-49)Online publication date: 13-Jun-2010
https://dl.acm.org/doi/10.1145/1810479.1810488
Hémon SLargillier TPeyronnet S(2010)Partial Ranking of Products for Recommendation SystemsE-Commerce and Web Technologies10.1007/978-3-642-15208-5_24(265-277)Online publication date: 2010
https://doi.org/10.1007/978-3-642-15208-5_24
Amira NGiladi RLotker Z(2010)Distributed weighted stable marriage problemProceedings of the 17th international conference on Structural Information and Communication Complexity10.1007/978-3-642-13284-1_4(29-40)Online publication date: 7-Jun-2010
https://dl.acm.org/doi/10.1007/978-3-642-13284-1_4
Nisgav APatt-Shamir BMeyer auf der Heide FBender M(2009)Finding similar users in social networksProceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures10.1145/1583991.1584042(169-177)Online publication date: 11-Aug-2009
https://dl.acm.org/doi/10.1145/1583991.1584042
Yu HShi CKaminsky MGibbons PXiao F(2009)DSybilProceedings of the 2009 30th IEEE Symposium on Security and Privacy10.1109/SP.2009.26(283-298)Online publication date: 17-May-2009
https://dl.acm.org/doi/10.1109/SP.2009.26
Alon NAwerbuch BAzar YPatt-Shamir B(2009)Tell Me Who I Am: An Interactive Recommendation SystemTheory of Computing Systems10.1007/s00224-008-9100-745:2(261-279)Online publication date: 10-Jun-2009
https://dl.acm.org/doi/10.1007/s00224-008-9100-7
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten