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