{"id":{"repo_id":"wfu","oai_identifier":"oai:wakespace.lib.wfu.edu:10339/38573"},"canonical_url":"https://search.dev.ndltd.org/etd/wfu/oai:wakespace.lib.wfu.edu:10339/38573","repository":{"repo_id":"wfu","name":"Wake Forest University","base_url":"https://wakespace.lib.wfu.edu/oai/request"},"display":{"title":"A Combinatorial View of Weighted Voting","abstract":"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$.","abstract_html":"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$.","abstract_has_math":true,"creators":["Stasikelis, Kara Aileen"],"institution":"Wake Forest University","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2013,"date_issued":"2013","date_published":"2013","updated_at":"2026-07-27T22:01:33Z","subjects":[],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/10339/38573","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Stasikelis, Kara Aileen"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2013-06-06T21:19:38Z"]},{"key":"dc:date.issued","label":"Date","values":["2013"]},{"key":"dc:publisher","label":"Institution","values":["Wake Forest University"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10339/38573"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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$."]},{"key":"dc:title","label":"Title","values":["A Combinatorial View of Weighted Voting"]}]}],"canonical_facts":{"dc:creator":["Stasikelis, Kara Aileen"],"dc:date.accessioned":["2013-06-06T21:19:38Z"],"dc:date.issued":["2013"],"dc:description.abstract":["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$."],"dc:identifier.uri":["http://hdl.handle.net/10339/38573"],"dc:language.iso":["en"],"dc:publisher":["Wake Forest University"],"dc:title":["A Combinatorial View of Weighted Voting"],"dc:type":["Thesis"]},"updated_at":"2026-07-27T22:01:33Z"}