Nonanonymity and sensitivity of computable simple games [An article from: Mathematical Social Sciences] | ![Nonanonymity and sensitivity of computable simple games [An article from: Mathematical Social Sciences]](http://ecx.images-amazon.com/images/I/512S1GNR6ML._SL160_.jpg)
 enlarge | Author: H. Reiju Mihara
Publisher: Elsevier
Category: Book
Buy New: $8.95
Format: Html
Media: Digital
Publication Date: November 1, 2004
Availability: Available for download now
| |
| Editorial Reviews:
Product Description
This digital document is a journal article from Mathematical Social Sciences, published by Elsevier in 2004. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
Description:
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.
|
|
|
