Parallel Contests for Crowdsourcing Reviews: Existence and Quality of Equilibria

๐Ÿ“… 2022-02-08
๐Ÿ›๏ธ Conference on Advances in Financial Technologies
๐Ÿ“ˆ Citations: 4
โœจ Influential: 0
๐Ÿ“„ PDF
๐Ÿค– AI Summary
This paper addresses the design of decentralized review mechanisms for parallel crowdfunding proposals in blockchain environments, focusing on incentivizing reviewers to autonomously select proposals while balancing review quality and coverage. We propose a game-theoretic model of reviewer behavior, capturing strategic decisions regarding proposal selection and review quality (e.g., โ€œexcellentโ€ or โ€œgoodโ€). Our key contribution is the first proof that, under a simple reward mechanism, a pure Nash equilibrium always exists; moreover, every such equilibrium guarantees that both total review quality and the fraction of reviewed proposals achieve at least a 1/2-approximation of their respective global optima. This result holds in two representative scenarios, establishing a theoretically rigorous and practically implementable foundation for decentralized, incentive-aligned proposal review.
๐Ÿ“ Abstract
Part of the design of many blockchains and cryptocurrencies includes a treasury, which periodically allocates collected funds to various projects that could be beneficial to their ecosystem. These projects are then voted on and selected by the users of the respective cryptocurrency. To better inform the users' choices, the proposals can be reviewed, in distributed fashion. Motivated by these intricacies, we study the problem of crowdsourcing reviews for 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 (since the review of the reviews has to be robust enough, even though it is also crowdsourced) 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 consider a simple and intuitive reward scheme and show that it always has pure Nash equilibria, under two different scenarios. 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.
Problem

Research questions and friction points this paper is trying to address.

Designing reward schemes for parallel crowdsourced proposal reviews
Ensuring existence of pure Nash equilibria in review allocation
Guaranteeing quality and coverage metrics in equilibrium outcomes
Innovation

Methods, ideas, or system contributions that make the work stand out.

Designs reward scheme for parallel review crowdsourcing
Ensures pure Nash equilibria exist universally
Guarantees constant factor approximation metrics
Georgios Birmpas
Georgios Birmpas
University of Liverpool
Algorithmic Game Theory
L
L. Kovalchuk
National Technical University of Ukraine โ€œIgor Sikorsky Kyiv Polytechnic Institute
Philip Lazos
Philip Lazos
Jump Trading
R
R. Oliynykov
V.N.Karazin Kharkiv National University, IOHK