Voting Fairly: Transitive Maximal Intersecting Families of Sets

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.

[1]  Pradeep Dubey,et al.  Mathematical Properties of the Banzhaf Power Index , 1979, Math. Oper. Res..

[2]  Alexander Hulpke,et al.  Konstruktion transitiver Permutationsgruppen , 1996 .

[3]  The Fundamental Theorem of Voting Schemes , 1996, J. Comb. Theory, Ser. A.

[4]  J. Neumann.  Zur Theorie der Gesellschaftsspiele , 1928 .

[5]  J. Neumann,et al.  Theory of games and economic behavior , 1945, 100 Years of Math Milestones.

[6]  M. Richardson,et al.  On finite projective games , 1956 .

[7]  L. A. Goodman,et al.  Social Choice and Individual Values , 1951 .

[8]  Daniel E. Loeb,et al.  Stable Winning Coalitions , 1996 .

[9]  Toshihide Ibaraki,et al.  Generating and Approximating Nondominated Coteries , 1995, IEEE Trans. Parallel Distributed Syst..

[10]  Hector Garcia-Molina,et al.  How to assign votes in a distributed system , 1985, JACM.

[11]  B. McKay.  Transitive graphs with fewer than twenty vertices , 1979 .

[12]  G. Butler,et al.  The transitive groups of degree up to eleven , 1983 .

[13]  W. M. Hirsch,et al.  SECTION OF MATHEMATICS: ALGEBRAIC AND COMBINATORIAL ASPECTS OF COHERENT STRUCTURES* , 1969 .

[14]  John R. Isbell,et al.  On the enumeration of majority games , 1959 .

[15]  Peter J. Cameron,et al.  Intersecting Families of Finite Sets and Fixed-point-Free 2-Elements , 1989, Eur. J. Comb..

[16]  J. R. Isbell,et al.  Homogeneous games. II , 1960 .

[17]  K. Ramamurthy.  Coherent Structures and Simple Games , 1990 .

[18]  I. Anderson.  Combinatorics of Finite Sets , 1987 .