This paper gives a characterization of completeness of blockability relations on simple games. It is verified in this paper that the blockability relation on a simple game is complete if and only if the simple game is S-unanimous for some coalition S in N.
各種検索
サポート
ヘルプ