voting-paradox Mathematics

It rules out the existence of a perfect electoral rule. Arrow asked a rule to accept any profile of individual rankings (unrestricted domain), follow unanimity (the Pareto principle), keep the contest between two candidates unaffected when a third enters or quits (independence of irrelevant alternatives), and grant nobody unilateral say (non-dictatorship). His 1951 proof shows these demands collide irreconcilably once three or more options exist: somebody's ranking always becomes society's. Every voting system thus breaks down or invites strategic manipulation under some configuration, leaving designers nothing but trade-offs.

It cannot be stamped out — that is the Gibbard-Satterthwaite theorem: with three or more options, every onto and non-dictatorial voting rule leaves room for manipulation, meaning some preference profile always exists under which a voter gains by misreporting a ranking instead of voting honestly. It stands back to back with Arrow's impossibility theorem: Arrow ruled out a perfect collective ranking, while this result closes off manipulation-proof rules altogether, leaving real elections to weigh tolerated strategic behavior against other defects.

It is the Condorcet paradox, also called the voting cycle. Let the three voters rank A over B over C, B over C over A, and C over A over B. In head-to-head contests A beats B two to one, B beats C the same way, then C beats A, looping the collective preference into a closed ring with no consensus winner. Majority rule thus cannot weld individual rankings into one consistent social ordering, and agenda control becomes power itself: fix the order of the pairwise duels and you can manufacture whichever winner you want.