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 systems, which is formulated in terms of simple games. We point out that it is an NP-complete problem to decide whether a given simple game is stable, or not

If several relatives died with no will, the order of their deaths could affect the inheritance result. When the order of death is unknown, there are three approaches to determine the inheritance result: apply an inheritance method that is not affected by the order of death; artificially assign...

Purpose: The purpose of this study was to summarize safety management of manager into two aspects (design behavior and management behavior) and to figure out the different impact these two behaviors might have. Design/methodology/approach: In order to verify the reasonableness of the...