The Nakamura numbers for computable simple games

Details The Nakamura numbers for computable simple games The Nakamura numbers for computable simple games

2011-07-03

arxiv.org/abs/1107.0439v1

Social Choice and Welfare (2008) 31:621-640

Computer Science

Computer Science and Game Theory

24+1 pages

Scientific paper

10.1007/s00355-008-0300-5

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.

Affiliated with

Also associated with

No associations

Rating

The Nakamura numbers for computable simple games does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Nakamura numbers for computable simple games, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Nakamura numbers for computable simple games will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-707251