@misc{aziz2026sampford, title={Sampford Apportionment Satisfies Threshold Monotonicity}, author={Aziz, Haris and Mackenzie, Simon and Suzuki, Mashbat}, year={2026}, note={SSRN preprint}, url={https://papers.ssrn.com/sol3/papers.cfm?abstract_id=7346803}, keywords={preprint} } @misc{aziz2026anchor, title={Anchoring for Truthfulness: The Random-Anchor Volume Mechanism for Multi-Facility Location}, author={Aziz, Haris and Mackenzie, Simon and Suzuki, Mashbat}, year={2026}, eprint={2608.16550}, archivePrefix={arXiv}, primaryClass={cs.GT}, keywords={preprint} } @inproceedings{aziz2016discrete, title={A discrete and bounded envy-free cake cutting protocol for any number of agents}, author={Aziz, Haris and Mackenzie, Simon}, booktitle={2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)}, pages={416--427}, year={2016}, organization={IEEE}, keywords={conference} } @inproceedings{mackenzie2025refuting, title={Refuting the Direct Sum Conjecture for Total Functions in Deterministic Communication Complexity}, author={Mackenzie, Simon and Saffidine, Abdallah}, booktitle={Proceedings of the 57th Annual ACM Symposium on Theory of Computing (STOC)}, pages={572--583}, year={2025}, keywords={conference} } @inproceedings{aziz2026fairdivision, title={Fair Division with Indivisible Goods, Chores, and Cake}, author={Aziz, Haris and Lu, Xinhang and Mackenzie, Simon and Suzuki, Mashbat}, booktitle={Proceedings of the 27th ACM Conference on Economics and Computation (EC)}, year={2026}, eprint={2511.04891}, archivePrefix={arXiv}, primaryClass={cs.GT}, note={Forthcoming}, keywords={conference} } @inproceedings{clinch2026counting, title={Faster Exponential-Time Approximate Counting via Bounded Self-Reductions}, author={Clinch, Katie and Gaspers, Serge and Mackenzie, Simon and Wang, Qi}, booktitle={Proceedings of the European Symposium on Algorithms (ESA)}, year={2026}, eprint={2607.06393}, archivePrefix={arXiv}, primaryClass={cs.DS}, note={Forthcoming}, keywords={conference} } @misc{mackenzie2026efx, title={Counterexamples to EFX for Submodular and Subadditive Valuations}, author={Mackenzie, Simon and Suzuki, Mashbat}, year={2026}, eprint={2605.06451}, archivePrefix={arXiv}, primaryClass={cs.GT}, keywords={preprint} } @misc{gaspers2025interlacing, title={NP-Completeness of Deterministic Communication Complexity via Relaxed Interlacing}, author={Gaspers, Serge and He, Tao Zixu and Mackenzie, Simon}, year={2025}, eprint={2508.05597}, archivePrefix={arXiv}, primaryClass={cs.CC}, keywords={preprint} } @misc{clinch2025vertexcover, title={A Faster Randomized Algorithm for Vertex Cover: An Automated Approach}, author={Clinch, Katie and Gaspers, Serge and He, Tao Zixu and Mackenzie, Simon and Zhang, Tiankuang}, year={2025}, eprint={2510.09027}, archivePrefix={arXiv}, primaryClass={cs.DS}, keywords={preprint} } @inproceedings{aziz2014computational, title={Computational aspects of multi-winner approval voting}, author={Aziz, Haris and Gaspers, Serge and Gudmundsson, Joachim and Mackenzie, Simon and Mattei, Nicholas and Walsh, Toby}, booktitle={Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems (AAMAS)}, pages={107--115}, year={2015}, keywords={conference} } @inproceedings{kahng2021liquidconf, title={Liquid Democracy: An Algorithmic Perspective}, author={Kahng, Anson and Mackenzie, Simon and Procaccia, Ariel D.}, booktitle={Proceedings of the AAAI Conference on Artificial Intelligence}, volume={32}, number={1}, pages={1095--1102}, year={2018}, keywords={conference} } @inproceedings{aziz2016discretefour, title={A discrete and bounded envy-free cake cutting protocol for four agents}, author={Aziz, Haris and Mackenzie, Simon}, booktitle={Proceedings of the forty-eighth annual ACM symposium on Theory of Computing}, pages={454--464}, year={2016}, keywords={conference} } @inproceedings{haghtalab2018provable, title={The provable virtue of laziness in motion planning}, author={Haghtalab, Nika and Mackenzie, Simon and Procaccia, Ariel D. and Salzman, Oren and Srinivasa, Siddhartha}, booktitle={Proceedings of the International Conference on Automated Planning and Scheduling}, volume={28}, pages={106--113}, year={2018}, keywords={conference} } @inproceedings{aziz2014fixing, title={Fixing a balanced knockout tournament}, author={Aziz, Haris and Gaspers, Serge and Mackenzie, Simon and Mattei, Nicholas and Stursberg, Paul and Walsh, Toby}, booktitle={Proceedings of the AAAI Conference on Artificial Intelligence}, volume={28}, number={1}, year={2014}, keywords={conference} } @inproceedings{aziz2015manipulating, title={Manipulating the probabilistic serial rule}, author={Aziz, Haris and Gaspers, Serge and Mackenzie, Simon and Mattei, Nicholas and Narodytska, Nina and Walsh, Toby}, journal={arXiv preprint arXiv:1501.06626}, booktitle={AAMAS}, year={2015}, keywords={conference} } @inproceedings{haris2014fair, title={Fair Assignment of Indivisible Objects under Ordinal Preference}, author={Aziz, Haris and Gaspers, Serge and Mackenzie, Simon and Walsh, Toby}, booktitle={AAMAS}, volume={14}, pages={1305--1312}, year={2014} } @inproceedings{aziz2017complexity, title={Complexity of manipulating sequential allocation}, author={Aziz, Haris and Bouveret, Sylvain and Lang, J{\'e}r{\^o}me and Mackenzie, Simon}, booktitle={Proceedings of the AAAI Conference on Artificial Intelligence}, volume={31}, number={1}, year={2017}, keywords={conference} } @inproceedings{aziz2015ex, title={Ex post Efficiency of Random Assignments.}, author={Aziz, Haris and Mackenzie, Simon and Xia, Lirong and Ye, Chun}, year={2015}, booktitle={AAMAS}, keywords={conference} } @inproceedings{gaspers2015number, title={On the number of minimal separators in graphs}, author={Gaspers, Serge and Mackenzie, Simon}, booktitle={International Workshop on Graph-Theoretic Concepts in Computer Science}, pages={116--121}, year={2015}, organization={Springer}, keywords={conference} } @inproceedings{goelz2018fluid, title={The Fluid Mechanics of Liquid Democracy}, author={G{\"o}lz, Paul and Kahng, Anson and Mackenzie, Simon and Procaccia, Ariel D.}, booktitle={Proceedings of the 14th International Conference on Web and Internet Economics (WINE)}, pages={188--202}, year={2018}, keywords={conference} } @inproceedings{aziz2015egalitarianism, title={Egalitarianism of random assignment mechanisms}, author={Aziz, Haris and Chen, Jiashu and Filos-Ratsikas, Aris and Mackenzie, Simon and Mattei, Nicholas}, booktitle={Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems (AAMAS)}, pages={1267--1268}, year={2016}, keywords={conference} } @inproceedings{aziz2015equilibria, title={Equilibria under the probabilistic serial rule}, author={Aziz, Haris and Gaspers, Serge and Mackenzie, Simon and Mattei, Nicholas and Narodytska, Nina and Walsh, Toby}, journal={arXiv preprint arXiv:1502.04888}, booktitle={IJCAI}, year={2015} } @article{aziz2015fair, title={Fair assignment of indivisible objects under ordinal preferences}, author={Aziz, Haris and Gaspers, Serge and Mackenzie, Simon and Walsh, Toby}, journal={Artificial Intelligence}, volume={227}, pages={71--92}, year={2015}, publisher={Elsevier}, keywords={conference} } @article{kahng2021liquid, title={Liquid democracy: An algorithmic perspective}, author={Kahng, Anson and Mackenzie, Simon and Procaccia, Ariel D.}, journal={Journal of Artificial Intelligence Research}, volume={70}, pages={1223--1252}, year={2021}, keywords={journal} } @article{aziz2018fixing, title={Fixing balanced knockout and double elimination tournaments}, author={Aziz, Haris and Gaspers, Serge and Mackenzie, Simon and Mattei, Nicholas and Stursberg, Paul and Walsh, Toby}, journal={Artificial Intelligence}, volume={262}, pages={1--14}, year={2018}, publisher={Elsevier}, keywords={journal} } @article{golz2021fluid, title={The fluid mechanics of liquid democracy}, author={G{\"o}lz, Paul and Kahng, Anson and Mackenzie, Simon and Procaccia, Ariel D.}, journal={ACM Transactions on Economics and Computation}, volume={9}, number={4}, pages={1--39}, year={2021}, publisher={ACM New York, NY}, keywords={journal} } @article{aziz2016two, title={Two desirable fairness concepts for allocation of indivisible objects under ordinal preferences}, author={Aziz, Haris and Gaspers, Serge and Mackenzie, Simon and Walsh, Toby}, journal={ACM SIGecom Exchanges}, volume={14}, number={2}, pages={16--21}, year={2016}, publisher={ACM New York, NY, USA}, keywords={journal} } @article{aziz2017bounded, title={Bounded and envy-free cake cutting}, author={Aziz, Haris and Mackenzie, Simon}, journal={ACM SIGecom Exchanges}, volume={15}, number={2}, pages={30--33}, year={2017}, publisher={ACM New York, NY, USA}, keywords={journal} } @article{mackenzie2015pillage, title={Pillage games with multiple stable sets}, author={Kerber, Manfred and Mackenzie, Simon and Rowat, Colin}, journal={International Journal of Game Theory}, volume={44}, pages={993--1013}, year={2015}, publisher={Springer}, keywords={journal} } @article{aziz2020bounded, title={A bounded and envy-free cake cutting algorithm}, author={Aziz, Haris and Mackenzie, Simon}, journal={Communications of the ACM}, volume={63}, number={4}, pages={119--126}, year={2020}, publisher={ACM New York, NY, USA}, keywords={journal} } @article{https://doi.org/10.1002/jgt.22179, author = {Gaspers, Serge and Mackenzie, Simon}, title = {On the number of minimal separators in graphs}, journal = {Journal of Graph Theory}, volume = {87}, number = {4}, pages = {653-659}, keywords = {combinatorial bounds, enumeration algorithms, extremal combinatorics}, doi = {https://doi.org/10.1002/jgt.22179}, url = {https://onlinelibrary.wiley.com/doi/abs/10.1002/jgt.22179}, abstract = {Abstract Weconsider the largest number of minimal separators a graph on n vertices can have. –We give a new proof that this number is in . –We prove that this number is in , improving on the previous best lower bound of .This gives also an improved lower bound on the number of potential maximal cliques in a graph. We would like to emphasize that our proofs are short, simple, and elementary.}, year = {2018} }