Nakamura number

In cooperative game theory and social choice theory, the Nakamura number measures the degree of rationality of preference aggregation rules (collective decision rules), such as voting rules. It is an indicator of the extent to which an aggregation rule can yield well-defined choices.

• If the number of alternatives (candidates; options) to choose from is less than this number, then the rule in question will identify "best" alternatives without any problem.

In contrast,

• if the number of alternatives is greater than or equal to this number, the rule will fail to identify "best" alternatives for some pattern of voting (i.e., for some profile (tuple) of individual preferences), because a voting paradox will arise (a cycle generated such as alternative ${\displaystyle a}$ socially preferred to alternative ${\displaystyle b}$, ${\displaystyle b}$ to ${\displaystyle c}$, and ${\displaystyle c}$ to ${\displaystyle a}$).

The larger the Nakamura number a rule has, the greater the number of alternatives the rule can rationally deal with. For example, since (except in the case of four individuals (voters)) the Nakamura number of majority rule is three, the rule can deal with up to two alternatives rationally (without causing a paradox). The number is named after Kenjiro Nakamura  [ ja ] (1947–1979), a Japanese game theorist who proved the above fact that the rationality of collective choice critically depends on the number of alternatives. ^[1]

Overview

To introduce a precise definition of the Nakamura number, we give an example of a "game" (underlying the rule in question) to which a Nakamura number will be assigned. Suppose the set of individuals consists of individuals 1, 2, 3, 4, and 5. Behind majority rule is the following collection of ("decisive") coalitions (subsets of individuals) having at least three members:

{ {1,2,3}, {1,2,4}, {1,2,5}, {1,3,4}, {1,3,5}, {1,4,5}, {2,3,4}, {2,3,5}, {2,4,5}, {3,4,5}, {1,2,3,4}, {1,2,3,5}, {1,2,4,5}, {1,3,4,5}, {2,3,4,5}, {1,2,3,4,5} }

A Nakamura number can be assigned to such collections, which we call simple games. More precisely, a simple game is just an arbitrary collection of coalitions; the coalitions belonging to the collection are said to be winning; the others losing. If all the (at least three, in the example above) members of a winning coalition prefer alternative x to alternative y, then the society (of five individuals, in the example above) will adopt the same ranking (social preference).

The Nakamura number of a simple game is defined as the minimum number of winning coalitions with empty intersection. (By intersecting this number of winning coalitions, one can sometimes obtain an empty set. But by intersecting less than this number, one can never obtain an empty set.) The Nakamura number of the simple game above is three, for example, since the intersection of any two winning coalitions contains at least one individual but the intersection of the following three winning coalitions is empty: ${\displaystyle \{1,2,3\}}$, ${\displaystyle \{4,5,1\}}$, ${\displaystyle \{2,3,4\}}$.

Nakamura's theorem (1979 ^[2] ) gives the following necessary (also sufficient if the set of alternatives is finite) condition for a simple game to have a nonempty "core" (the set of socially "best" alternatives) for all profiles of individual preferences: the number of alternatives is less than the Nakamura number of the simple game. Here, the core of a simple game with respect to the profile of preferences is the set of all alternatives ${\displaystyle x}$ such that there is no alternative ${\displaystyle y}$ that every individual in a winning coalition prefers to ${\displaystyle x}$; that is, the set of maximal elements of the social preference. For the majority game example above, the theorem implies that the core will be empty (no alternative will be deemed "best") for some profile, if there are three or more alternatives.

Variants of Nakamura's theorem exist that provide a condition for the core to be nonempty (i) for all profiles of acyclic preferences; (ii) for all profiles of transitive preferences; and (iii) for all profiles of linear orders. There is a different kind of variant (Kumabe and Mihara, 2011 ^[3] ), which dispenses with acyclicity, the weak requirement of rationality. The variant gives a condition for the core to be nonempty for all profiles of preferences that have maximal elements.

For ranking alternatives, there is a very well known result called "Arrow's impossibility theorem" in social choice theory, which points out the difficulty for a group of individuals in ranking three or more alternatives. For choosing from a set of alternatives (instead of ranking them), Nakamura's theorem is more relevant. ^[5] An interesting question is how large the Nakamura number can be. It has been shown that for a (finite or) algorithmically computable simple game that has no veto player (an individual that belongs to every winning coalition) to have a Nakamura number greater than three, the game has to be non-strong. ^[6] This means that there is a losing (i.e., not winning) coalition whose complement is also losing. This in turn implies that nonemptyness of the core is assured for a set of three or more alternatives only if the core may contain several alternatives that cannot be strictly ranked. ^[8]

