This paper reexamines the paradoxical aspect of the electronic mail game (Rubinstein, 1989). The electronic mail game is a coordination game with payoff uncertainty. At a Bayesian Nash equilibrium of the game, players cannot achieve the desired coordination of actions even when a high order of...

This paper discusses an aspect of computational complexity in social choice theory. We consider the problem of designing voting rules, which is formulated in terms of simple games. We prove that it is an NP-complete problem to decide whether a given simple game is stable, or not.

This paper discusses an aspect of computational complexity in social choice theory. We consider the problem of designing voting rules, which is formulated in terms of simple games. We prove that it is an NP-complete problem to decide whether a given simple game is stable, or not.

This paper reexamines the paradoxical aspect of the electronic mail game (Rubinstein, 1989). The electronic mail game is a coordination game with payoff uncertainty. At a Bayesian Nash equilibrium of the game, players cannot achieve the desired coordination of actions even when a high order of...

This paper discusses an aspect of computational complexity in social choice theory. We consider the problem of designing voting rules, which is formulated in terms of simple games. We prove that it is an NP-complete problem to decide whether a given simple game is stable, or not. --...

This paper reexamines the paradoxical aspect of the electronic mail game (Rubinstein, 1989). The electronic mail game is a coordination game with payoff uncertainty. At a Bayesian Nash equilibrium of the game, players cannot achieve the desired coordination of actions even when a high order of...