MétaCan
Menu
Back to cohort
Record W3122412362

Voting on Multiple Issues: What to Put on the Ballot?

2018· preprint· en· W3122412362 on OpenAlexaff
Alex Gershkov, Benny Moldovanu, Xianwen Shi

Bibliographic record

VenueePrints Soton (University of Southampton) · 2018
Typepreprint
Languageen
FieldEconomics, Econometrics and Finance
TopicGame Theory and Voting Systems
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsVotingCardinal voting systemsAnti-plurality votingDimension (graph theory)Mathematical economicsBullet votingIncentiveEuclidean geometryDistribution (mathematics)Simple (philosophy)Euclidean distanceMathematicsEconometricsEconomicsComputer scienceMicroeconomicsCombinatoricsPolitical scienceArtificial intelligence
DOInot available

Abstract

fetched live from OpenAlex

We study a multi-dimensional collective decision problem under incomplete information. Agents have Euclidean preferences and vote by simple majority on each issue (dimension), yielding the coordinate-wise median. Judicious rotations of the orthogonal axes -- the issues that are voted upon -- lead to welfare improvements. If the agents' types are drawn from a distribution with independent marginals then, under weak conditions, voting on the original issues is not optimal. If the marginals are identical (but not necessarily independent), then voting first on the total sum and next on the differences is often welfare superior to voting on the original issues. We also provide various lower bounds on incentive efficiency: in particular, if agents' types are drawn from a log-concave density with I.I.D. marginals, a second-best voting mechanism attains at least 88% of the first-best efficiency. Finally, we generalize our method and some of our insights to preferences derived from distance functions based on inner products.

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.008
metaresearch head score (Gemma)0.028
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.015
Threshold uncertainty score0.050

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0080.028
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0010.002
Science and technology studies0.0020.003
Scholarly communication0.0040.008
Open science0.0020.003
Research integrity0.0030.003
Insufficient payload (model declined to judge)0.0150.002

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.062
GPT teacher head0.222
Teacher spread0.159 · 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
Published2018
Admission routes1
Has abstractyes

Explore more

Same venueePrints Soton (University of Southampton)Same topicGame Theory and Voting SystemsFrench-language works237,207