Polytopality of simple games
Abstract
The Bier sphere Bier(G) = Bier(K) = K K and the canonical fan Fan() = Fan(K) are combinatorial/geometric companions of a simple game G = (P,) (equivalently the associated simplicial complex K), where P is the set of players, ⊂eq 2P is the set of wining coalitions, and K = 2P is the simplicial complex of losing coalitions. We characterize roughly weighted majority games as the games such that Bier(G) (respectively Fan()) is canonically polytopal (canonically pseudo-polytopal) and show, by an experimental/theoretical argument, that all simple games with at most five players are polytopal.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.