Fairness in Combinatorial Optimization


Optimum solutions of basic fundamental combinatorial optimization problems (like matching, vertex cover, traveling salesperson problem) consist of a selection of vertices or edges. In real-life these selections often stand for important choices, like receiving a transplant, being assigned to a school, getting a scholarship. The question of individual fairness is then an intriguing one. The aim is to explore this issue by developing standards of fairness, and next aiming to establish the tractability of finding solutions that satisfy these standards. 

Supervisors Frits Spieksma (TU/e) and Christopher Hojny (TU/e)
PhD Student Sten Wessel
Location Eindhoven University of Technology (TU/e)