MétaCan
Menu
Back to cohort
Record W2803387754

Robust design in monotonic matching markets : a case for firm-proposing deferred-acceptance

2018· article· en· W2803387754 on OpenAlexfundno aff
Lars Holger Ehlers

Bibliographic record

VenueDipòsit Digital de Documents de la UAB (Universitat Autònoma de Barcelona) · 2018
Typearticle
Languageen
FieldEconomics, Econometrics and Finance
TopicGame Theory and Voting Systems
Canadian institutionsnot available
FundersSocial Sciences and Humanities Research Council of CanadaUniversité de MontréalMinisterio de Economía y CompetitividadGeneralitat de Catalunya
KeywordsIncentive compatibilityIncentiveMatching (statistics)Private information retrievalBusinessMonotonic functionEx-anteMicroeconomicsCompatibility (geochemistry)Industrial organizationEconomicsComputer scienceComputer security
DOInot available

Abstract

fetched live from OpenAlex

We study two-sided matching markets among workers and firms. Workers seek one position at a firm but firms may employ several workers. In many applications those markets are monotonic: leaving positions unfilled is costly as for instance, for hospitals this means not being able to provide full service to its patients. A huge literature has advocated the use of stable mechanisms for clearinghouses. The interests among workers and firms are polarized among stable mechanisms, most famously the firm-proposing DA and the worker-proposing DA. We show that for the firmproposing DA ex-ante incentive compatibility and ex-post incentive compatibility are equivalent whereas this is not necessarily true for the worker-proposing DA. The firm-proposing DA turns out to be more robust than the worker-proposing DA under incomplete information when incentives of both sides of the market are important.

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.026
metaresearch head score (Gemma)0.090
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: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.026
Threshold uncertainty score0.135

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0260.090
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0030.002
Bibliometrics0.0010.001
Science and technology studies0.0010.004
Scholarly communication0.0040.006
Open science0.0050.003
Research integrity0.0050.005
Insufficient payload (model declined to judge)0.0110.002

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.027
GPT teacher head0.236
Teacher spread0.209 · 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

Citations0
Published2018
Admission routes1
Has abstractyes

Explore more

Same venueDipòsit Digital de Documents de la UAB (Universitat Autònoma de Barcelona)Same topicGame Theory and Voting SystemsFrench-language works237,207