Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Fete of Combinatorics and Computer ScienceNoise Sensitivity and Chaos in Social Choice Theory

Fete of Combinatorics and Computer Science: Noise Sensitivity and Chaos in Social Choice Theory [In this paper we study the social preferences obtained from monotone neutral social welfare functions for random individual preferences. It turns out that there are two extreme types of behavior. On one side, there are social welfare functions, such as the majority rule, that lead to stochastic stability of the outcome in terms of perturbations of individual preferences.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Fete of Combinatorics and Computer ScienceNoise Sensitivity and Chaos in Social Choice Theory

Part of the Bolyai Society Mathematical Studies Book Series (volume 20)
Editors: Katona, Gyula O. H.; Schrijver, Alexander; Szőnyi, Tamás; Sági, Gábor
Kalai, Gil
Fete of Combinatorics and Computer Science — Jan 31, 2011
Download PDF
39 pages

Loading next page...
 
/lp/springer-journals/fete-of-combinatorics-and-computer-science-noise-sensitivity-and-chaos-VNiaLtE7q0
Publisher
Springer Berlin Heidelberg
Copyright
© János Bolyai Mathematical Society and Springer-Verlag 2010
ISBN
978-3-642-13579-8
Pages
173 –212
DOI
10.1007/978-3-642-13580-4_8
Publisher site
See Chapter on Publisher Site

Abstract

[In this paper we study the social preferences obtained from monotone neutral social welfare functions for random individual preferences. It turns out that there are two extreme types of behavior. On one side, there are social welfare functions, such as the majority rule, that lead to stochastic stability of the outcome in terms of perturbations of individual preferences.]

Published: Jan 31, 2011

Keywords: Boolean Function; Social Preference; Vote Rule; Social Welfare Function; Simple Game

There are no references for this article.