PORTO @ 
Archivio Istituzionale della Ricerca
IRIS è la soluzione IT che facilita la raccolta e la gestione dei dati relativi alle attività e ai prodotti della ricerca. Fornisce a ricercatori, amministratori e valutatori gli strumenti per monitorare i risultati della ricerca, aumentarne la visibilità e allocare in modo efficace le risorse disponibili.
EnglishWe investigate crowdsourcing algorithms for finding the top-quality item within a large collection of objects with unknown intrinsic quality values. This is an important problem with many relevant applications, such as in networked recommendation systems. The core of the algorithms is that objects are distributed to crowd workers, who return a noisy and biased evaluation. All received evaluations are then combined to identify the top-quality object. We first present a simple probabilistic model for the system under investigation. Then we devise and study a class of efficient adaptive algorithms to assign in an effective way objects to workers. We compare the performance of several algorithms, which correspond to different choices of the design parameters/metrics. In the simulations, we show that some of the algorithms achieve near optimal performance for a suitable setting of the system parameters.
Selecting the Top-Quality Item Through Crowd Scoring / Nordio, Alessandro; Tarable, Alberto; Leonardi, Emilio; AJMONE MARSAN, Marco Giuseppe. - In: ACM TRANSACTIONS ON MODELING AND PERFORMANCE EVALUATION OF COMPUTING SYSTEMS. - ISSN 2376-3639. - ELETTRONICO. - 3:1(2018), pp. 1-26.
| Titolo: | Selecting the Top-Quality Item Through Crowd Scoring |
| Autori: | |
| Data di pubblicazione: | 2018 |
| Rivista: | |
| Digital Object Identifier (DOI): | http://dx.doi.org/10.1145/3157736 |
| Appare nelle tipologie: | 1.1 Articolo in rivista |
File in questo prodotto:
| File | Descrizione | Tipologia | Licenza | |
|---|---|---|---|---|
| TOMPECS3.pdf | 2a Post-print versione editoriale / Version of Record | Non Pubblico - Accesso privato/ristretto | Administrator Richiedi una copia |
http://hdl.handle.net/11583/2707363
Copyright © 2021