Social Choice and Welfare, Vol. 35, No. 4 (October 2010), pp. 647-667 (21 pages) We consider one-to-one, one-sided matching (roommate) problems in which agents can either be matched as pairs or remain ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results