1. Preference aggregation theory without acyclicity: The core without majority dissatisfaction
- Author
-
H. Reiju Mihara and Masahiro Kumabe
- Subjects
FOS: Computer and information sciences ,jel:C71 ,Economics and Econometrics ,jel:D71 ,jel:C02 ,Mathematics - Logic ,Aggregation problem ,Core (game theory) ,Computer Science - Computer Science and Game Theory ,If and only if ,Simple (abstract algebra) ,FOS: Mathematics ,91A12, 91B14 (Primary) 91A13, 91B12 (Secondary) ,Logic (math.LO) ,Nakamura number ,Mathematical economics ,Social choice theory ,Finance ,Maximal element ,Core ,kappa number ,simple games ,voting games ,maximal elements ,acyclic preferences ,limit ordinals ,Computer Science and Game Theory (cs.GT) ,Mathematics - Abstract
Acyclicity of individual preferences is a minimal assumption in social choice theory. We replace that assumption by the direct assumption that preferences have maximal elements on a fixed agenda. We show that the core of a simple game is nonempty for all profiles of such preferences if and only if the number of alternatives in the agenda is less than the Nakamura number of the game. The same is true if we replace the core by the core without majority dissatisfaction, obtained by deleting from the agenda all the alternatives that are non-maximal for all players in a winning coalition. Unlike the core, the core without majority dissatisfaction depends only on the players' sets of maximal elements and is included in the union of such sets. A result for an extended framework gives another sense in which the core without majority dissatisfaction behaves better than the core., 27+3 pages
- Published
- 2011
- Full Text
- View/download PDF