Voting paradoxes and digraphs realizations

DOI10.1016/S0196-8858(02)00007-6zbMath1020.91012MaRDI QIDQ1865256

Noga Alon

Publication date: 26 March 2003

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

permutationsdirected graphmajority votevoting schemes

Mathematics Subject Classification ID

Voting theory (91B12) Directed graphs (digraphs), tournaments (05C20)

Related Items

Smallest tournaments not realizable by \({\frac{2}{3}}\)-majority voting, Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey, Unnamed Item, Ranking graphs through hitting times of Markov chains, Construction of voting situations concordant with ranking patterns, Construction of aggregation paradoxes through load-sharing models, Incoherent majorities: the McGarvey problem in judgement aggregation, A bijection between the \(d\)-dimensional simplices with distances in \(\{1,2\}\) and the partitions of \(d+1\), What majority decisions are possible, Majority decisions when abstention is possible, A Probabilistic Approach to Problems Parameterized above or below Tight Bounds

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the maximum cardinality of a consistent set of arcs in a random tournament
• The Voting Problem
• A fast and simple randomized parallel algorithm for the maximal independent set problem
• On the best constants in the Khinchin inequality
• Optimal ranking of tournaments