MétaCan
Menu
Back to cohort
Record W7124132508 · doi:10.65109/lvmh6964

Improving the efficiency of crowdsourcing contests

2014· article· W7124132508 on OpenAlexaff

Bibliographic record

Venuenot available
Typearticle
Language
FieldComputer Science
TopicMobile Crowdsensing and Crowdsourcing
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsCrowdsourcingIncentiveMechanism designMechanism (biology)Set (abstract data type)Production (economics)

Abstract

fetched live from OpenAlex

While winner-take-all crowdsourcing contests are wide spread in practice, several researchers have observed that their social welfare can be poor due to effort exerted by contestants who are never rewarded. In this paper we study the problem of efficiency in winner-take-all crowdsourcing contests. Using a discrete choice model to capture contestants' production qualities, we introduce a mechanism which filters out low-expertise contestants, before they are asked to produce a solution. We show that under a set of natural assumptions, such a mechanism has desirable incentive properties, attracts high-quality contestants and can improve social welfare. We also provide insights into the problem of prize setting for such contests.

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 distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.004
metaresearch head score (Gemma)0.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.910
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0040.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0010.001
Scholarly communication0.0010.000
Open science0.0020.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.000

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.

Opus teacher head0.009
GPT teacher head0.210
Teacher spread0.200 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations0
Published2014
Admission routes1
Has abstractyes

Explore more

Same topicMobile Crowdsensing and CrowdsourcingFrench-language works237,207