TY - JOUR

T1 - Collaborate with strangers to find own preferences

AU - Awerbuch, Baruch

AU - Azar, Yossi

AU - Lotker, Zvi

AU - Patt-Shamir, Boaz

AU - Tuttle, Mark R.

N1 - Funding Information:
An extended abstract of this work appeared in the 17th Ann. ACM Symp. on Parallelism in Algorithms and Architecture, Las Vegas, Nevada, July 2005. Research of B. Awerbuch supported by NSF grant ANIR-0240551 and NSF grant CCR-0311795. Research of Y. Azar supported in part by the German-Israeli Foundation and by the Israel Science Foundation. Research of B. Patt-Shamir supported in part by Israel Ministry of Science and Technology and by the Israel Science Foundation.

PY - 2008/1

Y1 - 2008/1

N2 - 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 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 a sequential and a parallel algorithm to solve the problem with logarithmic cost overhead.

AB - 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 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 a sequential and a parallel algorithm to solve the problem with logarithmic cost overhead.

UR - http://www.scopus.com/inward/record.url?scp=37249009119&partnerID=8YFLogxK

U2 - 10.1007/s00224-007-9016-7

DO - 10.1007/s00224-007-9016-7

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:37249009119

VL - 42

SP - 27

EP - 41

JO - Theory of Computing Systems

JF - Theory of Computing Systems

SN - 1432-4350

IS - 1

ER -