1 citations · 5 across the 17 of their papers we have counts for
4 papers · 1 filter
Deterministic Stackelberg Strategies in Robotaxi Assignment Games
Ioannis Caragiannis, Kostas Kollias, Mohammad Roghani +2
In autonomous mobility duopolies, platforms compete for riders based on vehicle proximity. A critical operational challenge---faced by an incumbent proactively defending against a…
Locally Sparsified, Globally Near-Optimal: Matching under Independent Vertex Arrivals
Sara Ahmadian, Edith Cohen, Mohammad Roghani
Resource allocation systems often restrict each request to a short list of options before coordinating assignments globally. We study this separation in stochastic bipartite matchi…
The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand
Ioannis Caragiannis, Kostas Kollias, Mohammad Roghani +2
Autonomous ride-hailing platforms must strategically position idle robotaxis to minimize the wait times of prospective riders. We formalize this as the robotaxi placement problem (…
Stochastic Matching via Local Sparsification
Sara Ahmadian, Edith Cohen, Mohammad Roghani
The classic online stochastic matching problem typically requires immediate and irrevocable matching decisions. However, in many modern decentralized systems such as real-time ride…