Design and evaluation of an adaptive incentive mechanism for sustained educational online communities
Bibliographic record
Abstract
Most online communities, such as discussion forums, file-sharing communities, e-learning communities, and others, suffer from insufficient user participation in their initial phase of development. Therefore, it is important to provide incentives to encourage participation, until the community reaches a critical mass and “takes off”. However, too much participation, especially of low-quality can also be detrimental for the community, since it leads to information overload, which makes users leave the community. Therefore, to regulate the quality and the quantity of user contributions and ensure a sustainable level of user participation in the online community, it is important to adapt the rewards for particular forms of participation for individual users depending on their reputation and the current needs of the community. An incentive mechanism with these properties is proposed. The main idea is to measure and reward the desirable user activities and compute a user participation measure, then cluster the users based on their participation measure into different classes, which have different status in the community and enjoy special privileges. For each user, the reward for each type of activity is computed dynamically based on a model of community needs and an individual user model. The model of the community needs predicts what types of contributions (e.g. more new papers or more ratings) are most valuable at the current moment for the community. The individual model predicts the style of contributions of the user based on her past performance (whether the user tends to make high-quality contributions or not, whether she fairly rates the contributions of others). The adaptive rewards are displayed to the user at the beginning of each session and the user can decide what form of contribution to make considering the rewards that she will earn. The mechanism was evaluated in an online class resource-sharing system, Comtella. The results indicate that the mechanism successfully encourages stable and active user participation; it lowers the level of information overload and therefore enhances the sustainability of the community.
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.011 | 0.025 |
| 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.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.005 | 0.003 |
| Research integrity | 0.003 | 0.002 |
| Insufficient payload (model declined to judge) | 0.005 | 0.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.
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".