On the structure of minimal winning coalitions in simple voting games
From MaRDI portal
Publication:2268893
Recommendations
Cites work
- scientific article; zbMATH DE number 4029608 (Why is no real title available?)
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- scientific article; zbMATH DE number 1016362 (Why is no real title available?)
- scientific article; zbMATH DE number 1470897 (Why is no real title available?)
- scientific article; zbMATH DE number 750169 (Why is no real title available?)
- A CLASS OF MAJORITY GAMES
- A characterization and some properties of the Banzhaf-Coleman-Dubey-Shapley sensitivity index
- A new short proof for the Kruskal-Katona theorem
- Complete games with minimum
- Complete simple games
- Enumeration of intersecting families
- Hierarchies achievable in simple games
- How to assign votes in a distributed system
- On the existence of a minimum integer representation for weighted voting systems
- Shadows and shifting
- Voting fairly: Transitive maximal intersecting families of sets
- Weighted voting, multicameral representation, and power
Cited in
(8)- On the enumeration of bipartite simple games
- Hierarchy of players in swap robust voting games
- An incomplete cooperation structure for a voting game can be strategically stable
- On the average minimum size of a manipulating coalition
- Minimal winning coalitions in weighted-majority voting games
- On the enumeration of some inequivalent monotone Boolean functions
- Simple games versus weighted voting games: bounding the critical threshold value
- Mathematical structures of simple voting games
This page was built for publication: On the structure of minimal winning coalitions in simple voting games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2268893)