This chapter introduces the stable matching problem created by David Gale and Lloyd Shapley. We discussed this problem in class at great length and this chapter of the book covers this problem at even greater length for better or for worse. As far as readability is concerned, this chapter is substantially less readable and therefore I would give it a 5/10. This chapter takes a hit on readability because we covered it so well in class that I felt like I wasn't receiving much more information out of reading all 19 pages of it. The motivation for this problem was the question of: “Could one design a college admissions process, or a job recruiting process, that was self-enforcing? What did they mean by this?” This chapter did a lot to reinforce my understanding of the problem covered in class but I cannot say that I learned much more about it by reading the chapter. I did, however, benefit from learning more about the Five Representative Problems such as interval scheduling, etc.