Computational Aspects of Multi-Winner Approval Voting. - Haris Aziz 001; Serge Gaspers; Joachim Gudmundsson; Simon Mackenzie; Nicholas Mattei; Toby Walsh (MPREF@AAAI, 2014)

Fixing a Balanced Knockout Tournament. - Haris Aziz 001; Serge Gaspers; Simon Mackenzie; Nicholas Mattei; Paul Stursberg; Toby Walsh (AAAI, 2014)

Structure and complexity of ex post efficient random assignments. - Haris Aziz 001; Simon Mackenzie; Lirong Xia; Chun Ye (CoRR, 2014)

Manipulating the Probabilistic Serial Rule. - Haris Aziz 001; Serge Gaspers; Simon Mackenzie; Nicholas Mattei; Nina Narodytska; Toby Walsh (AAMAS, 2015)

Ex post Efficiency of Random Assignments. - Haris Aziz 001; Simon Mackenzie; Lirong Xia; Chun Ye (AAMAS, 2015)

Equilibria Under the Probabilistic Serial Rule. - Haris Aziz 001; Serge Gaspers; Simon Mackenzie; Nicholas Mattei; Nina Narodytska; Toby Walsh (IJCAI, 2015)

Fair assignment of indivisible objects under ordinal preferences. - Haris Aziz 001; Serge Gaspers; Simon Mackenzie; Toby Walsh (Artif. Intell., 2015)

Egalitarianism of Random Assignment Mechanisms. - Haris Aziz 001; Jiashu Chen; Aris Filos-Ratsikas; Simon Mackenzie; Nicholas Mattei (CoRR, 2015)

Pillage games with multiple stable sets. - Simon Mackenzie; Manfred Kerber; Colin Rowat (Int. J. Game Theory, 2015)

Two desirable fairness concepts for allocation of indivisible objects under ordinal preferences. - Haris Aziz 001; Serge Gaspers; Simon Mackenzie; Toby Walsh (SIGecom Exch., 2015)

Egalitarianism of Random Assignment Mechanisms: (Extended Abstract). - Haris Aziz 001; Aris Filos-Ratsikas; Jiashu Chen; Simon Mackenzie; Nicholas Mattei (AAMAS, 2016)

A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents. - Haris Aziz 001; Simon Mackenzie (FOCS, 2016)

A discrete and bounded envy-free cake cutting protocol for four agents. - Haris Aziz 001; Simon Mackenzie (STOC, 2016)

Complexity of Manipulating Sequential Allocation. - Haris Aziz 001; Sylvain Bouveret; Jérôme Lang; Simon Mackenzie (AAAI, 2017)

Bounded and envy-free cake cutting. - Haris Aziz 001; Simon Mackenzie (SIGecom Exch., 2017)

Upper bounds for cake cutting. - Simon Mackenzie (2017)

Fixing balanced knockout and double elimination tournaments. - Haris Aziz 001; Serge Gaspers; Simon Mackenzie; Nicholas Mattei; Paul Stursberg; Toby Walsh (Artif. Intell., 2018)

On the number of minimal separators in graphs. - Serge Gaspers; Simon Mackenzie (J. Graph Theory, 2018)

The Provable Virtue of Laziness in Motion Planning. - Nika Haghtalab; Simon Mackenzie; Ariel D. Procaccia; Oren Salzman; Siddhartha S. Srinivasa (IJCAI, 2019)

A bounded and envy-free cake cutting algorithm. - Haris Aziz 001; Simon Mackenzie (Commun. ACM, 2020)

Liquid Democracy: An Algorithmic Perspective. - Anson Kahng; Simon Mackenzie; Ariel D. Procaccia (J. Artif. Intell. Res., 2021)

The Fluid Mechanics of Liquid Democracy. - Paul Gölz; Anson Kahng; Simon Mackenzie; Ariel D. Procaccia (ACM Trans. Economics and Comput., 2021)

A novel data solution to inform curriculum decolonisation: the case of the Imperial College London Masters of Public Health. - Robyn Price; Mark Skopec; Simon Mackenzie; Coco Nijhoff; Ruth Harrison; Gemma Seabrook; Matthew Harris (Scientometrics, 2022)

Refuting the Direct Sum Conjecture for Total Functions in Deterministic Communication Complexity. - Simon Mackenzie; Abdallah Saffidine (STOC, 2025)