Opportunity-Cost-Driven Reward Mechanisms for Crowd-Sourced Computing Platforms
Bibliographic record
Abstract
This paper introduces a game-theoretic model tailored for reward distribution on crowd-sourced computing platforms. It explores a repeated game framework where miners, as computation providers, decide their computation power contribution in each round, guided by the platform’s designed reward distribution mechanism. The reward for each miner in every round is based on the platform’s randomized task payments and the miners’ computation transcripts. Specifically, it defines Opportunity-Cost-Driven Incentive Compatibility (OCD-IC) and Dynamic OCD-IC (DOCD-IC) for scenarios where strategic miners might allocate some computation power to more profitable activities, such as Bitcoin mining. The platform must also achieve Budget Balance (BB), aiming for a non-negative total income over the long term. This paper demonstrates that traditional Pay-Per-Share (PPS) reward schemes require assumptions about task demand and miners’ opportunity costs to ensure OCD-IC and BB, yet they fail to satisfy DOCD-IC. The paper then introduces Pay-Per-Share with Subsidy (PPSS), a new reward mechanism that allows the platform to provide subsidies to miners, thus eliminating the need for assumptions on opportunity cost to achieve OCD-IC, DOCD-IC, and long-term BB.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.004 | 0.013 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.003 | 0.004 |
| Open science | 0.003 | 0.003 |
| Research integrity | 0.002 | 0.003 |
| Insufficient payload (model declined to judge) | 0.008 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".