Optimization Online


The Noncooperative Fixed Charge Transportation Problem

Nathan Sudermann-Merx(nathan.sudermann-merx***at***basf.com)
Simone Sagratella(sagratella***at***diag.uniroma1.it)
Marcel Stefan Schmidt(MS_schmidt***at***msn.com)

Abstract: We introduce the noncooperative fixed charge transportation problem (NFCTP), which is a game-theoretic extension of the fixed charge transportation problem. In the NFCTP, competing players solve coupled fixed charge transportation problems simultaneously. Three versions of the NFCTP are discussed and compared, which differ in their treatment of shared social costs. This may be used from central authorities in order to find a socially balanced framework which is illustrated in a numerical study. Using techniques from generalized Nash equilibrium problems with mixed-integer variables we show the existence of Nash equilibria for these models and examine their structural properties. Since there is no unique equilibrium for the NFCTP, we also discuss how to solve the Nash selection problem and, finally, propose numerical methods for the computation of Nash equilibria which are based on mixed-integer programming.

Keywords: Noncooperative transportation problem, mixed integer Nash games, linear generalized Nash equilibrium problem

Category 1: Integer Programming ((Mixed) Integer Linear Programming )

Category 2: Other Topics (Game Theory )


Download: [PDF]

Entry Submitted: 12/21/2018
Entry Accepted: 12/21/2018
Entry Last Modified: 12/21/2018

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society