{"paper":{"title":"Simple Games versus Weighted Voting Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Dani\\\"el Paulusma, Frits Hof, Sascha Kurz, Walter Kern","submitted_at":"2018-05-06T11:46:44Z","abstract_excerpt":"A simple game $(N,v)$ is given by a set $N$ of $n$ players and a partition of $2^N$ into a set $\\mathcal{L}$ of losing coalitions $L$ with value $v(L)=0$ that is closed under taking subsets and a set $\\mathcal{W}$ of winning coalitions $W$ with $v(W)=1$. Simple games with $\\alpha= \\min_{p\\geq 0}\\max_{W\\in {\\cal W},L\\in {\\cal L}} \\frac{p(L)}{p(W)}<1$ are known as weighted voting games. Freixas and Kurz (IJGT, 2014) conjectured that $\\alpha\\leq \\frac{1}{4}n$ for every simple game $(N,v)$. We confirm this conjecture for two complementary cases, namely when all minimal winning coalitions have size"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02192","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}