Abstract Transport markets involve interactions between multiple groups of decision-makers, hence they are good candidates to be analyzed through the prism of game theory. The many models and algorithms published to date tend to reflect different academic disciplines, including operations research, economics and engineering approaches. Models published in the operations research oriented journals often involve large network components in order to provide relatively specific insights, building on Stackelberg, Wardrop and traffic assignment formulations. Game-theoretic models published in economics journals are frequently conceptual with stylized assumptions, such as Cournot, Bertrand and Hotelling, all of which have been applied to transportation markets. We present the more common models and highlight the differences in the equilibria outcomes drawing from the choice of model and beliefs of the players in the market. We discuss the most widely applied algorithms and formulations utilized to solve network-based transport markets. Finally, we review the published literature with real-world applications and discuss potential new areas yet to be explored substantially, including the analysis of multi-modal markets involving both competition and cooperation across transport modes.

中文翻译：

---

使用博弈论原理回顾运输市场建模

摘要 运输市场涉及多个决策者群体之间的相互作用，因此它们是通过博弈论棱镜进行分析的良好候选者。迄今为止发表的许多模型和算法往往反映了不同的学科，包括运筹学、经济学和工程方法。在面向运筹学的期刊上发表的模型通常涉及大型网络组件，以提供相对具体的见解，建立在 Stackelberg、Wardrop 和流量分配公式的基础上。发表在经济学期刊上的博弈论模型通常是带有程式化假设的概念性模型，例如 Cournot、Bertrand 和 Hotelling，所有这些都已应用于运输市场。我们展示了更常见的模型，并强调了从模型选择和市场参与者的信念中得出的均衡结果的差异。我们讨论了用于解决基于网络的运输市场的最广泛应用的算法和公式。最后，我们回顾了具有实际应用的已发表文献，并讨论了尚待大量探索的潜在新领域，包括对涉及跨运输模式竞争与合作的多模式市场的分析。