Placet
🎲

Picking rounds

Everyone picks in turn, in a drawn order.

An order is fixed, usually at random, then each person in turn takes their favourite among whatever is left. Simple, incontestable and honest: lying never helps.

A turn order is drawn — from the poll token, so anyone can verify it. Each person, in turn, receives their favourite among what's left.

Start an assignment with this method →

How it works, precisely

An order is fixed. Drawing lots is the sensible default, because any other order needs justifying — seniority, need and merit are all legitimate, but they are political decisions.

Each person in turn takes their preferred option among those still available. A single pass is enough; the result is immediate and can be checked line by line.

Two proven properties: the outcome is Pareto-efficient (no rearrangement can help someone without hurting someone else) and the mechanism is strategy-proof (declaring your true preferences is always optimal).

A worked example

Four people, four assignments, order drawn at random: Chloé, Ali, Bruno, Dana.

Person1st choice2nd choiceGets
ChloéAuditRedesignAudit
AliAuditSupportSupport
BrunoRedesignAuditRedesign
DanaSupportTrainingTraining
  1. Chloé goes first and takes Audit, her first choice.
  2. Ali wanted Audit: no longer available, he takes Support, his second choice.
  3. Bruno gets Redesign, his first choice; Training is left for Dana.

Three of four people get their first choice. The quality of the result depends entirely on the draw — which is why the order must be announced and verifiable before the assignment.

Where it comes from

The procedure is as old as sharing, but social choice theory formalised it as « serial dictatorship »: at each step one person decides alone — hence the term, which describes the algorithm and not a regime.

It has structured North American sports drafts since 1947 (the NBA), with the order reversed from the standings to rebalance the teams; the draft lottery, introduced in 1985, added chance to discourage deliberate losing.

Economists studied it as the house allocation problem (Hylland and Zeckhauser, 1979). They established that it is one of the rare mechanisms that is both efficient and immune to manipulation.

Where it is used

  • Sharing out assignments, slots, desks or equipment within a team.
  • Sports drafts and player selection.
  • Allocating rooms in halls of residence or shared housing.
  • Choosing internship or dissertation topics among students.

Limits and pitfalls

✓ PROS
  • Impossible to game: ranking sincerely is always best
  • Very easy to explain and accept
  • Verifiable draw, no favouritism possible
✕ CONS
  • The last in line inherit the leftovers
  • Luck weighs heavily on the outcome
  • Ignores preference intensity
Rank inequality
The first almost always gets their wish, the last almost never. Over repeated rounds, the order has to rotate.
No envy-freeness
Whoever is served last may legitimately envy the first. Efficiency does not guarantee the absence of resentment.
Ignores intensity
A vital wish and a lukewarm one weigh the same. If urgency matters, maximum satisfaction fits better.

Frequently asked questions

Should the order be drawn at random?

It is the most defensible default, because it requires no justification. Any other order — seniority, need, merit — is a judgement call to own publicly before the assignment, never after.

Is there any point in lying about my preferences?

No, never, and that is proved. When your turn comes you take the best remaining option: declaring anything else can only hurt you. This is what makes the mechanism strategy-proof.

Serial dictatorship or maximum satisfaction?

Serial dictatorship is transparent and incontestable but depends on the draw. Maximum satisfaction optimises the group total, at the cost of a computation nobody can redo in their head. Choose according to what the group must accept: clarity or the optimum.

See also

Maximum satisfactionTrading circleTwo groups (Parcoursup)

Voting methods