The Provable Virtue of Laziness in Motion Planning

no code implementations • 11 Oct 2017 • Nika Haghtalab, Simon Mackenzie, Ariel D. Procaccia, Oren Salzman, Siddhartha S. Srinivasa

The Lazy Shortest Path (LazySP) class consists of motion-planning algorithms that only evaluate edges along shortest paths between the source and target.

Robotics Data Structures and Algorithms

A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents

1 code implementation • 13 Apr 2016 • Haris Aziz, Simon Mackenzie

We resolve the problem by proposing a discrete and bounded envy-free protocol for any number of agents.

Computational Aspects of Multi-Winner Approval Voting

no code implementations • 11 Jul 2014 • Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Simon Mackenzie, Nicholas Mattei, Toby Walsh

We study computational aspects of three prominent voting rules that use approval ballots to elect multiple winners.

Fair assignment of indivisible objects under ordinal preferences

no code implementations • 23 Dec 2013 • Haris Aziz, Serge Gaspers, Simon Mackenzie, Toby Walsh

The computational complexity of checking whether a fair assignment exists is studied for these fairness notions.

Fairness Open-Ended Question Answering