Bibliographic record
Abstract
When individuals trade with strangers, there is a temptation to renege on agreements. If repeated interaction or exogenous enforcement is unavailable, societies often solve this problem via institutions that rely on group, rather than individual, reputation. Groups can employ two mechanisms to uphold reputation that are unavailable to individuals: information sharing and in-group punishment. We design a laboratory experiment to distinguish the roles of these mechanisms when individual reputations are unobservable. Subjects are split into groups and play a trust game with random re-matching, where only the group identity of one’s partner is known. Treatments differ by whether information about group members’ transactions is shared and whether in-group punishment is possible. We find that information sharing encourages path dependence via group reputation: good (bad) behavior results in greater (fewer) gains from exchange in the future. However, the mere threat of in-group punishment is enough to discourage bad behavior. (JEL C9, D02, D7)
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.006 | 0.034 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.002 | 0.003 |
| Scholarly communication | 0.004 | 0.005 |
| Open science | 0.001 | 0.005 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.014 | 0.004 |
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".