Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9664068 | European Journal of Operational Research | 2005 | 18 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Nobuo Matsubayashi, Masashi Umezawa, Yasushi Masuda, Hisakazu Nishino,