Fairly / The Queue and Other Everyday Systems

What a well designed allocation actually balances

Every scheme trades away something, and the honest ones say which.

Take a small case: one visitor parking bay for a building with eight flats. First come first served favours whoever is home. A roster is predictable but wastes the bay when the rostered flat has no visitors. A booking sheet responds to actual need but only if people fill it in honestly and in advance. Allocating it to the flat with the most visiting relatives responds to need but requires somebody to judge whose relatives count. Four rules, four different sets of winners, and no arrangement of them that makes all the losses disappear.

The lesson is not that one of these is correct. It is that the choice is a choice between costs, and the costs are of different kinds: information required, effort to administer, ease of gaming, predictability, and responsiveness to circumstance. A scheme that is very responsive to need will be expensive to run and easy to exploit. A scheme that is cheap and hard to exploit will be blind to circumstances that genuinely matter. You are choosing which of those you can most afford to lose, given how much a parking bay actually matters to eight households.

So the mark of a well designed allocation is not that nobody objects. It is that the designers can say plainly what the scheme sacrifices and why they accepted that sacrifice. A booking sheet with a note explaining that it will sometimes leave the bay empty, and that this was preferred to arguments about whose visitor was more important, is a better system than the same sheet with no note. The note does not change who parks where. It changes whether the next dispute is about the bay or about the people.