Learn More
One of the oldest but least understood matching problems is Gale and Shapley's (1962) " roommates problem " : is there a stable way to assign 2N students into N roommate pairs? Unlike the classic marriage problem or college admissions problem, there need not exist a stable solution to the roommates problem. However, the traditional notion of stability(More)
Envy of another person's assignment is ``justified'' if you ``deserve'' the object and it is possible to assign you to the object. Currently, the literature only considers whether or not the agent deserves the object and ignores whether or not assigning her to it is possible. This paper defines a fair set of assignments in terms of what is possible. We(More)
  • 1