Framework

Let ${\displaystyle N}$ be a (finite or infinite) nonempty set of individuals. The subsets of ${\displaystyle N}$ are called coalitions. A simple game (voting game) is a collection ${\displaystyle W}$ of coalitions. (Equivalently, it is a coalitional game that assigns either 1 or 0 to each coalition.) We assume that ${\displaystyle W}$ is nonempty and does not contain an empty set. The coalitions belonging to ${\displaystyle W}$ are winning; the others are losing. A simple game ${\displaystyle W}$ is monotonic if ${\displaystyle S\in W}$ and ${\displaystyle S\subseteq T}$ imply ${\displaystyle T\in W}$. It is proper if ${\displaystyle S\in W}$ implies ${\displaystyle N\setminus S\notin W}$. It is strong if ${\displaystyle S\notin W}$ implies ${\displaystyle N\setminus S\in W}$. A veto player (vetoer) is an individual that belongs to all winning coalitions. A simple game is nonweak if it has no veto player. It is finite if there is a finite set (called a carrier) ${\displaystyle T\subseteq N}$ such that for all coalitions ${\displaystyle S}$, we have ${\displaystyle S\in W}$ iff ${\displaystyle S\cap T\in W}$.

Let ${\displaystyle X}$ be a (finite or infinite) set of alternatives, whose cardinal number (the number of elements) ${\displaystyle \#X}$ is at least two. A (strict) preference is an asymmetric relation ${\displaystyle \succ }$ on ${\displaystyle X}$: if ${\displaystyle x\succ y}$ (read "${\displaystyle x}$ is preferred to ${\displaystyle y}$"), then ${\displaystyle y\not \succ x}$. We say that a preference ${\displaystyle \succ }$ is acyclic (does not contain cycles) if for any finite number of alternatives ${\displaystyle x_{1},\ldots ,x_{m}}$, whenever ${\displaystyle x_{1}\succ x_{2}}$, ${\displaystyle x_{2}\succ x_{3}}$,…, ${\displaystyle x_{m-1}\succ x_{m}}$, we have ${\displaystyle x_{m}\not \succ x_{1}}$. Note that acyclic relations are asymmetric, hence preferences.

A profile is a list ${\displaystyle p=(\succ _{i}^{p})_{i\in N}}$ of individual preferences ${\displaystyle \succ _{i}^{p}}$. Here ${\displaystyle x\succ _{i}^{p}y}$ means that individual ${\displaystyle i}$ prefers alternative ${\displaystyle x}$ to ${\displaystyle y}$ at profile ${\displaystyle p}$.

A simple game with ordinal preferences is a pair ${\displaystyle (W,p)}$ consisting of a simple game ${\displaystyle W}$ and a profile ${\displaystyle p}$. Given ${\displaystyle (W,p)}$, a dominance (social preference) relation ${\displaystyle \succ _{W}^{p}}$ is defined on ${\displaystyle X}$ by ${\displaystyle x\succ _{W}^{p}y}$ if and only if there is a winning coalition ${\displaystyle S\in W}$ satisfying ${\displaystyle x\succ _{i}^{p}y}$ for all ${\displaystyle i\in S}$. The core${\displaystyle C(W,p)}$ of ${\displaystyle (W,p)}$ is the set of alternatives undominated by ${\displaystyle \succ _{W}^{p}}$ (the set of maximal elements of ${\displaystyle X}$ with respect to ${\displaystyle \succ _{W}^{p}}$):

${\displaystyle x\in C(W,p)}$ if and only if there is no ${\displaystyle y\in X}$ such that ${\displaystyle y\succ _{W}^{p}x}$.

Definition and examples

The Nakamura number${\displaystyle \nu (W)}$ of a simple game ${\displaystyle W}$ is the size (cardinal number) of the smallest collection of winning coalitions with empty intersection: ^[9]

${\displaystyle \nu (W)=\min\{\#W':W'\subseteq W;\cap W'=\emptyset \}}$

if ${\displaystyle \cap W=\cap _{S\in W}S=\emptyset }$ (no veto player); ^[2] otherwise, ${\displaystyle \nu (W)=+\infty }$ (greater than any cardinal number).

it is easy to prove that if ${\displaystyle W}$ is a simple game without a veto player, then ${\displaystyle 2\leq \nu (W)\leq \#N}$.

Examples for finitely many individuals (${\displaystyle N=\{1,\ldots ,n\}}$) (see Austen-Smith and Banks (1999), Lemma 3.2 ^[4] ). Let ${\displaystyle W}$ be a simple game that is monotonic and proper.

• If ${\displaystyle W}$ is strong and without a veto player, then ${\displaystyle \nu (W)=3}$.
• If ${\displaystyle W}$ is the majority game (i.e., a coalition is winning if and only if it consists of more than half of individuals), then ${\displaystyle \nu (W)=3}$ if ${\displaystyle n\neq 4}$; ${\displaystyle \nu (W)=4}$ if ${\displaystyle n=4}$.
• If ${\displaystyle W}$ is a ${\displaystyle q}$-rule (i.e., a coalition is winning if and only if it consists of at least ${\displaystyle q}$ individuals) with ${\displaystyle n/2<q<n}$, then ${\displaystyle \nu (W)=[n/(n-q)]}$, where ${\displaystyle [x]}$ is the smallest integer greater than or equal to ${\displaystyle x}$.

Examples for at most countably many individuals (${\displaystyle N=\{1,2,\ldots \}}$). Kumabe and Mihara (2008) comprehensively study the restrictions that various properties (monotonicity, properness, strongness, nonweakness, and finiteness) for simple games impose on their Nakamura number (the Table "Possible Nakamura Numbers" below summarizes the results). In particular, they show that an algorithmically computable simple game ^[10] without a veto player has a Nakamura number greater than 3 only if it is proper and nonstrong. ^[6]

Possible Nakamura Numbers ^[11]

Type	Finite games	Infinite games
1111	3	3
1110	+∞	none
1101	≥3	≥3
1100	+∞	+∞
1011	2	2
1010	none	none
1001	2	2
1000	none	none
0111	2	2
0110	none	none
0101	≥2	≥2
0100	+∞	+∞
0011	2	2
0010	none	none
0001	2	2
0000	none	none

Nakamura's theorem for acyclic preferences

Nakamura's theorem (Nakamura, 1979, Theorems 2.3 and 2.5 ^[2] ). Let ${\displaystyle W}$ be a simple game. Then the core ${\displaystyle C(W,p)}$ is nonempty for all profiles ${\displaystyle p}$ of acyclic preferences if and only if ${\displaystyle X}$ is finite and ${\displaystyle \#X<\nu (W)}$.

Remarks

• Nakamura's theorem is often cited in the following form, without reference to the core (e.g., Austen-Smith and Banks, 1999, Theorem 3.2 ^[4] ): The dominance relation ${\displaystyle \succ _{W}^{p}}$ is acyclic for all profiles ${\displaystyle p}$ of acyclic preferences if and only if ${\displaystyle \#B<\nu (W)}$ for all finite ${\displaystyle B\subseteq X}$ (Nakamura 1979, Theorem 3.1 ^[2] ).
• The statement of the theorem remains valid if we replace "for all profiles ${\displaystyle p}$ of acyclic preferences" by "for all profiles ${\displaystyle p}$ of negatively transitive preferences" or by "for all profiles ${\displaystyle p}$ of linearly ordered (i.e., transitive and total) preferences". ^[12]

• The theorem can be extended to ${\displaystyle {\mathcal {B}}}$-simple games. Here, the collection ${\displaystyle {\mathcal {B}}}$ of coalitions is an arbitrary Boolean algebra of subsets of ${\displaystyle N}$, such as the ${\displaystyle \sigma }$-algebra of Lebesgue measurable sets. A ${\displaystyle {\mathcal {B}}}$-simple game is a subcollection of ${\displaystyle {\mathcal {B}}}$. Profiles are suitably restricted to measurable ones: a profile ${\displaystyle p}$ is measurable if for all ${\displaystyle x,y\in X}$, we have ${\displaystyle \{i:x\succ _{i}^{p}y\}\in {\mathcal {B}}}$. ^[3]

A variant of Nakamura's theorem for preferences that may contain cycles

In this section, we discard the usual assumption of acyclic preferences. Instead, we restrict preferences to those having a maximal element on a given agenda (opportunity set that a group of individuals are confronted with), a subset of some underlying set of alternatives. (This weak restriction on preferences might be of some interest from the viewpoint of behavioral economics.) Accordingly, it is appropriate to think of ${\displaystyle X}$ as an agenda here. An alternative ${\displaystyle x\in X}$ is a maximal element with respect to ${\displaystyle \succ _{i}^{p}}$ (i.e., ${\displaystyle \succ _{i}^{p}}$ has a maximal element ${\displaystyle x}$) if there is no ${\displaystyle y\in X}$ such that ${\displaystyle y\succ _{i}^{p}x}$. If a preference is acyclic over the underlying set of alternatives, then it has a maximal element on every finite subset ${\displaystyle X}$.

We introduce a strengthening of the core before stating the variant of Nakamura's theorem. An alternative ${\displaystyle x}$ can be in the core ${\displaystyle C(W,p)}$ even if there is a winning coalition of individuals ${\displaystyle i}$ that are "dissatisfied" with ${\displaystyle x}$ (i.e., each ${\displaystyle i}$ prefers some ${\displaystyle y_{i}}$ to ${\displaystyle x}$). The following solution excludes such an ${\displaystyle x}$: ^[3]

An alternative ${\displaystyle x\in X}$ is in the core${\displaystyle C^{+}(W,p)}$without majority dissatisfaction if there is no winning coalition ${\displaystyle S\in W}$ such that for all ${\displaystyle i\in S}$, ${\displaystyle x}$ is non-maximal (there exists some ${\displaystyle y_{i}\in X}$ satisfying ${\displaystyle y_{i}\succ _{i}^{p}x}$).

It is easy to prove that ${\displaystyle C^{+}(W,p)}$ depends only on the set of maximal elements of each individual and is included in the union of such sets. Moreover, for each profile ${\displaystyle p}$, we have ${\displaystyle C^{+}(W,p)\subseteq C(W,p)}$.

A variant of Nakamura's theorem (Kumabe and Mihara, 2011, Theorem 2 ^[3] ). Let ${\displaystyle W}$ be a simple game. Then the following three statements are equivalent:

1. ${\displaystyle \#X<\nu (W)}$;
2. the core ${\displaystyle C^{+}(W,p)}$ without majority dissatisfaction is nonempty for all profiles ${\displaystyle p}$ of preferences that have a maximal element;
3. the core ${\displaystyle C(W,p)}$ is nonempty for all profiles ${\displaystyle p}$ of preferences that have a maximal element.

Remarks

• Unlike Nakamura's original theorem, ${\displaystyle X}$ being finite is not a necessary condition for ${\displaystyle C^{+}(W,p)}$ or ${\displaystyle C(W,p)}$ to be nonempty for all profiles ${\displaystyle p}$. Even if an agenda ${\displaystyle X}$ has infinitely many alternatives, there is an element in the cores for appropriate profiles, as long as the inequality ${\displaystyle \#X<\nu (W)}$ is satisfied.
• The statement of the theorem remains valid if we replace "for all profiles ${\displaystyle p}$ of preferences that have a maximal element" in statements 2 and 3 by "for all profiles ${\displaystyle p}$ of preferences that have exactly one maximal element" or "for all profiles ${\displaystyle p}$ of linearly ordered preferences that have a maximal element" (Kumabe and Mihara, 2011, Proposition 1).
• Like Nakamura's theorem for acyclic preferences, this theorem can be extended to ${\displaystyle {\mathcal {B}}}$-simple games. The theorem can be extended even further (1 and 2 are equivalent; they imply 3) to collections${\displaystyle W'\subseteq {\mathcal {B}}'}$of winning sets by extending the notion of the Nakamura number. ^[13]

See also

• Gibbard–Satterthwaite theorem
• May's theorem
• Voting paradox

Notes

1. Suzuki, Mitsuo (1981). Game theory and social choice: Selected papers of Kenjiro Nakamura. Keiso Shuppan. Nakamura received Doctor's degree in Social Engineering in 1975 from Tokyo Institute of Technology.
2. Nakamura, K. (1979). "The vetoers in a simple game with ordinal preferences". International Journal of Game Theory. 8: 55–61. doi:10.1007/BF01763051. S2CID   120709873.
3. Kumabe, M.; Mihara, H. R. (2011). "Preference aggregation theory without acyclicity: the core without majority dissatisfaction" (PDF). Games and Economic Behavior. 72: 187–201. arXiv: 1107.0431 . doi:10.1016/j.geb.2010.06.008. S2CID   6685306.
4. Austen-Smith, David; Banks, Jeffrey S. (1999). Positive political theory I: Collective preference. Ann Arbor: University of Michigan Press. ISBN   978-0-472-08721-1.
5. Nakamura's original theorem is directly relevant to the class of simple preference aggregation rules, the rules completely described by their family of decisive (winning) coalitions. (Given an aggregation rule, a coalition ${\displaystyle S}$ is decisive if whenever every individual in ${\displaystyle S}$ prefers ${\displaystyle x}$ to ${\displaystyle y}$, then so does the society.) Austen-Smith and Banks (1999), ^[4] a textbook on social choice theory that emphasizes the role of the Nakamura number, extends the Nakamura number to the wider (and empirically important) class of neutral (i.e., the labeling of alternatives does not matter) and monotonic (if ${\displaystyle x}$ is socially preferred to ${\displaystyle y}$, then increasing the support for ${\displaystyle x}$ over ${\displaystyle y}$ preserves this social preference) aggregation rules (Theorem 3.3), and obtain a theorem (Theorem 3.4) similar to Nakamua's.
6. Kumabe, M.; Mihara, H. R. (2008). "The Nakamura numbers for computable simple games". Social Choice and Welfare. 31 (4): 621. arXiv: 1107.0439 . doi:10.1007/s00355-008-0300-5. S2CID   8106333.
7. Kirman, A.; Sondermann, D. (1972). "Arrow's theorem, many agents, and invisible dictators". Journal of Economic Theory. 5 (2): 267–277. doi:10.1016/0022-0531(72)90106-8.
8. There exist monotonic, proper, strong simple games without a veto player that have an infinite Nakamura number. A nonprincipal ultrafilter is an example, which can be used to define an aggregation rule (social welfare function) satisfying Arrow's conditions if there are infinitely many individuals. ^[7] A serious drawback of nonprincipal ultrafilters for this purpose is that they are not algorithmically computable.
9. The minimum element of the following set exists since every nonempty set of ordinal numbers has a least element.
10. See a section for Rice's theorem for the definition of a computable simple game. In particular, all finite games are computable.
11. Possible Nakamura numbers for computable simple games are given in each entry, assuming that an empty coalition is losing. The sixteen types are defined in terms of the four properties: monotonicity, properness, strongness, and nonweakness (lack of a veto player). For example, the row corresponding to type 1110 indicates that among the monotonic (1), proper (1), strong (1), weak (0, because not nonweak) computable simple games, finite ones have a Nakamura number equal to ${\displaystyle +\infty }$ and infinite ones do not exist. The row corresponding to type 1101 indicates that any ${\displaystyle k\geq 3}$ (and no ${\displaystyle k<3}$) is the Nakamura number of some finite (alternatively, infinite) simple game of this type. Observe that among nonweak simple games, only types 1101 and 0101 attain a Nakamura number greater than 3.
12. The "if" direction is obvious while the "only if" direction is stronger than the statement of the theorem given above (the proof is essentially the same). These results are often stated in terms of weak preferences (e.g, Austen-Smith and Banks, 1999, Theorem 3.2 ^[4] ). Define the weak preference ${\displaystyle \succeq }$ by ${\displaystyle x\succeq y\iff y\not \succ x}$. Then ${\displaystyle \succ }$ is asymmetric iff ${\displaystyle \succeq }$ is complete; ${\displaystyle \succ }$ is negatively transitive iff ${\displaystyle \succeq }$ is transitive. ${\displaystyle \succ }$ is total if ${\displaystyle x\neq y}$ implies ${\displaystyle x\succ y}$ or ${\displaystyle y\succ x}$.
13. The framework distinguishes the algebra ${\displaystyle {\mathcal {B}}}$ of coalitions from the larger collection ${\displaystyle {\mathcal {B}}'}$ of the sets of individuals to which winning/losing status can be assigned. For example, ${\displaystyle {\mathcal {B}}}$ is the algebra of recursive sets and ${\displaystyle {\mathcal {B}}'}$ is the lattice of recursively enumerable sets (Kumabe and Mihara, 2011, Section 4.2).