Abstract:
This talk is based on “Equitable Stable Matchings Under Modular Assessment” (A. Alkan and K. Yıldız 2025) where we address whether “fairness” may be defined in a satisfactory way, conceptually as well as computationally, in the Stable Marriage Game. We are critical on basic grounds about the various formulations present, some of which moreover fare not well regarding computational complexity. The framework we offer overrides these issues making use of a novel criterion for lattices described as “mixture closedness”.

Ahmet Alkan

Natuk Birkan Building, Murat Sertel Faculty Lounge

December 12, 2025 - 15:00