Return to search

Neural Voting Machines

“Winner-take-all” networks typically pick as winners that alternative with the largest excitatory input. This choice is far from optimal when there is uncertainty in the strength of the inputs, and when information is available about how alternatives may be related. In the Social Choice community, many other procedures will yield more robust winners. The Borda Count and the pair-wise Condorcet tally are among the most favored. Their implementations are simple modifications of classical recurrent networks.

Identiferoai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/30513
Date31 December 2004
CreatorsRichards, Whitman, Seung, H. Sebastian
Source SetsM.I.T. Theses and Dissertation
Languageen_US
Detected LanguageEnglish
Format12 p., 13714512 bytes, 523751 bytes, application/postscript, application/pdf
RelationMassachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory

Page generated in 0.0015 seconds