Back to Search Start Over

Computational complexity in the design of voting rules

Authors :
Takamiya, Koji
Tanaka, Akira
Takamiya, Koji
Tanaka, Akira
Publication Year :
2016

Abstract

This paper considers the computational complexity of the design of voting rules, which is formulated by simple games. We prove that it is an NP-complete problem to decide whether a given simple game is stable, or not.

Details

Database :
OAIster
Notes :
English
Publication Type :
Electronic Resource
Accession number :
edsoai.on1200119996
Document Type :
Electronic Resource

Tools

Authors Abstract Subjects Details