Voting paradoxes and digraphs realizations

@inproceedings{Alon2002VotingPA,
  title={Voting paradoxes and digraphs realizations},
  author={Noga Alon},
  year={2002}
}
A family of permutations F forms a realization of a directed graph T = (V,E) if for every directed edge uv of T , u precedes v in more than half of the permutations. The quality q(F , T ) of the realization is the minimum, over all directed edges uv of T , of the ratio (|F(u, v)| − |F(v, u)|)/|F|, where |F(x, y)| is the number of permutations in F in which x precedes y. The study of this quantity is motivated by questions about voting schemes in which each individual has a linear ordering of… CONTINUE READING