12 citations · 27 across the 12 of their papers we have counts for
18 papers
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…
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 (…
Efficient Online Conformal Selection with Limited Feedback
Sreenivas Gollapudi, Kostas Kollias, Kamesh Munagala +1
We address the problem of conformal selection, where an agent must select a low-cost subset of options to ensure that at least one "success" is identified at a pre-specified target…
Why is My Route Different Today? An Algorithm for Explaining Route Selection
Aaron Schild, Sreenivas Gollapudi, Anupam Gupta +2
Users of routing services like Apple Maps, Google Maps, and Waze frequently wonder why a given route is proposed. This question particularly arises when dynamic conditions like tra…
First Passage Percolation with Queried Hints
Kritkorn Karntikoon, Yiheng Shen, Sreenivas Gollapudi +3
Solving optimization problems leads to elegant and practical solutions in a wide variety of real-world applications. In many of those real-world applications, some of the informati…
Exphormer: Sparse Transformers for Graphs
Hamed Shirzad, Ameya Velingker, Balaji Venkatachalam +2
Graph transformers have emerged as a promising architecture for a variety of graph learning and representation tasks. Despite their successes, though, it remains challenging to sca…