Voting: a machine learning approach

DOI10.1016/J.EJOR.2021.10.005MaRDI QIDQ2670537zbMATH OpenOpenAlexFDO

Authors Dávid Burka, László Szepesváry, Attila Tasnádi, Clemens Puppe

Publication date 11 March 2022

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://www.econstor.eu/bitstream/10419/227125/1/1741232007.pdf

zbMATH Keywords

machine learningneural networksvotingsocial choicegroup decisions and negotiationsBorda count

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Social choice (91B14) Voting theory (91B12)

Recommendations

• The learnability of voting rules
• Neural voting machines
• On the learnability of majority rule
• Eliciting a suitable voting rule via examples
• Voting rules as error-correcting codes

Cites work

• scientific article; zbMATH DE number 44383 (Why is no real title available?)
• scientific article; zbMATH DE number 1392848 (Why is no real title available?)
• scientific article; zbMATH DE number 970025 (Why is no real title available?)
• A Consistent Extension of Condorcet’s Election Principle
• A logical calculus of the ideas immanent in nervous activity
• Aggregation of Preferences with Variable Electorate
• Axioms for approval voting: Direct proof
• Deep learning
• Deep learning with long short-term memory networks for financial market predictions
• Distance rationalization of voting rules
• Does avoiding bad voting rules result in good ones?
• Does majoritarian approval matter in selecting a social choice rule? an exploratory panel study
• Handbook of Computational Social Choice
• Handbook of social choice and welfare. Vol. 1.
• Incoherent majorities: the McGarvey problem in judgement aggregation
• Majority judgment vs. majority rule
• Mathematical structure of voting paradoxes. II: Positional voting
• Neural nets in a group decision process
• Neural voting machines
• Social Choice Scoring Functions
• Social choice and individual values
• The Copeland choice function. An axiomatic characterization
• The learnability of voting rules
• Voting schemes for which it can be difficult to tell who won the election
• Why the Count de Borda cannot beat the Marquis de Condorcet

Cited in

(7)

• Forecasting voting behaviour using machine learning -- Poland in transition
• Learning agents for iterative voting
• The learnability of voting rules
• On the learnability of majority rule
• Neural voting machines
• Supermajority politics: equilibrium range, policy diversity, utilitarian welfare, and political compromise
• New voting functions for neural network algorithms

This page was built for publication: Voting: a machine learning approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2670537)