MétaCan
Menu
Back to cohort
Record W2266097679 · doi:10.1515/bejte-2014-0017

Dynamic Information Revelation in Cheap Talk

2015· article· en· W2266097679 on OpenAlexaff
Maxim Ivanov

Bibliographic record

VenueThe B E Journal of Theoretical Economics · 2015
Typearticle
Languageen
FieldDecision Sciences
TopicGame Theory and Applications
Canadian institutionsMcMaster University
Fundersnot available
KeywordsCommunication sourceSequence (biology)Computer scienceOutcome (game theory)Cheap talkSobel operatorStochastic gameMonotonic functionState (computer science)Test (biology)Binary numberUpper and lower boundsState spacePrivate information retrievalMathematicsAlgorithmStatisticsMathematical economicsArtificial intelligenceComputer securityArithmeticTelecommunications

Abstract

fetched live from OpenAlex

Abstract This paper studies a multi-stage version of Crawford and Sobel’s communication game. In every period the receiver determines a test about the unknown state whose result is privately observed by the sender. After the sender sends a costless message about an outcome of the test, the receiver selects a test in the next period. After a finite number of periods of interaction, the receiver makes a decision. The paper offers a sequence of tests that refine sender’s information step-by-step and preserve truthtelling in every period. This sequence allows the receiver to learn the state in a subinterval of the state space with an arbitrary precision and has appealing theoretical properties. It consists of simple binary tests which reveal whether the state is above a certain cutoff, where the cutoffs are monotonic across periods and independent from results of the previous tests. Finally, we show that the relative payoff efficiency of multi-stage interaction compared to a single-stage game increases without a bound as the bias in preferences tends to zero.

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.011
metaresearch head score (Gemma)0.031
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: Empirical
Teacher disagreement score0.011
Threshold uncertainty score0.056

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0110.031
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0010.001
Science and technology studies0.0010.004
Scholarly communication0.0030.004
Open science0.0020.003
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0060.000

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.050
GPT teacher head0.339
Teacher spread0.289 · 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

Citations17
Published2015
Admission routes1
Has abstractyes

Explore more

Same venueThe B E Journal of Theoretical EconomicsSame topicGame Theory and ApplicationsFrench-language works237,207