The noncooperative transportation problem and linear generalized Nash games

被引:26
作者
Stein, Oliver [1 ]
Sudermann-Merx, Nathan [2 ]
机构
[1] KIT, Inst Operat Res, D-76131 Karlsruhe, Germany
[2] BASF Business Serv GmbH, Adv Business Analyt, D-67061 Ludwigshafen, Germany
关键词
Transportation; Transportation problem with several forwarders; Linear generalized Nash equilibrium problem; Noncooperative game theory; Subgradient method; EQUILIBRIUM PROBLEMS; RELAXATION ALGORITHMS; OPTIMIZATION; INFORMATION; SELECTION; SYSTEMS;
D O I
10.1016/j.ejor.2017.10.001
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
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. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码:543 / 553
页数:11
相关论文
共 48 条
[1]  
[Anonymous], 2007, Finite-dimensional variational inequalities and complementarity problems
[2]  
[Anonymous], 1995, GRADUATE TEXTS MATH
[3]   EXISTENCE OF AN EQUILIBRIUM FOR A COMPETITIVE ECONOMY [J].
Arrow, Kenneth J. ;
Debreu, Gerard .
ECONOMETRICA, 1954, 22 (03) :265-290
[4]  
Borwein JM., 2006, CONVEX ANAL NONLINEA
[5]   A robust gradient sampling algorithm for nonsmooth, nonconvex optimization [J].
Burke, JV ;
Lewis, AS ;
Overton, ML .
SIAM JOURNAL ON OPTIMIZATION, 2005, 15 (03) :751-779
[6]   Robust uncertainty principles:: Exact signal reconstruction from highly incomplete frequency information [J].
Candès, EJ ;
Romberg, J ;
Tao, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (02) :489-509
[7]   Decoding by linear programming [J].
Candes, EJ ;
Tao, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (12) :4203-4215
[8]  
Clarke F. H., 1990, OPTIMIZATION NON SMO
[10]   For most large underdetermined systems of linear equations the minimal l1-norm solution is also the sparsest solution [J].
Donoho, DL .
COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, 2006, 59 (06) :797-829