Minimising the Rank Aggregation Error: (Extended Abstract)

Rank aggregation is the problem of generating an overall ranking from a set of individual votes which is as close as possible to the (unknown) correct ranking. The challenge is that votes are often both noisy and incomplete. Existing work focuses on the most likely ranking for a particular noise model. Instead, we focus on minimising the error,...

Intention-Aware Routing of Electric Vehicles

This paper introduces a novel intention-aware routing system (IARS) for electric vehicles. This system enables vehicles to compute a routing policy that minimizes their expected journey time while considering the policies, or intentions, of other vehicles. Considering such intentions is critical for electric vehicles, which may need to recharge...

Online Mechanism Design for Scheduling Non-Preemptive Jobs under Uncertain Supply and Demand

We design new algorithms for the problem of allocating uncertain, flexible, and multi-unit demand online given uncertain supply, in order to maximise social welfare. The algorithms can be seen as extensions of the expectation and consensus algorithms from the domain of online scheduling. The problem is especially relevant to the future smart...

Intention-Aware Routing to Minimise Delays at Electric Vehicle Charging Stations

En-route charging stations allow electric vehicles to greatly extend their range. However, as a full charge takes a considerable amount of time, there may be significant waiting times at peak hours. To address this problem, we propose a novel navigation system, which communicates its intentions (i.e., routing policies) to other drivers. Using...