MétaCan
Menu
Back to cohort
Record W4393335276 · doi:10.1287/mnsc.2022.00893

On Statistical Discrimination as a Failure of Social Learning: A Multiarmed Bandit Approach

2024· article· en· W4393335276 on OpenAlexaboutno aff
Junpei Komiyama, Shunya Noda

Bibliographic record

VenueManagement Science · 2024
Typearticle
Languageen
FieldDecision Sciences
TopicAdvanced Bandit Algorithms Research
Canadian institutionsnot available
Fundersnot available
KeywordsArtificial intelligenceComputer scienceSocial learningStatistical learningMachine learningKnowledge management

Abstract

fetched live from OpenAlex

We analyze statistical discrimination in hiring markets using a multiarmed bandit model. Myopic firms face workers arriving with heterogeneous observable characteristics. The association between the worker’s skill and characteristics is unknown ex ante; thus, firms need to learn it. Laissez-faire causes perpetual underestimation: minority workers are rarely hired, and therefore, the underestimation tends to persist. Even a marginal imbalance in the population ratio frequently results in perpetual underestimation. We demonstrate that a subsidy rule that is implemented as temporary affirmative action effectively alleviates discrimination stemming from insufficient data. This paper was accepted by Nicolas Stier-Moses, Special Issue on the Human-Algorithm Connection. Funding: This work was supported by the Social Sciences and Humanities Research Council of Canada [Grant 430-2020-00088] and JST ERATO [Grant JPMJER2301], Japan. Supplemental Material: The online appendix and data files are available at https://doi.org/10.1287/mnsc.2022.00893 .

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.017
metaresearch head score (Gemma)0.056
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.017
Threshold uncertainty score0.090

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0170.056
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0030.002
Bibliometrics0.0020.001
Science and technology studies0.0010.005
Scholarly communication0.0030.004
Open science0.0030.003
Research integrity0.0040.004
Insufficient payload (model declined to judge)0.0070.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.

Opus teacher head0.069
GPT teacher head0.447
Teacher spread0.377 · 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 designTheoretical or conceptual
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

Citations8
Published2024
Admission routes1
Has abstractyes

Explore more

Same venueManagement ScienceSame topicAdvanced Bandit Algorithms ResearchFrench-language works237,207