MétaCan
Menu
Back to cohort
Record W2402827424 · doi:10.5555/2772879.2773411

Controlling Elections by Replacing Candidates or Votes

2015· article· en· W2402827424 on OpenAlexaff
Andrea Loreggia, Nina Narodytska, Francesca Rossi, Kristen Brent Venable, Toby Walsh

Bibliographic record

VenueResearch Padua Archive (University of Padua) · 2015
Typearticle
Languageen
FieldEconomics, Econometrics and Finance
TopicGame Theory and Voting Systems
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsVetoVotingConstructiveComputer scienceApproval votingControl (management)Computational complexity theoryArtificial intelligencePolitical scienceCondorcet methodAlgorithmLawProgramming language

Abstract

fetched live from OpenAlex

We consider elections where the chair replaces either candidates or votes, with the goal of making a specific candidate win (constructive control) or lose (destructive control). We call this ``replacement control'' and study its computational complexity for several scoring rules (plurality, veto, Borda, k-approval), as well as for approval voting.

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.003
metaresearch head score (Gemma)0.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.383
Threshold uncertainty score0.679

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0030.001
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.0000.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.136
GPT teacher head0.288
Teacher spread0.153 · 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 teacher head, 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

Citations16
Published2015
Admission routes1
Has abstractyes

Explore more

Same venueResearch Padua Archive (University of Padua)Same topicGame Theory and Voting SystemsFrench-language works237,207