Parallel Contests for Crowdsourcing Reviews: Existence and Quality of Equilibria
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2022
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913825744224256 |
|---|---|
| author | Birmpas, Georgios Kovalchuk, Lyudmila Lazos, Philip Oliynykov, Roman |
| author_facet | Birmpas, Georgios Kovalchuk, Lyudmila Lazos, Philip Oliynykov, Roman |
| contents | Motivated by the intricacies of allocating treasury funds in blockchain settings, we study the problem of crowdsourcing reviews for many different proposals, in parallel. During the reviewing phase, every reviewer can select the proposals to write reviews for, as well as the quality of each review. The quality levels follow certain very coarse community guidelines and can have values such as 'excellent' or 'good'. Based on these scores and the distribution of reviews, every reviewer will receive some reward for their efforts. In this paper, we design a reward scheme and show that it always has pure Nash equilibria, for any set of proposals and reviewers. In addition, we show that these equilibria guarantee constant factor approximations for two natural metrics: the total quality of all reviews, as well as the fraction of proposals that received at least one review, compared to the optimal outcome. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2202_04064 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Parallel Contests for Crowdsourcing Reviews: Existence and Quality of Equilibria Birmpas, Georgios Kovalchuk, Lyudmila Lazos, Philip Oliynykov, Roman Computer Science and Game Theory Motivated by the intricacies of allocating treasury funds in blockchain settings, we study the problem of crowdsourcing reviews for many different proposals, in parallel. During the reviewing phase, every reviewer can select the proposals to write reviews for, as well as the quality of each review. The quality levels follow certain very coarse community guidelines and can have values such as 'excellent' or 'good'. Based on these scores and the distribution of reviews, every reviewer will receive some reward for their efforts. In this paper, we design a reward scheme and show that it always has pure Nash equilibria, for any set of proposals and reviewers. In addition, we show that these equilibria guarantee constant factor approximations for two natural metrics: the total quality of all reviews, as well as the fraction of proposals that received at least one review, compared to the optimal outcome. |
| title | Parallel Contests for Crowdsourcing Reviews: Existence and Quality of Equilibria |
| topic | Computer Science and Game Theory |
| url | https://arxiv.org/abs/2202.04064 |