MétaCan
Menu
Back to cohort
Record W3160584640 · doi:10.1016/j.geb.2024.11.001

A recursive measure of voting power that satisfies reasonable postulates

2024· preprint· en· W3160584640 on OpenAlexafffund
Arash Abizadeh, Adrian Vetta

Bibliographic record

VenueGames and Economic Behavior · 2024
Typepreprint
Languageen
FieldEconomics, Econometrics and Finance
TopicGame Theory and Voting Systems
Canadian institutionsMcGill University
FundersSocial Sciences and Humanities Research Council of CanadaNatural Sciences and Engineering Research Council of Canada
KeywordsVotingMeasure (data warehouse)Cardinal voting systemsMathematical economicsApproval votingMathematicsAnti-plurality votingComputer scienceEconometricsPolitical scienceData miningLaw

Abstract

fetched live from OpenAlex

The classical measures of voting power are based on players' decisiveness or full causal efficacy in vote configurations or divisions. We design an alternative, recursive measure departing from this classical approach. We motivate the measure via an axiomatic characterisation based on reasonable axioms and by offering two complementary interpretations of its meaning: first, we interpret the measure to represent, not the player's probability of being decisive in a voting structure, but its expected probability of being decisive in a uniform random walk from a vote configuration in the subset lattice (through which we represent the voting structure); and, second, we interpret it as representing a player's expected efficacy, thereby incorporating the notion of partial and not just full causal efficacy. We shore up our measure by demonstrating that it satisfies a set of postulates any reasonable voting measure should satisfy, namely, the iso-invariance, dummy, dominance, donation, minimum-power bloc, and quarrel postulates.

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.005
metaresearch head score (Gemma)0.022
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.005
Threshold uncertainty score0.029

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0050.022
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.004
Scholarly communication0.0040.007
Open science0.0020.002
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0030.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.038
GPT teacher head0.237
Teacher spread0.199 · 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

Citations1
Published2024
Admission routes2
Has abstractyes

Explore more

Same venueGames and Economic BehaviorSame topicGame Theory and Voting SystemsFrench-language works237,207