New research article by Péter Biró and co-authors a Theoretical Computer Science
Stable matching with uncertain pairwise preferences Haris Aziz, Péter Biró, Tamás Fleiner, Serge Gaspers, Ronaldde Haan, Nicholas Mattei, Baharak Rastegari Abstract We study a two-sided matching problem under preferences, where the agents have independent pairwise comparisons on their possible partners and these preferences may be uncertain. Preferences may be intransitive […]