We consider a model of bottleneck congestion in discrete time with a penalty cost for being late. This model can be applied to several situations where agents need to use a capacitated facility in order to complete a task before a hard deadline. A possible example is a situation where commuters...

We propose a model of discrete time dynamic congestion games with atomic players and a single source-destination pair. The latencies of edges are composed by free-flow transit times and possible queuing time due to capacity constraints. We give a precise description of the dynamics induced by...