1981/08/01 by L. E. Dubins, Lester E. Dubins, D. A. Freedman +1 · 14 citations
Economics, Econometrics and Finance · Decision Sciences · #Game Theory and Voting Systems #Auction Theory and Applications #Game Theory and Applications
paper · doi:10.1080/00029890.1981.11995301
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.