Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On asymptotic strategy-proofness of classical social choice rules

From MaRDI portal
Publication:1863937
Jump to:navigation, search

DOI10.1023/A:1020240214900zbMath1036.91009OpenAlexW1526942341MaRDI QIDQ1863937

Arkadii M. Slinko

Publication date: 12 March 2003

Published in: Theory and Decision (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1020240214900

zbMATH Keywords

manipulabilityscoring ruleasymptotic strategy-proofnessmajority relation


Mathematics Subject Classification ID

Social choice (91B14)


Related Items

How large should a coalition be to manipulate an election?, Minimal manipulability: anonymity and unanimity, Exact results on manipulability of positional voting rules, Minimal manipulability: unanimity and nondictatorship, Some further results on the manipulability of social choice rules, On the likelihood of single-peaked preferences, Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey, Unnamed Item, Truth-revealing voting rules for large populations, Control complexity in Bucklin and fallback voting: an experimental analysis, How the size of a coalition affects its chances to influence an election, Minimally manipulable anonymous social choice functions



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1863937&oldid=14265696"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 12:47.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki