Stable Roommate with Narcissistic, Single-Peaked, and Single-Crossing Preferences
ADT, pp. 315-330, 2020.
The classical Stable Roommate problem asks whether it is possible to pair up an even number of agents such that no two non-paired agents prefer to be with each other rather than with their assigned partners. We investigate Stable Roommate with complete (i.e. every agent can be matched with every other agent) or incomplete preferences, wit...More
PPT (Upload PPT)