44 citations · 80 across the 32 of their papers we have counts for
1 paper · 1 filter
Jochen Koenemann, Kanstantsin Pashkovich, Natig Tofigzade
Finding a stable matching is one of the central problems in algorithmic game theory. If participants are allowed to have ties and incomplete preferences, computing a stable matchin…