2026-09-20T10:14:54Zhttps://wakespace.lib.wfu.edu/server/oai/request

oai:null:10339/385732026-09-18T12:20:07Zcom_10339_14934col_10339_38132

Stasikelis, Kara Aileen 2013-06-06T21:19:38Z 2013 https://wakespace.lib.wfu.edu/handle/10339/38573 Given a chain of the partially ordered set of weighted games, it is currently unknown if weights can be assigned to each of the $n$ voters so that the chain is weighted. We conjecture that every consistent chain $C$ through weighted games admits weights, $\vec{w}$, such that for all weighted games $v$ in $C$, there exists a quota $q$ such that $v = (q, \vec{w})$. We prove that this is the case for $n\leq 5$. It is still currently unknown whether our conjecture is true for $n >5$. en Wake Forest University A Combinatorial View of Weighted Voting Thesis Mason, Sarah Howards, Hugh Moore, Frank Mathematics forever 10000-01-01 open.access