The vetoers in a simple game with ordinal preferences
1979
We consider a core of a simple game with ordinal preferences on a set of alternative outcomes Ω. When a player's strict preference relation takes any logically possible form of acyclic binary relation on Ω, necessary conditions for a simple game to have a nonempty core are given. If Ω is a finite set, the conditions are also sufficient. Further some related results are obtained.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
5
References
176
Citations
NaN
KQI