MétaCan
Menu
Back to cohort
Record W2923365458 · doi:10.1177/2158244019837468

The Power of None

2019· article· en· W2923365458 on OpenAlexfundno aff
Neal D. Hulkower, John Neatrour

Bibliographic record

VenueSAGE Open · 2019
Typearticle
Languageen
FieldEconomics, Econometrics and Finance
TopicGame Theory and Voting Systems
Canadian institutionsnot available
FundersWilfrid Laurier University
KeywordsVetoVotingAxiomRanking (information retrieval)Computer scienceMathematical economicsMetric (unit)Outcome (game theory)Simple (philosophy)Social choice theoryAction (physics)Weighted votingTheoretical computer scienceMathematicsArtificial intelligenceEconomicsPolitical scienceLawEpistemology

Abstract

fetched live from OpenAlex

Borda with None (BwN) adds the binding option of “None of these candidates,” N, to the Borda Count (BC), differing from a method of Dodgson in the scoring of ties. The method incorporates the benefits of approval voting, which allows a simple yes/no vote on each candidate and avoids the disadvantages of adding N as a binding outcome to plurality voting. We prove that BwN uniquely satisfies five rational properties which can be viewed as potential axioms that provide a theoretical basis for the method. It allows individual voters to express a personal veto over all or part of the slate which could, with sufficient numbers, become a veto by the electorate. The power of none, then, is offering a voice to otherwise disaffected voters. We introduce a metric similar to one used in the Bak–Sneppen Evolutionary model, candidate fitness, a number between 0 and 1, which measures a candidate’s ranking relative to N. We illustrate its evolution with a hypothetical example. We examine courses of action if N is ranked in the first place. Using BwN to accommodate partial voting is proposed. We explore the general applicability of BwN. Finally, we address the practical considerations for introducing BwN.

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 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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesInsufficient payload (model declined to judge)
Consensus categoriesInsufficient payload (model declined to judge)
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.786
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0010.003

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.024
GPT teacher head0.231
Teacher spread0.207 · 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; both teacher heads agree on what is shown here.

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

Citations1
Published2019
Admission routes1
Has abstractyes

Explore more

Same venueSAGE OpenSame topicGame Theory and Voting SystemsFrench-language works237,207