EconPapers    
Economics at your fingertips  
 

The Nakamura numbers for computable simple games

Masahiro Kumabe and H. Reiju Mihara

MPRA Paper from University Library of Munich, Germany

Abstract: The Nakamura number of a simple game plays a critical role in preference aggregation (or multi-criterion ranking): the number of alternatives that the players can always deal with rationally is less than this number. We comprehensively study the restrictions that various properties for a simple game impose on its Nakamura number. We find that a computable game has a finite Nakamura number greater than three only if it is proper, nonstrong, and nonweak, regardless of whether it is monotonic or whether it has a finite carrier. The lack of strongness often results in alternatives that cannot be strictly ranked.

Keywords: Nakamura number; voting games; the core; Turing computability; axiomatic method; multi-criterion decision-making (search for similar items in EconPapers)
JEL-codes: C69 D71 C71 (search for similar items in EconPapers)
New Economics Papers: this item is included in nep-cdm and nep-gth
Date: 2007-06-23
References: View references in EconPapers View complete reference list from CitEc
Citations View citations in EconPapers (1) Track citations by RSS feed

Downloads: (external link)
http://mpra.ub.uni-muenchen.de/3684/ original version (application/pdf)
http://mpra.ub.uni-muenchen.de/5849/ revised version (application/pdf)

Related works:
Journal Article: The Nakamura numbers for computable simple games (2008) Downloads
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: http://EconPapers.repec.org/RePEc:pra:mprapa:3684

Access Statistics for this paper

More papers in MPRA Paper from University Library of Munich, Germany
Address: Schackstr. 4, D-80539 Munich, Germany
Contact information at EDIRC.
Series data maintained by Ekkehart Schlicht ().

 
Page updated 2014-10-11
Handle: RePEc:pra:mprapa:3684