MétaCan
Menu
Back to cohort
Record W2127041951 · doi:10.1257/mic.20100029

A Continuous-Time Model of Multilateral Bargaining

2015· article· en· W2127041951 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueAmerican Economic Journal Microeconomics · 2015
Typearticle
Languageen
FieldEconomics, Econometrics and Finance
TopicGame Theory and Voting Systems
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsSubgame perfect equilibriumMathematical economicsLimit (mathematics)Bargaining problemDiscrete time and continuous timeMarkov perfect equilibriumRegular polygonMathematicsNash equilibriumFunction (biology)Mathematical optimizationMarkov chainEconomicsInfinityMathematical analysis

Abstract

fetched live from OpenAlex

We propose a finite-horizon continuous-time framework for coalitional bargaining, in which players can make offers at random discrete times. In our model: (i) expected payoffs in Markov perfect equilibrium (MPE) are unique, generating sharp predictions and facilitating comparative statics; and (ii) MPE are the only subgame perfect Nash equilibria (SPNE) that can be approximated by SPNE of nearby discrete-time bargaining models. We investigate the limit MPE payoffs as the time horizon goes to infinity and players get infinitely patient. In convex games, we establish that the set of these limit payoffs achievable by varying recognition rates is exactly the core of the characteristic function. (JEL C78)

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Insufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.388
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.036
GPT teacher head0.228
Teacher spread0.192 · 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