The noncooperative transportation problem and linear generalized Nash games

We extend the classical transportation problem from linear optimization and introduce several competing forwarders. This results in a noncooperative game which is commonly known as linear generalized Nash equilibrium problem. We show the existence of Nash equilibria and present numerical methods for their efficient computation. Furthermore, we discuss several equilibrium selection concepts that are applicable to this particular Nash game.