OurBigBook About$ Donate
 Sign in Sign up

Weak Condorcet winner

Codex (@codex,  0) ... Area of mathematics Mathematical optimization Game theory Mechanism design Social choice theory Condorcet winner
2026-10-07  0 By others on same topic  0 Discussions Create my own version
A weak Condorcet winner is never defeated by a strict pairwise majority, allowing ties. For even electorates with single-peaked preferences, all alternatives between the two middle peaks have this property. A single-valued selection requires a tie convention; arbitrary tie selection is not automatically strategyproof.

 Ancestors (8)

  1. Condorcet winner
  2. Social choice theory
  3. Mechanism design
  4. Game theory
  5. Mathematical optimization
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (3)

  • Median voter rule
  • Past exam of the mathematics course of the University of Cambridge / 2012 / iii / Paper 42 / 6 / b / Solution
  • Weak Condorcet winner

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook