Mackenzie, Simon

1. A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of\n Agents
   2016/04/13 by Haris Aziz, Simon Mackenzie, Aziz, Haris +1 · 5 voices · 6 citations
   Computer Science · Decision Sciences · #Auction Theory and Applications #Complexity and Algorithms in Graphs #Optimization and Search Problems #cs.AI #cs.DS #cs.GT
2. Computational Aspects of Multi-Winner Approval Voting
   2014/07/11 by Aziz, Haris, Gaspers, Serge, Gudmundsson, Joachim +3 · 3 citations
   #Artificial Intelligence (cs.AI) #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #Multiagent Systems (cs.MA)
3. Fair assignment of indivisible objects under ordinal preferences
   2013/12/23 by Aziz, Haris, Gaspers, Serge, Mackenzie, Simon +1 · 1 citation
   #68Q15 #91A12 #Artificial Intelligence (cs.AI) #Computer Science and Game Theory (cs.GT) #F.2 #FOS: Computer and information sciences #J.4
4. Complexity of Manipulating Sequential Allocation
   2016/02/22 by Aziz, Haris, Bouveret, Sylvain, Lang, Jerome +1 · 1 citation
   #68Q15 #91A12 #Computer Science and Game Theory (cs.GT) #F.2 #FOS: Computer and information sciences #J.4
5. The Provable Virtue of Laziness in Motion Planning
   2017/10/11 by Haghtalab, Nika, Mackenzie, Simon, Procaccia, Ariel D. +2 · 1 citation
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Robotics (cs.RO)