Neural voting machines

DOI10.1016/J.NEUNET.2006.06.006zbMATH Open1103.68818OpenAlexW1978891081WikidataQ45954763 ScholiaQ45954763MaRDI QIDQ853291FDOQ853291

Authors: Whitman Richards, H. Sebastian Seung, Galen Pickard 

Publication date: 15 November 2006

Published in: Neural Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.neunet.2006.06.006

Recommendations

• Voting: a machine learning approach
• Voting procedures, complexity of
• A basis function approach to programming concurrent voting systems to perform selection tasks
• On a constant-time, low-complexity winner-take-all neural network
• Ranking-based voting revisited: maximum entropy approach leads to Borda count (and its versions)

zbMATH Keywords

social networksdecision-makinginformation aggregationneuroeconomicsdomain knowledgeborda countcondorcet votingWinner-take-all

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Social choice and individual values
• Geometry of voting
• Parallel concepts in graph theory
• A comparison of Dodgson's method and the Borda count
• The probability of collective choice with shared knowledge structures
• The Dodgson ranking and the Borda count: a binary comparison

Cited In (3)

• Improved lattice-based mix-nets for electronic voting
• Voting: a machine learning approach
• A basis function approach to programming concurrent voting systems to perform selection tasks

This page was built for publication: Neural voting machines

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