The Extra Seat That Makes One Group Smaller

There are ten seats around the table. Three groups must share them in proportion to their size. You work out a rule, check the arithmetic and distribute every seat. Then somebody brings an eleventh chair. Surely no group can be worse off.

Under the largest-remainder method, one can. The surprise is called the Alabama paradox. It is not a story about a population shrinking, a vote being removed or an accountant losing a chair. The population weights stay fixed while the total allocation grows.

Adding a unit changes every quota and the contest among fractional remainders. The trays are a metaphor, not the counted example.

Build the smallest useful scene

Use three fictional groups with weights 6, 6 and 2. Their total is 14. With ten seats, their exact proportional quotas are 60/14, 60/14 and 20/14: approximately 4.286, 4.286 and 1.429.

The rule first gives everyone the whole-number part: four seats, four seats and one seat. Nine seats have been assigned. The final seat goes to the largest fractional remainder. Group C’s remainder is 6/14; A and B each have 4/14. C receives the last seat, so the final distribution is 4, 4, 2.

This is the Hamilton, or largest-remainder, approach described in the Census Bureau’s methods account. The numbers here are an original compact illustration, not historic census populations.

Now add the chair

For eleven seats the quotas become 66/14, 66/14 and 22/14: about 4.714, 4.714 and 1.571. The whole-number allocations are again four, four and one. But two seats remain. A and B each have a remainder of 10/14, ahead of C’s 8/14. They receive those seats.

The new distribution is 5, 5, 1. C’s exact quota increased from about 1.429 to about 1.571, yet its actual seat count fell from two to one. Everyone’s quota grew; the ordering of the remainders changed. No arithmetic error is required.

You can audit this result without decimals. At ten seats, compare integer remainders 4, 4 and 6 over the common denominator 14. At eleven, compare 10, 10 and 8. The ordering has genuinely changed. Rounding a displayed quota to three decimal places cannot be blamed for the lost chair.

Add one seat; watch the remainders

A largest-remainder allocation for weights 6,6,2 shows the Alabama paradox between ten and eleven seats.

Open add one seat; watch the remainders in its own window.

Use the control to move from ten to eleven, then from eleven to twelve. Watch the fractional parts rather than only the quotas. A remainder climbs until its quota crosses an integer, where the remainder resets. The competition is continually reorganized by those crossings.

A fair-looking rule can miss a different kind of fairness

Largest remainder has an immediately attractive feature: each group receives either the floor or the ceiling of its exact quota. Our C receives its ceiling at ten seats and its floor at eleven. Both allocations respect that quota condition.

The condition that nobody should lose when the total grows is different. It is usually called house monotonicity. The Census Bureau’s historical perspective identifies the Alabama paradox as a difficulty of the Hamilton/Vinton method. The name marks an episode in apportionment history; the mechanism applies more generally wherever whole units are shared proportionally by this rule.

Distinguishing criteria is more useful than declaring the calculation “unfair” and stopping. Would your group rather preserve each exact quota’s neighboring integers, prevent losses when the pool grows, or minimize some measure of population per seat? Those are different questions. A rule should be judged against the properties it was actually chosen to deliver.

Try allocating something besides seats

Imagine three departments sharing ten identical display panels in proportion to request weights 6, 6 and 2. Write the 4–4–2 allocation. Then announce that eleven panels are available and recompute the same rule. The department with two panels now receives one.

If the panels have already been installed, that rule creates a practical problem. You might instead decide that additional panels can only be assigned, never taken back. That is a change to the allocation procedure. State it before using the rule, because a sequence of additions need not match a fresh largest-remainder allocation of the final total.

Svante Janson and Svante Linusson’s research on the paradox studies its probability under specified assumptions. The existence of such research should not be mistaken for a single universal frequency. Real populations, the chosen total and the model of changing house size all matter.

The eleventh chair has exposed a seam between continuous shares and discrete objects. Fractions can all rise smoothly. Chairs must land somewhere, one at a time. Before trusting a proportional rule, it helps to ask what happens when the table gets a little bigger.

Sources and further exploration: Census Bureau: methods of apportionment; Census Bureau: historical perspective; Janson and Linusson: probability of the Alabama paradox.

Explore all 50 new articles · Browse the complete illustrated collection

