The Voting Problem - MaRDI portal

Cited In (70)

Voting paradoxes and digraphs realizations
On a problem of Erdős and Rado
Ranking graphs through hitting times of Markov chains
Coloring the nodes of a directed graph
Unavoidable subtournaments in large tournaments with no homogeneous sets
\(k\)-majority digraphs and the hardness of voting with a constant number of voters
Turán theorems for unavoidable patterns
Unavoidable tournaments
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\)
New bounds on the Ramsey number \(r ( I_m , L_n )\)
Paths with many shortcuts in tournaments
Simple games with many effective voters
Voting procedures, complexity of
A characterization of the \(n\)-agent Pareto dominance relation
What shall we do with the cyclic profile?
A simple voting scheme generates all binary relations on finite sets
Extension of Gyárfás-Sumner conjecture to digraphs
An extension of McGarvey's theorem from the perspective of the plurality collective choice mechanism
Coloring the edges of a directed graph
Polynomial time algorithms for tracking path problems
Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth
Forcing large transitive subtournaments
Dictators on blocks: Generalizations of social choice impossibility theorems
Outranking Relations: Do They Have Special Properties?
On \(\lambda\)-majority voting paradoxes
Discrete Mathematics in Voting and Group Choice
Efron's coins and the linial arrangement
Tournaments with near-linear transitive subsets
An updated survey on the linear ordering problem for weighted or unweighted tournaments
Some counterexamples in the partition calculus
Majority decisions when abstention is possible
A short proof of a theorem of Reid and Parker on tournaments
Weak covering relations
A conjecture on the construction of orderings by Borda's rule
A survey on the linear ordering problem for weighted or unweighted tournaments
On the dichromatic number of surfaces
The computational difficulty of manipulating an election
Elections generate all binary relations on infinite sets
What majority decisions are possible
Condorcet choice correspondences: A set-theoretical comparison
Erdös–Hajnal conjecture for new infinite families of tournaments
Orientation Ramsey thresholds for cycles and cliques
On the local structure of oriented graphs -- a case study in flag algebras
On 1-subdivisions of transitive tournaments
Covering small subgraphs of (hyper)tournaments with spanning acyclic subgraphs
Some Ramsey nu mbers for directed graphs
Polynomial Time Algorithms for Tracking Path Problems
Domination in tournaments
An application of the Ramsey theorem to ordered r-tournaments
Internal coverings of sets by asymmetric relations
A computational analysis of the tournament equilibrium set
Majority tournaments: Sincere and sophisticated voting decisions under amendment procedure
Voting schemes for which it can be difficult to tell who won the election
A tournament approach to pattern avoiding matrices
Construction of voting situations concordant with ranking patterns
Heroes in orientations of chordal graphs
Sets whose differences avoid squares modulo \(m\)
About the Erdős-Hajnal conjecture for seven-vertex tournaments
The smallest 5-chromatic tournament
Ramsey numbers of sparse digraphs
Forbidding couples of tournaments and the Erdös-Hajnal conjecture
On the abstract chromatic number and its computability for finitely axiomatizable theories
Forests and the strong Erdős-Hajnal property
Ordering transactions with bounded unfairness: definitions, complexity and constructions
Antidirected spanning closed trail in tournaments
Turán problems for oriented graphs
Finding and counting small tournaments in large tournaments
Impossibility theorems involving weakenings of expansion consistency and resoluteness in voting
Almost full rank matrices arising from transitive tournaments

This page was built for publication: The Voting Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3263757)