What is the main idea of the passage?

School matching procedures can create stable assignments from preferences and priorities, but stability does not settle capacity or fairness questions. (The passage explains the procedure and stability, then separates mathematical properties from policy values and scarcity.)

Why can a stable outcome still disappoint many students?

Stability prevents blocking pairs but cannot create additional seats or guarantee first choices. (The third paragraph distinguishes the technical definition from satisfaction and notes that rearrangement cannot eliminate shortages.)

What does “tentatively” mean in the procedure?

provisionally, with the possibility of later change (Schools can reconsider the held set when new applications arrive, so the early holds are not final.)

When does the application cycle end?

when no further applications remain (The second paragraph explicitly gives the stopping condition before tentative seats become final.)

Matching Students to Schools: Level 5 Reading Comprehension Questions

Suppose students rank schools, while each school has limited seats and a stated priority order. Assigning students one by one can create a troubling result: a student prefers another school, and that school would also prefer the student over someone it received. Such a pair has an incentive to abandon the official assignment. In matching theory, an arrangement with no such blocking pair is called stable.

One well-known procedure begins with students applying to their highest-ranked school. Each school tentatively holds applicants up to capacity according to its priorities and rejects the rest. Rejected students apply to their next choices. Schools reconsider their held set when new applications arrive. The cycle ends when no further applications remain, and tentative places become final.

The procedure can produce a stable match under its formal assumptions, but “stable” does not mean everyone gets a first choice or regards the outcome as fair. Priorities may reflect distance, siblings, lotteries, exams, or policy decisions. Changing those rules changes the result. Capacity shortages cannot be solved by rearranging names alone.

Strategy also matters. In the student-proposing version under the standard model, reporting true preferences has a protective property for students. Real enrollment systems, however, may add categories, rounds, or constraints outside the simple model. Administrators must verify what their rules guarantee. Matching mechanisms organize competing preferences transparently; they do not choose society's values. Mathematics can show consequences of a priority structure, but communities still decide which priorities deserve authority and how to support students when desired seats are scarce.

Comprehension questions