[01973] Equilibria for Robust Routing Game of Atomic Players
Session Time & Room : 3E (Aug.23, 17:40-19:20) @D514
Type : Contributed Talk
Abstract : We study a routing game on edge costs given by an interval of the same length, each edge cost can be any value in the interval. Each player only knows the interval length and would select a path that is robust against the worst-case realization of edge costs. Under bottleneck-type objective with minmax-regret criterion, we prove that every robust Nash Equilibrium (NE) is an NE of the corresponding bottleneck routing game with complete information.
