Machiavelli and the Gale-Shapley Algorithm

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.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 655 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.