Voting fairly: Transitive maximal intersecting families of sets

DOI10.1006/jcta.2000.3103zbMath0963.05130OpenAlexW2054395061MaRDI QIDQ1584664

Daniel E. Loeb, Andrew R. Conway

Publication date: 21 June 2001

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/edbf27d1d888a0d8bced9188ba2708d9ac06e614

zbMATH Keywords

votingquotientsintersecting families

Mathematics Subject Classification ID

Voting theory (91B12) Extremal set theory (05D05)

Related Items

Lexicographic composition of simple games ⋮ Voting power in the EU council of ministers and fair decision making in distributive politics ⋮ Counting families of mutually intersecting sets ⋮ Relative blocking in posets ⋮ On the structure of minimal winning coalitions in simple voting games

Uses Software

• Caml

Cites Work

• The fundamental theorem of voting schemes
• Intersecting families of finite sets and fixed-point-free 2-elements
• The transitive groups of degree up to eleven⁺
• How to assign votes in a distributed system
• Mathematical Properties of the Banzhaf Power Index
• Transitive Graphs With Fewer Than Twenty Vertices
• On the Enumeration of Majority Games
• Caml
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item