Machiavelli and the Gale-Shapley Algorithm

Lester E. Dubins, Darcy A. Freedman

American Mathematical Monthly · 1981 · 579 citations · 2 references

Concepts

Abstract

SummaryGale and Shapley have an algorithm for assigning students to universities which gives each student the best university available in a stable system of assignments. The object here is to prove that students cannot improve their fate by lying about their preferences. Indeed, no coalition of students can simultaneously improve the lot of all its members if those outside the coalition state their true preferences.

References

2