The noncooperative fixed charge transportation problem
The noncooperative fixed charge transportation problem
复制标题
非合作固定收费运输问题
DOI：
10.1016/j.ejor.2019.12.024
复制
发表时间：
2020
期刊：
影响因子：
--
通讯作者：
Nathan Sudermann
中科院分区：
文献类型：
--
作者：
Simone Sagratella;M. Schmidt;Nathan Sudermann
我们介绍了非合作固定费用运输问题（NFCTP），这是一个博弈论的扩展的固定费用运输问题。在NFCTP中，竞争者同时解决耦合固定电荷传输问题。三个版本的NFCTP进行了讨论和比较，不同的待遇，共同的社会成本。中央当局可以利用这一点来找到一个社会平衡的框架，数值研究对此进行了说明。利用混合整数变量的广义纳什均衡问题的技术，我们证明了这些模型的纳什均衡的存在性，并研究了它们的结构性质。由于NFCTP没有唯一的均衡，我们还讨论了如何解决纳什选择问题，最后，提出了基于混合整数规划的纳什均衡的数值计算方法。
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 the 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.