Nonanonymity and sensitivity of computable simple games Export

@article{mihara04mss, abstract = {This paper investigates algorithmic computability of simple games (voting games). It shows that (i) games with a finite carrier are computable, (ii) computable games have both finite winning coalitions and cofinite losing coalitions, and (iii) computable games violate any conceivable notion of anonymity, including finite anonymity and measure-based anonymity. The paper argues that computable games are excluded from the intuitive class of "nice" infinite games, employing the notion of "insensitivity"--equal treatment of any two coalitions that differ only on a finite set.}, author = {Mihara, H. R.}, citeulike-article-id = {2818160}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.mathsocsci.2004.04.001}, citeulike-linkout-1 = {http://www.sciencedirect.com/science/article/B6V88-4CRY84J-1/1/cd26caeaf86d3fcc4b52147db54ea488}, doi = {10.1016/j.mathsocsci.2004.04.001}, journal = {Mathematical Social Sciences}, keywords = {anonymity, computability, computer\_science, cooperative\_game\_theory, economics, infinitely-many-players, political\_science, recursion-theory, social\_choice, ultrafilters, vita, voting-games}, month = {November}, number = {3}, pages = {329--341}, posted-at = {2008-05-21 05:18:51}, priority = {0}, title = {Nonanonymity and sensitivity of computable simple games}, url = {http://dx.doi.org/10.1016/j.mathsocsci.2004.04.001}, volume = {48}, year = {2004} }

TY - JOUR ID - mihara04mss L3 - citeulike-article-id:2818160 N2 - This paper investigates algorithmic computability of simple games (voting games). It shows that (i) games with a finite carrier are computable, (ii) computable games have both finite winning coalitions and cofinite losing coalitions, and (iii) computable games violate any conceivable notion of anonymity, including finite anonymity and measure-based anonymity. The paper argues that computable games are excluded from the intuitive class of "nice" infinite games, employing the notion of "insensitivity"--equal treatment of any two coalitions that differ only on a finite set. IS - 3 JF - Mathematical Social Sciences EP - 341 TI - Nonanonymity and sensitivity of computable simple games VL - 48 SP - 329 KW - anonymity KW - computability KW - computer_science KW - cooperative_game_theory KW - economics KW - infinitely-many-players KW - political_science KW - recursion-theory KW - social_choice KW - ultrafilters KW - vita KW - voting-games AU - Mihara, HR PY - 2004/11// UR - http://dx.doi.org/10.1016/j.mathsocsci.2004.04.001 ER -