Improving Judgment Reliability in Social Networks via Jury Theorems

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Opinion aggregators—such as ‘like’ or ‘retweet’ counters—are ubiquitous on social media platforms and often treated as implicit quality evaluations of the entry liked or retweeted, with higher counts indicating higher quality. Many such aggregators are poor quality evaluators as they allow disruptions of the conditions for positive wisdom-of-the-crowds effects. This paper proposes a design of theoretically justified aggregators that improve judgment reliability. Interpreting states of diffusion processes on social networks as implicit voting scenarios, we specify procedures for isolating sets of independent voters in order to use jury theorems to quantify the reliability of network states as quality evaluators. As real-world networks tend to grow very large and independence tests are computationally expensive, a primary goal is to limit the number of such tests. We consider five procedures, each trading a degree of reliability for efficiency, the most efficient requiring a low-degree polynomial number of tests.

Cite

CITATION STYLE

APA

Galeazzi, P., Rendsvig, R. K., & Slavkovik, M. (2019). Improving Judgment Reliability in Social Networks via Jury Theorems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11813 LNCS, pp. 230–243). Springer. https://doi.org/10.1007/978-3-662-60292-8_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free