Explore more art, ideas, and independent projects at Incoprea.

The Queue Has an Invisible Area: A Practical Way to See Little’s Law

The coffee line looks short. Your cup still takes ages. Across the street, a longer line seems to move briskly. Counting heads feels like a useful estimate until you notice that a queue has two other dimensions: how fast people pass through it, and how long each remains inside.

Little’s law connects those three quantities. Its beauty is that you can understand the accounting before learning a probability distribution. The important first move is surprisingly physical: decide exactly where the system begins and ends.

A short line is only a snapshot. Flow and time inside the chosen boundary complete the accounting.

Draw a boundary around the question

Does your clock start when someone joins the line, or when they place an order? Does it stop at payment, at the handover of a drink, or when they leave the shop? Each choice can be sensible. Mixing the choices cannot.

John Little’s 1961 paper supplied a formal proof for the relationship usually written L = λW. L is average number inside the chosen system, λ is average flow entering it, and W is average time spent there. The quantities need compatible definitions and conditions under which the averages make sense.

Take an invented steady example: 18 customers per hour enter the order-to-handover process, and the average time inside is ten minutes. Ten minutes is one-sixth of an hour. Multiplication gives an average of three customers in that process. It does not say that exactly three customers are present at every instant.

One useful habit is to carry the units through the multiplication. Customers per hour multiplied by hours per customer leaves customers. If your result still contains minutes per hour, the times have not been converted consistently. This simple check catches an error that can survive several lines of confident arithmetic.

The hidden unit is a person-minute

Imagine one visitor staying four minutes. That contributes four person-minutes. Two visitors present together for those four minutes contribute eight. Adding the time contributed by each visitor produces the same total as watching the changing occupancy and adding its area across time.

That second viewpoint is developed in Larson and Odoni’s queueing chapter. It turns a collection of individual experiences into an occupancy history. A tall narrow patch and a low wide patch can have the same area: many people for a short time, or fewer people for longer.

Before touching the control below, predict the result of doubling every visitor’s stay. The total person-minutes will double. The observation window also changes, so average occupancy will not simply double in this particular finite example.

Count the same waiting time two ways

A finite three-visit ledger demonstrates the exact person-minute identity without claiming a service-capacity model.

Open count the same waiting time two ways in its own window.

At the default setting, the three visits contribute twelve person-minutes over an eight-minute window. Average occupancy is 1.5 people; the arrival rate is three-eighths of a person per minute; each stay is four minutes. The product returns 1.5. Fractional people are perfectly sensible as an average over time.

The equation checks a story; it does not supply every cause

A manager could look at L = λW and announce that admitting twice as many people will halve their wait. The algebra cannot justify that announcement. If arrivals increase, the average number inside may rise instead. The equation constrains compatible averages; a service model is needed to predict how they respond to a change.

Cathy Wu’s MIT queueing lecture separates arrival rate, service mechanisms, buffer capacity and queue discipline. That distinction matters. The same average flow could coexist with smooth arrivals or bursts, fast routine orders or a few very slow ones, one server or several.

It also matters whose experience you count. If people leave before being served, an average for completed orders excludes them. A boundary that includes everyone who joins needs their exits and time too. Averages compiled from different populations can produce a convincing-looking calculation that describes nobody’s actual system.

A five-minute observation exercise

Choose a harmless, publicly observable process such as a staffed library return desk. Write down your boundary first. Count the people currently inside at regular intervals, and separately count exits. Do not record identities. A short sample is useful for noticing bursts and ambiguity, not for claiming a reliable long-run wait estimate.

Ask what your sample misses: people already waiting at the start, people still present when you stop, or a rush arriving immediately afterward. Those edge cases explain why a carefully defined finite ledger is easier than treating any five-minute snapshot as the whole day.

The most useful question at the next slow queue may therefore be, “What am I counting?” A line is a scene in front of you. A queueing system includes boundaries, flows and time. Once those are visible, the mysterious delay acquires an accounting structure you can investigate.

Sources and further exploration: Little: A Proof for the Queuing Formula; Larson and Odoni: important queueing relationships; Cathy Wu: MIT queueing models.

Explore all 50 new articles · Browse the complete illustrated collection

Explore more art, ideas, and independent projects at Incoprea.