Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Polytopality of simple games (2309.14848v1)

Published 26 Sep 2023 in math.CO

Abstract: The Bier sphere $Bier(\mathcal{G}) = Bier(K) = K\ast_\Delta K\circ$ and the canonical fan $Fan(\Gamma) = Fan(K)$ are combinatorial/geometric companions of a simple game $\mathcal{G} = (P,\Gamma)$ (equivalently the associated simplicial complex $K$), where $P$ is the set of players, $\Gamma\subseteq 2P$ is the set of wining coalitions, and $K = 2P\setminus \Gamma$ is the simplicial complex of losing coalitions. We characterize roughly weighted majority games as the games $\Gamma$ such that $Bier(\mathcal{G})$ (respectively $Fan(\Gamma)$) is canonically polytopal (canonically pseudo-polytopal) and show, by an experimental/theoretical argument, that all simple games with at most five players are polytopal.

Summary

We haven't generated a summary for this paper yet.