Collaborate with strangers to find own preferences

Baruch Awerbuch*, Yossi Azar, Zvi Lotker, Boaz Patt-Shamir, Mark R. Tuttle

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)27-41
Number of pages15
JournalTheory of Computing Systems
Volume42
Issue number1
DOIs
StatePublished - Jan 2008

Funding

FundersFunder number
Israel Ministry of Science and Technology
National Science FoundationANIR-0240551, CCR-0311795
German-Israeli Foundation for Scientific Research and Development
Israel Science Foundation

    Fingerprint

    Dive into the research topics of 'Collaborate with strangers to find own preferences'. Together they form a unique fingerprint.

    Cite this