VotingwithArrow

After Kenneth J. Arrow, A Difficulty in the Concept of Social Welfare, 1950

Voting is easy. Counting is the hard part.

A small Swiss village. Two voters, Anna and Bruno. Three plans for the empty square: a fountain, a tower, a tree. Next Sunday they vote. Each writes the three plans on a ballot, favourite on top.

You count. If the two agree, counting is easy. If they disagree, it is one vote each, a tie, and you break it.

But fair means you say now, before the vote, how you will break every tie that can come up. You write it in a book. Then nobody can say the count was fixed afterwards.

AimWrite a book that never contradicts itself, without making one voter the boss.

Arrow proved in 1950 that nobody can do both. Try anyway, and see what gets in the way.

Aim
Never contradict yourself, and nobody the boss.

Your book

Anna can write her ballot six ways, and so can Bruno. So 36 different votes can come in next Sunday, and you will write a book that can be consulted for every one.

Where Anna and Bruno fill in the ballot the same way, it is easy: that is the answer. Where they differ, your book must choose.

You might be tempted to count points: 3 for a first place, 2 for a second, 1 for a third, add them up, highest wins. But that assumes something you do not know: that the step from first to second matters as much as the step from second to third, and as much to Anna as to Bruno. A ballot only says what is above what. So no points.

What is left is this. You will see three what-ifs, three of the 36 votes, and make two decisions for each: what goes on the square, and what if that falls through, for whatever reason. For each decision you pick one plan, or call it a draw and the village tosses a coin. Sometimes the second decision is already made by the first, and the game says so. And these six decisions fill all six lines of your book.

Sounds like magic? Almost. Here is the thing. Take the plans two at a time. Fountain or tower? If both put the same one higher, that settles it. If not, it is a tie, and your book says who gets their way, or calls it a draw. The same for the other two pairs. Three pairs, two ways to disagree about each: six ties, six lines.

The three what-ifs are chosen so that between them you break every one of the six. Then your book can be consulted on any vote: fountain or tower, tower or tree, tree or fountain, three results.

Two rules for your book.

1. Never contradict yourself. If the fountain is above the tower, and the tower above the tree, then the fountain is above the tree. Sounds obvious, but it is tricky: your book answers the three pairs separately, and three separate answers can clash. The village will still decide (the plan nothing is above goes on the square, or a coin), but Arrow goes through all 36 votes and counts every clash.

2. Nobody is the boss. A voter who wins every tie is the boss, and then the other one might as well stay at home.

Your score is how many of the 36 votes your book counts fairly: a vote with a clash does not count, and with a boss none of them count. The best any book can do is 34, and that scores 100. Arrow proved in 1950 that no book keeps both rules, so 100 already has two clashes in it. See how close you get.

