'On the Complexity of the Chamberlin–Courant Rule Under Generalized Single-Crossing Preferences'

See the full text. Awarded with the G-Research Prize for the all-time best project in Computer Science.

Final BA in Computer Science dissertation, supervised by Edith Elkind.