The vetoers in a simple game with ordinal preferences Export

@article{nakamura79, abstract = {We consider a core of a simple game with ordinal preferences on a set of alternative outcomes O. When a player's strict preference relation takes any logically possible form of acyclic binary relation on O, necessary conditions for a simple game to have a nonempty core are given. If O is a finite set, the conditions are also sufficient. Further some related results are obtained.}, author = {Nakamura, K.}, citeulike-article-id = {3758677}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/BF01763051}, citeulike-linkout-1 = {http://www.springerlink.com/content/k124825361762273}, comment = {Related articles: The Nakamura numbers for computable simple games http://jp.citeulike.org/user/reiju/article/2818168 Computability of simple games: A characterization and application to the core http://jp.citeulike.org/user/reiju/article/2818166 }, day = {1}, doi = {10.1007/BF01763051}, journal = {International Journal of Game Theory}, keywords = {cooperative\_game\_theory, core, nakamura-number, preference\_aggregation, social\_choice}, month = {March}, number = {1}, pages = {55--61}, posted-at = {2008-12-09 09:34:08}, priority = {0}, title = {The vetoers in a simple game with ordinal preferences}, url = {http://dx.doi.org/10.1007/BF01763051}, volume = {8}, year = {1979} }

TY - JOUR ID - nakamura79 L3 - citeulike-article-id:3758677 N2 - We consider a core of a simple game with ordinal preferences on a set of alternative outcomes O. When a player's strict preference relation takes any logically possible form of acyclic binary relation on O, necessary conditions for a simple game to have a nonempty core are given. If O is a finite set, the conditions are also sufficient. Further some related results are obtained. IS - 1 JF - International Journal of Game Theory EP - 61 TI - The vetoers in a simple game with ordinal preferences VL - 8 SP - 55 KW - cooperative_game_theory KW - core KW - nakamura-number KW - preference_aggregation KW - social_choice N1 - Related articles: The Nakamura numbers for computable simple games http://jp.citeulike.org/user/reiju/article/2818168 Computability of simple games: A characterization and application to the core http://jp.citeulike.org/user/reiju/article/2818166 AU - Nakamura, K PY - 1979/03/01/ UR - http://dx.doi.org/10.1007/BF01763051 ER -