Recommendations
- scientific article; zbMATH DE number 4091537
- Plurality preference digraphs realized by trees. II: On realization numbers
- \(k\)-majority digraphs and the hardness of voting with a constant number of voters
- Realization of digraphs by preferences based on distances in graphs
- Plurality preference digraphs realized by trees. I: Necessary and sufficient conditions
Cites work
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- scientific article; zbMATH DE number 729736 (Why is no real title available?)
- scientific article; zbMATH DE number 3221981 (Why is no real title available?)
- scientific article; zbMATH DE number 3400720 (Why is no real title available?)
- On the best constants in the Khinchin inequality
- On the maximum cardinality of a consistent set of arcs in a random tournament
- Optimal ranking of tournaments
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- The Voting Problem
Cited in
(20)- What majority decisions are possible
- Plurality preference digraphs realized by trees. II: On realization numbers
- Plurality preference digraphs realized by trees. I: Necessary and sufficient conditions
- A bijection between the \(d\)-dimensional simplices with distances in \(\{1,2\}\) and the partitions of \(d+1\)
- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey
- A probabilistic approach to problems parameterized above or below tight bounds
- scientific article; zbMATH DE number 4091537 (Why is no real title available?)
- Discordant Voting Processes on Finite Graphs
- Realization of digraphs by preferences based on distances in graphs
- Voting 'Against' in regular and nearly regular graphs
- Parameterized constraint satisfaction problems: a survey
- 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
- Ordering transactions with bounded unfairness: definitions, complexity and constructions
- Condorcet domains on at most seven alternatives
- Upper bounds on the minimum size of feedback arc set of directed multigraphs with bounded degree
- Majority decisions when abstention is possible
- Smallest tournaments not realizable by \({\frac{2}{3}}\)-majority voting
This page was built for publication: Voting paradoxes and digraphs realizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1865256)
