Advertisement

Social Decision Rules Which Are Simple Games

  • Satish Kumar JainEmail author
Chapter
  • 75 Downloads

Abstract

A simple game social decision rule is defined by the condition that under it an alternative x is socially preferred to another alternative y iff all individuals belonging to some winning coalition unanimously prefer x to y. This chapter provides a characterization for the class of social decision rules that are simple games as well as for the subclass that are strong simple games and derives Inada-type necessary and sufficient conditions for transitivity and quasi-transitivity under the rules belonging to the class.

References

  1. Gibbard, Allan. 1969. Social choice and the Arrow conditions. Discussion Paper: Department of Philosophy, University of Michigan.Google Scholar
  2. Jain, Satish K. 1989. Characterization theorems for social decision rules which are simple games. Paper presented at the IX World Congress of the International Economic Association, Economics Research Center, Athens School of Economics & Business, Athens, Greece, held on Aug 28 - Sep 1, 1989.Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  1. 1.Formerly ProfessorJawaharlal Nehru UniversityNew DelhiIndia

Personalised recommendations