Title of article
Voting Fairly: Transitive Maximal Intersecting Families of Sets
Author/Authors
Loeb، نويسنده , , Daniel E. and Conway، نويسنده , , Andrew R.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
25
From page
386
To page
410
Abstract
There are several applications of maximal intersecting families (MIFs) and different notions of fairness. We survey known results regarding the enumeration of MIFs, and we conclude the enumeration of the 207,650,662,008 maximal families of intersecting subsets of X whose group of symmetries is transitive for |X|<13.
Keywords
strong simple game , Regular , coterie , ipsodual element of free distributive lattice , transitive , homogeneous games , maximal intersecting family , critical tripartite hypergraph , voting scheme , self-dual monotone Boolean function , self-dual anti-chain , fair
Journal title
Journal of Combinatorial Theory Series A
Serial Year
2000
Journal title
Journal of Combinatorial Theory Series A
Record number
1530507
Link To Document