A cost allocation problem arising in hub-spoke network systems

Nobuo Matsubayashi, Masashi Umezawa, Yasushi Masuda, Hisakazu Nishino

研究成果: Article査読

27 被引用数 (Scopus)

抄録

This paper studies a cost allocation problem arising from hub-spoke network systems. When a large-scale network is to be constructed jointly by several agents, both the optimal network design and the fair allocation of its cost are essential issues. We formulate this problem as a cooperative game and analyze the core allocation, which is a widely used solution concept. The core of this game is not necessarily non-empty as shown by an example. A reasonable scheme is to allocate the cost proportional to the flow that an agent generates. We show that, if the demand across the system has a block structure and the fixed cost is high, this cost allocation scheme belongs to the core. Numerical experiments are given with real telecommunication traffic data in order to illustrate the usefulness of our analytical findings.

本文言語English
ページ(範囲)821-838
ページ数18
ジャーナルEuropean Journal of Operational Research
160
3 SPEC. ISS.
DOI
出版ステータスPublished - 2005 2月 1

ASJC Scopus subject areas

  • コンピュータ サイエンス(全般)
  • モデリングとシミュレーション
  • 経営科学およびオペレーションズ リサーチ
  • 情報システムおよび情報管理

フィンガープリント

「A cost allocation problem arising in hub-spoke network systems」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル