MétaCan
Menu
Back to cohort
Record W3124855561 · doi:10.5445/ir/1000037498

The Condorcet set: majority voting over interconnected propositions

2013· preprint· en· W3124855561 on OpenAlexaff
Klaus Nehring, Marcus Pivato, Clemens Puppe

Bibliographic record

VenueRepository KITopen (Karlsruhe Institute of Technology) · 2013
Typepreprint
Languageen
FieldEconomics, Econometrics and Finance
TopicGame Theory and Voting Systems
Canadian institutionsTrent University
Fundersnot available
KeywordsCondorcet methodSocial choice theoryJudgementSet (abstract data type)Mathematical economicsVotingMajority ruleApproval votingMathematicsSimple (philosophy)Space (punctuation)Computer scienceArtificial intelligenceEpistemologyPolitical scienceLaw

Abstract

fetched live from OpenAlex

Judgement aggregation is a model of social choice in which the space of social alternatives is the set of consistent evaluations (‘views’) on a family of logically interconnected propositions, or yes/no issues. However, simply complying with the majority opinion in each issue often yields a logically inconsistent collective view. Thus, we consider the Condorcet set: the set of logically consistent views which agree with the majority on a maximal subset of issues. The elements of this set turn out to be exactly those that can be obtained through sequential majority voting, according to which issues are sequentially decided by simple majority unless earlier choices logically force the opposite decision. We investigate the size and structure of the Condorcet set for several important classes of judgement aggregation problems. While the Condorcet set verifies a version of McKelvey's (1979) celebrated ‘chaos theorem’ in a number of contexts, in others it is shown to be very regular and well-behaved.

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.051
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.011
Threshold uncertainty score0.060

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0110.051
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.002
Bibliometrics0.0030.004
Science and technology studies0.0040.009
Scholarly communication0.0080.013
Open science0.0030.006
Research integrity0.0030.004
Insufficient payload (model declined to judge)0.0050.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.026
GPT teacher head0.242
Teacher spread0.217 · 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
Published2013
Admission routes1
Has abstractyes

Explore more

Same venueRepository KITopen (Karlsruhe Institute of Technology)Same topicGame Theory and Voting SystemsFrench-language works237,207