MétaCan
Menu
Back to cohort
Record W6891292394 · doi:10.3886/e192024v2

Efficiency and Equilibrium Selection in an Allocation Problem

2023· dataset· en· W6891292394 on OpenAlexaff

Bibliographic record

VenueICPSR Data Holdings · 2023
Typedataset
Languageen
Field
Topic
Canadian institutionsMcGill University
Fundersnot available
KeywordsArbiterStochastic gameIncentiveSet (abstract data type)Selection (genetic algorithm)Comparative staticsBidding

Abstract

fetched live from OpenAlex

We study two variants of an allocation problem where two parties lay proportional claims to an asset, and an arbiter has a final say on allocation. The two variants we study vary by the incentives to the arbiter. In one variant, the arbiter is incentivized proportional to the payoff to the lowest paid claimant and in the other, the arbiter is incentivized proportional to the payoff to the highest paid claimant. While neither incentive scheme changes the set of equilibria, they alter expected payoff in off-equilibrium outcomes, with implications for equilibrium selection. Accordingly, the first variant leads to egalitarian claims whereas the second leads to claims of the entire pot, and subsequently to high incidence of impasse. A level-k model of bounded rationality fits the observed outcomes. Thus, in bargaining with multiple equilibria, the level-k model is useful in designing arbiter incentives to maximize efficiency.

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 imitation

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

metaresearch head score (Codex)0.012
metaresearch head score (Gemma)0.039
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Dataset · Consensus signal: none
Teacher disagreement score0.022
Threshold uncertainty score0.073

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0120.039
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0010.002
Science and technology studies0.0010.002
Scholarly communication0.0040.005
Open science0.0030.002
Research integrity0.0030.003
Insufficient payload (model declined to judge)0.0220.003

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.063
GPT teacher head0.335
Teacher spread0.272 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreDataset

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
Published2023
Admission routes1
Has abstractyes

Explore more

Same venueICPSR Data HoldingsFrench-language works237,207