Preorders in simple games
Document typePart of book or chapter of book
Rights accessOpen Access
Any power index defines a total preorder in a simple game and, thus, induces a hierarchy among its players. The desirability relation, which is also a preorder, induces the same hierarchy as the Banzhaf and the Shapley indices on linear games, i.e., games in which the desirability relation is total. The desirability relation is a sub–preorder of another preorder, the weak desirability relation, and the class of weakly linear games, i.e., games for which the weak desirability relation is total, is larger than the class of linear games. The weak desirability relation induces the same hierarchy as the Banzhaf and the Shapley indices on weakly linear games. In this paper, we define a chain of preorders between the desirability and the weak desirability preorders. From them we obtain new classes of totally preordered games between linear and weakly linear games.
The final authenticated version is available online at: https://doi.org/10.1007/978-3-319-70647-4_5.
CitationFreixas, J., Pons, M. Preorders in simple games. A: "Transactions on computational collective intelligence XXVII". Berlín: Springer, 2017 (Lecture notes in computer science; 10480). p. 63-73.