Neural networks would 'vote' according to Borda's rule
Can neural networks learn to select an alternative based on a systematic aggregation of conflicting individual preferences (i.e. a 'voting rule')? And if so, which voting rule best describes their behavior? We show that a prominent neural network can be trained to respect two fundamental principles of voting theory, the unanimity principle and the Pareto property. Building on this positive result, we train the neural network on profiles of ballots possessing a Condorcet winner, a unique Borda winner, and a unique plurality winner, respectively. We investigate which social outcome the trained neural network chooses, and find that among a number of popular voting rules its behavior mimics most closely the Borda rule. Indeed, the neural network chooses the Borda winner most often, no matter on which voting rule it was trained. Neural networks thus seem to give a surprisingly clear-cut answer to one of the most fundamental and controversial problems in voting theory: the determination of the most salient election method.
|Date of creation:||2016|
|Contact details of provider:|| Web page: http://www.wiwi.kit.edu/|
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Edith Elkind & Piotr Faliszewski & Arkadii Slinko, 2015. "Distance rationalization of voting rules," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 45(2), pages 345-377, September.
- Nehring, Klaus & Pivato, Marcus, 2013. "Majority rule in the absence of a majority," MPRA Paper 46721, University Library of Munich, Germany.
- Mathias Risse, 2005. "Why the count de Borda cannot beat the Marquis de Condorcet," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 25(1), pages 95-113, October.
- Ayça Giritligil Kara & Murat Sertel, 2005. "Does majoritarian approval matter in selecting a social choice rule? An exploratory panel study," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 25(1), pages 43-73, October.
- Smith, John H, 1973. "Aggregation of Preferences with Variable Electorate," Econometrica, Econometric Society, vol. 41(6), pages 1027-1041, November.
- Young, H. P., 1974. "An axiomatization of Borda's rule," Journal of Economic Theory, Elsevier, vol. 9(1), pages 43-52, September.
- Fishburn, Peter C., 1978. "Axioms for approval voting: Direct proof," Journal of Economic Theory, Elsevier, vol. 19(1), pages 180-185, October.
- Sgroi, Daniel & Zizzo, Daniel John, 2009. "Learning to play 3×3 games: Neural networks as bounded-rational players," Journal of Economic Behavior & Organization, Elsevier, vol. 69(1), pages 27-38, January.
When requesting a correction, please mention this item's handle: RePEc:zbw:kitwps:96. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (ZBW - German National Library of Economics)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.