Fundamentals of simple games from a viewpoint of blockability relations
From MaRDI portal
Recommendations
Cites work
- A characterization of completeness of blockability relations with respect to unanimity
- A method to compare influence of coalitions on group decision other than desirability relation
- A note on voting
- Comparability of coalitions in committees with permission of voters by using desirability relation with hopefulness relation.
- scientific article; zbMATH DE number 1599890 (Why is no real title available?)
- scientific article; zbMATH DE number 1600673 (Why is no real title available?)
- scientific article; zbMATH DE number 3898540 (Why is no real title available?)
- scientific article; zbMATH DE number 44383 (Why is no real title available?)
- scientific article; zbMATH DE number 49085 (Why is no real title available?)
- New interpretation of the core of simple games in terms of voters' permission.
- Symmetry of simple games and permission of voters.
Cited in
(6)- Computation of several power indices by generating functions
- Computing Banzhaf-Coleman and Shapley-Shubik power indices with incompatible players
- scientific article; zbMATH DE number 24825 (Why is no real title available?)
- A relation-algebraic approach to simple games
- A new binary relation to compare viability of winning coalitions and its interrelationships to desirability relation and blockability relation
- Automorphisms and blocking in simple games
This page was built for publication: Fundamentals of simple games from a viewpoint of blockability relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1021485)