A note on the voting problem

MaRDI QIDQ5285641zbMATH OpenFDO

Authors

Publication date 29 June 1993

Full work available at URL https://arxiv.org/abs/1206.0779, https://eudml.org/doc/39290

zbMATH Keywords

strong preference patterntransitive preferences

Mathematics Subject Classification ID

Voting theory (91B12)

Abstract: Let $v(n)$ be the minimum number of voters with transitive preferences which are needed to generate any strong preference pattern (ties not allowed) on $n$ candidates. Let $k=lfloorlo{g}_{2}nfloor$. We show that $v(n)len-k$ if $n$ and $k$ have different parity, and $v(n)len-k+1$ otherwise.

Recommendations

• scientific article; zbMATH DE number 878682
• A note on ``A solution method to the problem proposed by Wang in voting systems
• A note on voting
• REMARKS ON A PROCEDURAL CONDITION FOR THE VOTING PARADOX
• One dynamic problem in voting theory. II
• On some paradoxes in voting theory
• One dynamic problem in voting theory. I
• A note on the core of voting games
• The Ballot Problem Revisited

Cited in

(12)

• One dynamic problem in voting theory. I
• Efficient voting with penalties
• \(k\)-majority digraphs and the hardness of voting with a constant number of voters
• The voter basis and the admissibility of tree characters
• scientific article; zbMATH DE number 3847164 (Why is no real title available?)
• A simple voting scheme generates all binary relations on finite sets
• REMARKS ON A PROCEDURAL CONDITION FOR THE VOTING PARADOX
• Voting with a Logarithmic Number of Cards
• Construction of voting situations concordant with ranking patterns
• An additional player in the voting by veto problem
• Multiple voting location problems
• A solution method to the problem proposed by Wang in voting systems

This page was built for publication: A note on the voting problem

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