HEC Research Papers Series,
HEC Paris

Abstract: 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 use a train service to go from home to office in the early morning. Trains run at regular intervals, take always the same time to cover their itinerary, and have a fixed capacity. Commuters must reach their office in time. This is a hard constraint whose violation involves a heavy penalty. Conditionally on meeting the deadline, commuters want to take the train as late as possible. With the intent of considering strategic choices of departure, we model this situation as a game and we show that it does not have pure Nash equilibria. Then we characterize the best and worst mixed Nash equilibria, and show that they are both inefficient with respect to the social optimum. We then show that there exists a correlated equilibrium that approximates the social optimum when the penalty for missing the deadline is sufficiently large.

Keywords: Nash equilibrium; correlated equilibrium; efficiency of equilibria; price of anarchy; price of stability; price of correlated stability.

JEL-codes: C72; C73

20 pages, July 25, 2018

Full text files

papers.cfm?abstract_id=3219767  Link to PDF

Download statistics

• HEC Paris
• Ordering Working Papers
• Home page for this series

Questions (including download problems) about the papers in this series should be directed to Antoine Haldemann ()
Report other problems with accessing this service to Sune Karlsson ().

RePEc:ebg:heccah:1289This page generated on 2024-09-13 22:19:53.