Equilibria in bottleneck games

Abstract

This paper introduces a bottleneck game with finite sets of commuters and departing time slots as an extension of congestion games of Konishi et al. (J Econ Theory 72:225–237, 1997a). After characterizing Nash equilibrium of the game, we provide sufficient conditions for which the equivalence between Nash and strong equilibria holds. Somewhat surprisingly, unlike in congestion games, a Nash equilibrium in pure strategies may often fail to exist, even when players are homogeneous. In contrast, when there is a continuum of atomless players, the existence of a Nash equilibrium and the equivalence between the set of Nash and strong equilibria hold as in congestion games (Konishi et al. 1997a).