Aim
Never contradict yourself, and nobody the boss.
1What if
1 of 3
1What if they write this?
Anna
    Bruno
      2Then what goes on the square?

      3Your book

      Aim
      Never contradict yourself, and nobody the boss.

      Arrow checks the rest

      Your book is full: all six ties are broken. So for any vote it gives three results, one per pair of plans. Anna can write her ballot 6 ways, and so can Bruno: 36 ways the vote can go, one square each. Arrow checks, on every one, whether the three results fit together into a ranking.

      0 fit together0 contradict
      Red hatching: on that vote the book’s three results contradict each other. The village decides anyway: the plan shown, or a coin where more than one is shown. Red corner: the answer is exactly Anna’s ballot. Black corner: the answer is exactly Bruno’s ballot.

      Aim
      Never contradict yourself, and nobody the boss.

      Arrow’s offer

      1The rewritten book

      2Arrow checks it
      0 fit together0 contradict

      Aim
      Never contradict yourself, and nobody the boss.

      Sunday

      The real vote. Anna and Bruno write their ballots, and your book counts them.

      Anna
        Bruno

          1Why the best is 34 and not 36
          2Arrow’s proof, in pictures

          Why no book can do it. Read it like a comic strip.

          3Why no points

          You were told at the start: no counting points. Here is what goes wrong if you do.

          So a counting rule has three doors.

          Let a third plan decide between two, as points do. Let one voter decide: a boss. Or accept that some votes get no answer. Arrow proved there is no fourth door. Every way of counting anyone has ever proposed goes through one of the three; the argument is only about which. Arrow himself accepted the first rule (no third plan) as a matter of fairness, and said so.

          4The brute-force check

          Is a boss just bad luck?

          No. The answer may be exactly Anna’s ballot on one vote, and it has to be when the two agree on everything. A boss is the voter whose ballot is the answer on every one of the 36 votes, whatever the other one writes. Arrow’s word is dictator.

          Why not toss a coin for each tie?

          Then the same two ballots could get one answer today and another tomorrow. And a coin can land in a circle too: Fountain above Tower, Tower above Tree, Tree above Fountain, and nobody is first.

          Would more voters fix it?

          Why must the same tie get the same answer?

          So that fountain against tower is decided by what people think of the fountain and the tower, and not of the tree. Arrow’s example: an election counted in points. One plan wins. Then a losing plan drops out, nobody changes their mind, and the count is suddenly a tie.

          Arrow’s theorem is not that voting is broken. It is that a democracy has to live with small imperfections. Get rid of every one of them and you end up with a dictator.

          So is voting broken?

          No. Look how many squares had an answer. Arrow showed that no way of counting is safe on every possible vote: each one gives something up. Which one a country uses is a choice, and now that you can vote, it is partly yours.

          How to play

          Aim: write a book that never contradicts itself, without making one voter the boss. Arrow proved that nobody can do both; the score says how close you got.

          Your book

          36 votes can come in, but a tie is always about two plans: Anna puts one higher, Bruno the other. Three pairs of plans, two ways round: six ties, six lines in the book. No counting points: a ballot says only what is above what, not by how much. And a ranking must hang together: if the fountain is above the tower and the tower above the tree, the fountain is above the tree. Three separate answers can break that.

          The what-ifs

          The vote is next Sunday. Before it, the counting rule has to be written down. Arrow shows you a pair of ballots, Anna’s in red and Bruno’s in black, favourite on top, and asks: if they write this, what goes on the square?

          Settled and tied

          Take the plans two at a time. If both put the same one higher, that is settled, 2–0. If each puts a different one higher, it is 1–1: a tie, and your answer breaks it, for Anna, for Bruno, or as a draw (the village likes both the same and will toss a coin).

          Answering

          Say what goes on the square. Then, if more than one answer is still possible, what comes next if that falls through; plans do fall through, and the village should not have to vote again. When the second decision is already made by the first, the game says so instead of asking. Then press Write it in the book.

          Your book

          Six different ties can happen. Once you break one, the book keeps your answer, and that tie gets the same answer whenever it comes up again. Three what-ifs fill the book.

          Arrow checks the rest

          Arrow tries all 36 ways the vote can go. For each, the book gives three results, one per pair of plans. A square with a ranking means the three fit together. A red hatched square means they contradict each other (fountain above tower, tower above tree, but tower above fountain); the village still decides, by the plan nothing is above or by a coin, but the vote does not count as fair, and the box under the sheet says why. A red or black corner means the ranking is exactly that voter’s ballot. Touch any square to read it.

          Arrow’s offer

          If your book contradicts itself anywhere, Arrow offers you a rewritten book with no clash at all. Look at it before you adopt it. If you adopt it, Sunday is counted with the new book, and the debrief shows what your own book would have scored.

          Sunday

          The real vote, drawn by chance from the 36. Your book counts it, line by line, and something goes on the square.

          The debrief

          Your score: votes counted fairly, out of 36, as a share of the best possible (34 is 100; a boss is 0). Then why the best is 34, Arrow’s proof as a strip of pictures, why points go wrong, and every possible book checked.

          About

          Voting with Arrow is built from Kenneth J. Arrow, “A Difficulty in the Concept of Social Welfare”, Journal of Political Economy 58(4), August 1950, pages 328–346, doi:10.1086/256963. It can be read at JSTOR. Game built from this paper; the paper is the authority where the two disagree.

          What the paper says

          Arrow asks whether there is any procedure that turns the rankings of individuals into one ranking for society and meets a few conditions nobody would want to drop. The ranking must be a proper one, with no circles. If everybody raises a plan, society must not lower it. The choice between two plans must depend only on how people rank those two. No result may be fixed in advance against everybody’s wishes. And there must be no dictator: no single person whose preference wins whatever everyone else wants. His theorem: with three or more plans, no procedure meets all of these.

          What the game is

          The game runs Arrow’s own small case, the one his proof uses: two individuals and three alternatives. You are the procedure. The rule that the same tie gets the same answer is his third condition; the rule that agreement wins follows from his second and fourth. That leaves six ties with three answers each, 729 tie-break books in all, and the game checks every one of them on all 36 pairs of ballots. Exactly two never fail, and they are the two dictators.

          The three what-ifs are the game’s: each opens two new ties, and together they fill the book. Arrow’s own proof is the strip of pictures on the debrief: one tie given to a voter, five what-ifs each with only one answer left, and that voter is the boss; so every tie must be a draw, and then one vote has no answer (his equations 1 to 8, pages 341 to 342).

          Sunday, the real vote, is ours: one of the 36 pairs of ballots drawn by chance and counted by your book. So is what the village does when the book’s three results contradict each other: the plan that no other plan is above goes on the square, and where that leaves none or several, a coin. Arrow says only that such a result is not an ordering. And the score is ours: the votes on which the book does not contradict itself, none if one voter is the boss, as a share of 34, the best any book without a boss achieves. The two votes that even the best book loses are the paradox of voting that the paper opens with.

          Mechanism kind: ported

          The points method

          The opening screen tells the player not to count points, and the debrief shows why: a plan nobody moved between can change the result between two others. That is Arrow’s own example against the rank-order method (pp. 337–338), and his third condition is the rule that forbids it. The calibration checks that the points ranking is never blocked during the three what-ifs (each opens only new ties) but disagrees with the finished book on about two thirds of the 36 votes.

          What is left out

          Voters who are indifferent between plans; more voters and more plans; and the second half of the paper, on what the result means for welfare economics, where Arrow shows that rules for dividing goods run into the same wall.

          Names

          Anna and Bruno are Arrow’s individuals 1 and 2. The fountain, the tower and the tree are his x, y and z. Sunday 1 is the pair of rankings from the last step of his proof.

          Type: Inter by Rasmus Andersson, SIL Open Font License. Built with Claude under the paper-to-game skill.