The Voting Problem
From MaRDI portal
Publication:3263757
DOI10.2307/2310461zbMath0090.25101OpenAlexW4206755783WikidataQ56503959 ScholiaQ56503959MaRDI QIDQ3263757
Publication date: 1959
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2310461
Related Items (65)
An application of the Ramsey theorem to ordered r-tournaments ⋮ On the dichromatic number of surfaces ⋮ On 1-subdivisions of transitive tournaments ⋮ Polynomial Time Algorithms for Tracking Path Problems ⋮ A characterization of the \(n\)-agent Pareto dominance relation ⋮ Heroes in Orientations of Chordal Graphs ⋮ Weak covering relations ⋮ A short proof of a theorem of Reid and Parker on tournaments ⋮ A conjecture on the construction of orderings by Borda's rule ⋮ Simple games with many effective voters ⋮ Polynomial time algorithms for tracking path problems ⋮ Turán theorems for unavoidable patterns ⋮ A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ On the local structure of oriented graphs -- a case study in flag algebras ⋮ Voting schemes for which it can be difficult to tell who won the election ⋮ Condorcet choice correspondences: A set-theoretical comparison ⋮ On the abstract chromatic number and its computability for finitely axiomatizable theories ⋮ A simple voting scheme generates all binary relations on finite sets ⋮ On a problem of Erdős and Rado ⋮ Unavoidable Subtournaments in Large Tournaments with No Homogeneous Sets ⋮ Coloring the nodes of a directed graph ⋮ About the Erdős-Hajnal conjecture for seven-vertex tournaments ⋮ Ranking graphs through hitting times of Markov chains ⋮ The smallest 5-chromatic tournament ⋮ Antidirected spanning closed trail in tournaments ⋮ Erdös–Hajnal conjecture for new infinite families of tournaments ⋮ Construction of voting situations concordant with ranking patterns ⋮ Unavoidable tournaments ⋮ Almost full rank matrices arising from transitive tournaments ⋮ Forests and the strong Erdős-Hajnal property ⋮ Covering small subgraphs of (hyper)tournaments with spanning acyclic subgraphs ⋮ Forbidding couples of tournaments and the Erdös-Hajnal conjecture ⋮ Incoherent majorities: the McGarvey problem in judgement aggregation ⋮ Tournaments with near-linear transitive subsets ⋮ Paths with many shortcuts in tournaments ⋮ An extension of McGarvey's theorem from the perspective of the plurality collective choice mechanism ⋮ New bounds on the Ramsey number \(r ( I_m , L_n )\) ⋮ What shall we do with the cyclic profile? ⋮ Majority tournaments: Sincere and sophisticated voting decisions under amendment procedure ⋮ Voting Procedures, Complexity of ⋮ Elections generate all binary relations on infinite sets ⋮ Domination in tournaments ⋮ A tournament approach to pattern avoiding matrices ⋮ Discrete Mathematics in Voting and Group Choice ⋮ A computational analysis of the tournament equilibrium set ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ A bijection between the \(d\)-dimensional simplices with distances in \(\{1,2\}\) and the partitions of \(d+1\) ⋮ Dictators on blocks: Generalizations of social choice impossibility theorems ⋮ Extension of Gyárfás-Sumner conjecture to digraphs ⋮ Efron's coins and the linial arrangement ⋮ What majority decisions are possible ⋮ Majority decisions when abstention is possible ⋮ The computational difficulty of manipulating an election ⋮ \(k\)-majority digraphs and the hardness of voting with a constant number of voters ⋮ Internal coverings of sets by asymmetric relations ⋮ Some counterexamples in the partition calculus ⋮ On \(\lambda\)-majority voting paradoxes ⋮ Sets whose differences avoid squares modulo 𝑚 ⋮ Some Ramsey nu mbers for directed graphs ⋮ Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth ⋮ Orientation Ramsey Thresholds for Cycles and Cliques ⋮ Forcing large transitive subtournaments ⋮ Voting paradoxes and digraphs realizations ⋮ Outranking Relations: Do They Have Special Properties? ⋮ Coloring the edges of a directed graph
This page was built for publication: The Voting Problem
