The Voting Problem - MaRDI portal

Cited in

(70)

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