Article ID Journal Published Year Pages File Type
4634617 Applied Mathematics and Computation 2008 4 Pages PDF
Abstract

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.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Applied Mathematics
Preview
A characterization of completeness of blockability relations with respect to unanimity
Authors
, ,