Skip to main content
Top
Published in: Social Choice and Welfare 1/2015

01-01-2015

Bounded response and the equivalence of nonmanipulability and independence of irrelevant alternatives

Author: Shin Sato

Published in: Social Choice and Welfare | Issue 1/2015

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

A social welfare function satisfies Bounded Response if the smallest change in the variable (i.e., preference profile) leads to the smallest change, if any, in the value (i.e., social preference). We show that each social welfare function on each connected domain satisfies Bounded Response and a nonmanipulability condition if and only if it satisfies a monotonicity condition and independence of irrelevant alternatives. Moreover, under Bounded Response, we show the equivalence of various notions of nonmanipulability of social welfare functions.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Footnotes
1
See, for example, Young (1995) for arguments supporting IIA.
 
2
See Barberà, (2010) for a survey. The Gibbard–Satterthwaite theorem (Gibbard 1973; Satterthwaite 1975) is the seminal result.
 
3
Let \(f\) be a social welfare function and \(X\) a set of all alternatives. For each preference profile \(\varvec{R}\) and each set \(A\subset X\), let \(F(\varvec{R}, A)\) be the first ranked alternative in \(A\) according to \(f(\varvec{R})\). Then, \(F(\cdot , A)\) is a social choice function on \(A\), and we say that \(F(\cdot , A)\) is derived from \(f\).
 
4
Blair and Muller (1983)’s theorem involves other properties as well. We borrow this simpler version from Moulin (1988).
 
5
Bossert and Storcken (1992) assume that the number of alternatives is at least \(4\). Additional properties are nonimposition and weak extrema independence for even number of agents, and nonimposition and extrema independence for any number of agents.
 
6
A binary relation \(T\) on \(X\) is a subset of \(X\times X\). For each pair \(x, y\in X\), we write \(x~T~y\) for \((x, y)\in T\). A binary relation \(T\) is complete if for each pair \(x, y\in X\), either \(x~T~y\) or \(y~T~x\), transitive if for each triple \(x, y, z\in X\), [\(x~T~y\) and \(y~T~z\)] imply \(x~T~z\), antisymmetric if for each pair \(x, y\in X\), [\(x~T~y\) and \(y~T~x\)] imply \(x = y\). A binary relation is called a linear order if it is complete, transitive, and antisymmetric.
 
7
See footnote 3 for the definition of derived social choice functions.
 
8
Sato (2013) shows that on a connected domain, each social choice function is strategy-proof if and only if it is nonmanipulable by preferences which are adjacent to the true preference.
 
9
\(f\) is Agreement Manipulable because \(f(R_i^3, \varvec{R}_{-i})\) agrees more with \(R_i^1\) than \(f(R_i^1, \varvec{R}_{-i})\). To see Adjacency-restricted Agreement Nonmanipulability, consider the case \(R_i =R_i^1\). In \(\mathcal {D}\), only \(R_i^2\) is adjacent to \(R_i\). Because \((y, z) \in ( f(R_i^1, \varvec{R}_{-i})\cap R_i^1)\) and \((y, z)\not \in (f(R_i^2, \varvec{R}_{-i})\cap R_i^1)\), \(( f(R_i^1, \varvec{R}_{-i})\cap R_i^1) \subsetneq (f(R_i^2, \varvec{R}_{-i})\cap R_i^1)\) does not hold. Similar arguments hold in the other cases \(R_i =R_i^2\) or \(R_i = R_i^3\). Thus, \(f\) is Adjacency-restricted Agreement Nonmanipulable.
 
Literature
go back to reference Arrow KJ (1963) Social choice and individual values, 2nd edn. Wiley, New York Arrow KJ (1963) Social choice and individual values, 2nd edn. Wiley, New York
go back to reference Barberà S (2010) Strategyproof social 731choice. In: Arrow KJ, Sen A, Suzumura K (eds) Handbook of social choice and welfare, Chap. 25, vol 2. North-Holland, Amsterdam, pp 731–831CrossRef Barberà S (2010) Strategyproof social 731choice. In: Arrow KJ, Sen A, Suzumura K (eds) Handbook of social choice and welfare, Chap. 25, vol 2. North-Holland, Amsterdam, pp 731–831CrossRef
go back to reference Baigent N (1987) Preference proximity and anonymous social choice. Q J Econ 102:161–169CrossRef Baigent N (1987) Preference proximity and anonymous social choice. Q J Econ 102:161–169CrossRef
go back to reference Black D (1948) On the rationale of group decision-making. J Polit Econ 56:23–34CrossRef Black D (1948) On the rationale of group decision-making. J Polit Econ 56:23–34CrossRef
go back to reference Blair Douglas, Muller Eitan (1983) Essential aggregation procedures on restricted domains of preferences. J Econ Theory 30:34–53CrossRef Blair Douglas, Muller Eitan (1983) Essential aggregation procedures on restricted domains of preferences. J Econ Theory 30:34–53CrossRef
go back to reference Bossert W, Sprumont Y (2014) Strategy-proof preference aggregation. Games Econ Behav 85:109–126CrossRef Bossert W, Sprumont Y (2014) Strategy-proof preference aggregation. Games Econ Behav 85:109–126CrossRef
go back to reference Bossert W, Storcken T (1992) Strategy-proofness of social welfare functions: the use of the Kemeny distance between preference orderings. Soc Choice Welf 9:345–360CrossRef Bossert W, Storcken T (1992) Strategy-proofness of social welfare functions: the use of the Kemeny distance between preference orderings. Soc Choice Welf 9:345–360CrossRef
go back to reference Gibbard A (1973) Manipulation of voting schemes: a general result. Econometrica 41:587–601CrossRef Gibbard A (1973) Manipulation of voting schemes: a general result. Econometrica 41:587–601CrossRef
go back to reference Kemeny JG (1959) Mathematics without numbers. Daedalus 88:577–591 Kemeny JG (1959) Mathematics without numbers. Daedalus 88:577–591
go back to reference Kemeny JG, Snell JL (1962) Mathematical models in the social sciences. Blaisdell, New York Kemeny JG, Snell JL (1962) Mathematical models in the social sciences. Blaisdell, New York
go back to reference Moulin H (1988) Axioms of cooperative decision making. Cambridge University Press, CambridgeCrossRef Moulin H (1988) Axioms of cooperative decision making. Cambridge University Press, CambridgeCrossRef
go back to reference Sato S (2013) A sufficient condition for the equivalence of strategy-proofness and nonmanipulability by preferences adjacent to the sincere one. J Econ Theory 148:259–278CrossRef Sato S (2013) A sufficient condition for the equivalence of strategy-proofness and nonmanipulability by preferences adjacent to the sincere one. J Econ Theory 148:259–278CrossRef
go back to reference Satterthwaite MA (1975) Strategy-proofness and Arrow’s conditions: existence and correspondence theorems for voting procedures and social welfare functions. J Econ Theory 10:187–217CrossRef Satterthwaite MA (1975) Strategy-proofness and Arrow’s conditions: existence and correspondence theorems for voting procedures and social welfare functions. J Econ Theory 10:187–217CrossRef
Metadata
Title
Bounded response and the equivalence of nonmanipulability and independence of irrelevant alternatives
Author
Shin Sato
Publication date
01-01-2015
Publisher
Springer Berlin Heidelberg
Published in
Social Choice and Welfare / Issue 1/2015
Print ISSN: 0176-1714
Electronic ISSN: 1432-217X
DOI
https://doi.org/10.1007/s00355-014-0825-8

Other articles of this Issue 1/2015

Social Choice and Welfare 1/2015 Go to the issue