A note on the voting problem

zbMATH Open0767.90007arXiv1206.0779MaRDI QIDQ5285641FDOQ5285641

Author name not available (Why is that?)

Publication date: 29 June 1993

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.

Full work available at URL: https://arxiv.org/abs/1206.0779

zbMATH Keywords

transitive preferencesstrong preference pattern

Mathematics Subject Classification ID

Voting theory (91B12)

Cited In (9)

• \(k\)-majority digraphs and the hardness of voting with a constant number of voters
• An additional player in the voting by veto problem
• One dynamic problem in voting theory. I
• Voting with a Logarithmic Number of Cards
• A solution method to the problem proposed by Wang in voting systems
• REMARKS ON A PROCEDURAL CONDITION FOR THE VOTING PARADOX
• Multiple voting location problems
• Title not available (Why is that?)
• Efficient voting with penalties

Recommendations

• Title not available (Why is that?) 👍 👎
• The Ballot Problem Revisited 👍 👎
• A note on the core of voting games 👍 👎
• ON SOME PARADOXES IN VOTING THEORY 👍 👎
• REMARKS ON A PROCEDURAL CONDITION FOR THE VOTING PARADOX 👍 👎
• One dynamic problem in voting theory. I 👍 👎
• One dynamic problem in voting theory. II 👍 👎
• A note on ``A solution method to the problem proposed by Wang in voting systems 👍 👎
• A note on voting 👍 👎

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)