8 citations · 8 across the 4 of their papers we have counts for
6 papers
Differentially Private Stochastic Convex Optimization for Network Routing Applications
Matthew Tsao, Karthik Gopalakrishnan, Kaidi Yang +1
Network routing problems are common across many engineering applications. Computing optimal routing policies requires knowledge about network demand, i.e., the origin and destinati…
Private Location Sharing for Decentralized Routing services
Matthew Tsao, Kaidi Yang, Karthik Gopalakrishnan +1
Data-driven methodologies offer many exciting upsides, but they also introduce new challenges, particularly in the realm of user privacy. Specifically, the way data is collected ca…
Online Hypergraph Matching with Delays
Marco Pavone, Amin Saberi, Maximilian Schiffer +1
We study an online hypergraph matching problem with delays, motivated by ridesharing applications. In this model, users enter a marketplace sequentially, and are willing to wait up…
Planning and Operations of Mixed Fleets in Mobility-on-Demand Systems
Kaidi Yang, Matthew W. Tsao, Xin Xu +1
Automated vehicles (AVs) are expected to be beneficial for Mobility-on-Demand (MoD), thanks to their ability of being globally coordinated. To facilitate the steady transition towa…
Sample Complexity of Probabilistic Roadmaps via -nets
Matthew Tsao, Kiril Solovey, Marco Pavone
We study fundamental theoretical aspects of probabilistic roadmaps (PRM) in the finite time (non-asymptotic) regime. In particular, we investigate how completeness and optimality g…
Robust and Adaptive Planning under Model Uncertainty
Apoorva Sharma, James Harrison, Matthew Tsao +1
Planning under model uncertainty is a fundamental problem across many applications of decision making and learning. In this paper, we propose the Robust Adaptive Monte Carlo Planni…