This paper addresses the existence of Nash equilibria in one-way flow or directed network models in a number of different settings. In these models players form costly links with other players and obtain resources from them through the directed path connecting them. We find that heterogeneity in...

We analyze the technical efficiency of German and Swiss urban public transport companies by means of SFA. In transport networks we might face different network structures or complexities, not observed, but influencing the production process. The unobserved factors are typically modeled as...

We consider a model of an information network where nodes can fail and transmission of information is costly. The formation of paths in such networks is modeled as the Nash equilibrium of an N player routing game. The task of obtaining this equilibrium is shown to be NP-Hard. We derive...

We present a mixed integer, multi-period, cost-minimizing carbon capture, transport and storage (CCTS) network model for Europe. The model incorporates endogenous decisions about carbon capture, pipeline and storage investments; capture, flow and injection quantities based on given costs,...