Through smartphone apps, drivers and passengers can dynamically enter and leave ride-
hailing platforms. As a result, ride-pooling is challenging due to complex system dynamics …

Abstract Huang et al.(STOC 2018) introduced the fully online matching problem, a
generalization of the classic online bipartite matching problem in that it allows all vertices to …

Efficient allocation of tasks to workers is a central problem in crowdsourcing. In this article,
we consider a setting inspired by spatial crowdsourcing platforms, where both workers and …

We study the optimization of large-scale, real-time ridesharing systems and propose a
modular design methodology, Component Algorithms for Ridesharing (CAR). We evaluate a …

We consider an online car-sharing problem between two locations with advance bookings.
Each customer submits a pair of requests, where each request specifies the pick-up time …

Shared on-demand mobility holds immense potential for urban transportation. However,
finding ride matches in real-time at urban scale is a very difficult combinatorial optimization …

A plethora of real world problems consist of a number of agents that interact, learn,
cooperate, coordinate, and compete with others in ever more complex environments …

The primary focus of this dissertation is to develop mathematical models and solution
approaches for sequential decision-making and optimization under uncertainty, with …