Preprint
Oct 2026
Deterministic Stackelberg Strategies in Robotaxi Assignment Games
This work model this competition as a zero-sum robotaxi assignment game, focusing on computing optimal deterministic Stackelberg strategies for the leader, and provides an exact polynomial-time dynamic programming algorithm for computing the optimal Stackelberg payoff when riders and vehicles are on the Euclidean line.
Ioannis Caragiannis, Kostas Kollias, M. Roghani et al.
· 0 citations