2008年4月
A characterization of completeness of blockability relations with respect to unanimity
APPLIED MATHEMATICS AND COMPUTATION
- ,
- 巻
- 197
- 号
- 2
- 開始ページ
- 715
- 終了ページ
- 718
- 記述言語
- 英語
- 掲載種別
- DOI
- 10.1016/j.amc.2007.08.007
- 出版者・発行元
- ELSEVIER SCIENCE INC
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. (c) 2007 Elsevier Inc. All rights reserved.
- リンク情報
- ID情報
-
- DOI : 10.1016/j.amc.2007.08.007
- ISSN : 0096-3003
- Web of Science ID : WOS:000254254200025