A characterization of completeness of blockability relations with respect to unanimity

作者：

Highlights：

•

摘要

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.

论文关键词：Game theory,Simple games,Blockability relation,Coalition,Group decision making

论文评审过程：Available online 17 August 2007.

论文官网地址：https://doi.org/10.1016/j.amc.2007.08.007