A fast and simple randomized parallel algorithm for the maximal independent set problem
Journal of Algorithms
Algorithms with large domination ratio
Journal of Algorithms
Dominating sets in k-majority tournaments
Journal of Combinatorial Theory Series B
Incoherent majorities: The McGarvey problem in judgement aggregation
Discrete Applied Mathematics
Constraint satisfaction problems parameterized above or below tight bounds: a survey
The Multivariate Algorithmic Revolution and Beyond
| Hi-index | 0.00 |
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 all candidates, and the individual preferences are combined to decide between any pair of possible candidates by applying the majority vote. It is shown that every simple digraph T on n vertices, with no anti-parallel edges, admits a realization F with quality at least c/n for some absolute positive constant c, and this is tight up to the constant factor c.