MétaCan
Menu
Back to cohort
Record W2103285137

Robust Virtual Implementation with Incomplete Information: Towards a Reinterpretation of the Wilson Doctrine

2007· preprint· en· W2103285137 on OpenAlexaff
Georgy Artemov, Takashi Kunimoto, Roberto Serrano

Bibliographic record

Venuenot available
Typepreprint
Languageen
FieldDecision Sciences
TopicAuction Theory and Applications
Canadian institutionsMcGill University
Fundersnot available
KeywordsReinterpretationIncentive compatibilityComputer scienceInterimMathematical economicsDoctrineRobustness (evolution)IncentiveSocial choice theoryPrivate information retrievalMathematical optimizationMicroeconomicsEconomicsMathematicsComputer securityLawPolitical science
DOInot available

Abstract

fetched live from OpenAlex

We consider robust virtual implementation, where robustness is the requirement that implementation succeed in all type spaces consistent with a given payoff type space as well as with a given space of first-order beliefs about the other agents\' payoff types. This last bit, which constitutes our reinterpretation of the Wilson doctrine, allows us to obtain very permissive results. Our first result is that generically, if there are at least three alternatives, any incentive compatible social choice function is robustly virtually implementable in iteratively undominated strategies. Further, we characterize robust virtual implementation in iteratively undominated strategies by means of incentive compatibility and measurability. Our characterization is independent of the presence of monetary transfers or assumptions alike, made in previous studies. Our work also clarifies the measurability condition in connection to the generic diversity of preferences used in our first result.

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.013
metaresearch head score (Gemma)0.032
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.013
Threshold uncertainty score0.068

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0130.032
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.002
Bibliometrics0.0010.001
Science and technology studies0.0010.013
Scholarly communication0.0050.010
Open science0.0030.007
Research integrity0.0030.006
Insufficient payload (model declined to judge)0.0020.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.109
GPT teacher head0.396
Teacher spread0.287 · 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

Citations23
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicAuction Theory and ApplicationsFrench-language works237,207