A cost allocation problem arising in hub–spoke network systems

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 an...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 2005-02, Vol.160 (3), p.821-838
Main Authors: Matsubayashi, Nobuo, Umezawa, Masashi, Masuda, Yasushi, Nishino, Hisakazu
Format: Article
Language:English
Subjects:
Core allocation
Cost allocation
Game theory
Hub–spoke network system
Non-excludability
Studies
Telecommunication network
Telecommunications
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c447t-71fc552ab530664c0a15c95ae0a1bbf06add8fd2b0ed7058116dde0f40bbad143
cites cdi_FETCH-LOGICAL-c447t-71fc552ab530664c0a15c95ae0a1bbf06add8fd2b0ed7058116dde0f40bbad143
container_end_page 838
container_issue 3
container_start_page 821
container_title European journal of operational research
container_volume 160
creator Matsubayashi, Nobuo
Umezawa, Masashi
Masuda, Yasushi
Nishino, Hisakazu
description 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.
doi_str_mv 10.1016/j.ejor.2003.05.002
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_204130105</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0377221703005083</els_id><sourcerecordid>715546241</sourcerecordid><originalsourceid>FETCH-LOGICAL-c447t-71fc552ab530664c0a15c95ae0a1bbf06add8fd2b0ed7058116dde0f40bbad143</originalsourceid><addsrcrecordid>eNp9kM1O3DAUha2qSJ0CL8AqYp_0XidOUolFR6j8iJG6KWvLsW-Kw0yc2hnQ7HgH3pAn6R1NxRJLx9eLc46vPiHOEAoErL8NBQ0hFhKgLEAVAPKTWGDbyLxua_gsFlA2TS4lNl_E15QGAECFaiF-LDMb0pyZ9TpYM_swZlMM3Zo2mYk--fFP5sfsYdu9vbymKTxSNtL8HOJjlnZppk06EUe9WSc6_T-Pxf3Vz9-XN_nq1_Xt5XKV26pq5rzB3iolTadKqOvKgkFlvytD_Oi6HmrjXNs72QG5BlSLWDtH0FfQdcZhVR6L80Mvr_d3S2nWQ9jGkb_UEiosAUGxSR5MNoaUIvV6in5j4k4j6D0oPeg9KL0HpUFpBsWhu0Mo0kT2PUF82EpJP-nSYA1871gcVTw8q2RNrFaibstWP8wbbrs4tBHDePIUdbKeRkvOR7KzdsF_tMw_l-GMGg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>204130105</pqid></control><display><type>article</type><title>A cost allocation problem arising in hub–spoke network systems</title><source>Elsevier</source><creator>Matsubayashi, Nobuo ; Umezawa, Masashi ; Masuda, Yasushi ; Nishino, Hisakazu</creator><creatorcontrib>Matsubayashi, Nobuo ; Umezawa, Masashi ; Masuda, Yasushi ; Nishino, Hisakazu</creatorcontrib><description>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.</description><identifier>ISSN: 0377-2217</identifier><identifier>EISSN: 1872-6860</identifier><identifier>DOI: 10.1016/j.ejor.2003.05.002</identifier><identifier>CODEN: EJORDT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Core allocation ; Cost allocation ; Game theory ; Hub–spoke network system ; Non-excludability ; Studies ; Telecommunication network ; Telecommunications</subject><ispartof>European journal of operational research, 2005-02, Vol.160 (3), p.821-838</ispartof><rights>2003 Elsevier B.V.</rights><rights>Copyright Elsevier Sequoia S.A. Feb 1, 2005</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c447t-71fc552ab530664c0a15c95ae0a1bbf06add8fd2b0ed7058116dde0f40bbad143</citedby><cites>FETCH-LOGICAL-c447t-71fc552ab530664c0a15c95ae0a1bbf06add8fd2b0ed7058116dde0f40bbad143</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids><backlink>$$Uhttp://econpapers.repec.org/article/eeeejores/v_3a160_3ay_3a2005_3ai_3a3_3ap_3a821-838.htm$$DView record in RePEc$$Hfree_for_read</backlink></links><search><creatorcontrib>Matsubayashi, Nobuo</creatorcontrib><creatorcontrib>Umezawa, Masashi</creatorcontrib><creatorcontrib>Masuda, Yasushi</creatorcontrib><creatorcontrib>Nishino, Hisakazu</creatorcontrib><title>A cost allocation problem arising in hub–spoke network systems</title><title>European journal of operational research</title><description>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.</description><subject>Core allocation</subject><subject>Cost allocation</subject><subject>Game theory</subject><subject>Hub–spoke network system</subject><subject>Non-excludability</subject><subject>Studies</subject><subject>Telecommunication network</subject><subject>Telecommunications</subject><issn>0377-2217</issn><issn>1872-6860</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2005</creationdate><recordtype>article</recordtype><recordid>eNp9kM1O3DAUha2qSJ0CL8AqYp_0XidOUolFR6j8iJG6KWvLsW-Kw0yc2hnQ7HgH3pAn6R1NxRJLx9eLc46vPiHOEAoErL8NBQ0hFhKgLEAVAPKTWGDbyLxua_gsFlA2TS4lNl_E15QGAECFaiF-LDMb0pyZ9TpYM_swZlMM3Zo2mYk--fFP5sfsYdu9vbymKTxSNtL8HOJjlnZppk06EUe9WSc6_T-Pxf3Vz9-XN_nq1_Xt5XKV26pq5rzB3iolTadKqOvKgkFlvytD_Oi6HmrjXNs72QG5BlSLWDtH0FfQdcZhVR6L80Mvr_d3S2nWQ9jGkb_UEiosAUGxSR5MNoaUIvV6in5j4k4j6D0oPeg9KL0HpUFpBsWhu0Mo0kT2PUF82EpJP-nSYA1871gcVTw8q2RNrFaibstWP8wbbrs4tBHDePIUdbKeRkvOR7KzdsF_tMw_l-GMGg</recordid><startdate>20050201</startdate><enddate>20050201</enddate><creator>Matsubayashi, Nobuo</creator><creator>Umezawa, Masashi</creator><creator>Masuda, Yasushi</creator><creator>Nishino, Hisakazu</creator><general>Elsevier B.V</general><general>Elsevier</general><general>Elsevier Sequoia S.A</general><scope>DKI</scope><scope>X2L</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20050201</creationdate><title>A cost allocation problem arising in hub–spoke network systems</title><author>Matsubayashi, Nobuo ; Umezawa, Masashi ; Masuda, Yasushi ; Nishino, Hisakazu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c447t-71fc552ab530664c0a15c95ae0a1bbf06add8fd2b0ed7058116dde0f40bbad143</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Core allocation</topic><topic>Cost allocation</topic><topic>Game theory</topic><topic>Hub–spoke network system</topic><topic>Non-excludability</topic><topic>Studies</topic><topic>Telecommunication network</topic><topic>Telecommunications</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Matsubayashi, Nobuo</creatorcontrib><creatorcontrib>Umezawa, Masashi</creatorcontrib><creatorcontrib>Masuda, Yasushi</creatorcontrib><creatorcontrib>Nishino, Hisakazu</creatorcontrib><collection>RePEc IDEAS</collection><collection>RePEc</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>European journal of operational research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Matsubayashi, Nobuo</au><au>Umezawa, Masashi</au><au>Masuda, Yasushi</au><au>Nishino, Hisakazu</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A cost allocation problem arising in hub–spoke network systems</atitle><jtitle>European journal of operational research</jtitle><date>2005-02-01</date><risdate>2005</risdate><volume>160</volume><issue>3</issue><spage>821</spage><epage>838</epage><pages>821-838</pages><issn>0377-2217</issn><eissn>1872-6860</eissn><coden>EJORDT</coden><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.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.ejor.2003.05.002</doi><tpages>18</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0377-2217
ispartof European journal of operational research, 2005-02, Vol.160 (3), p.821-838
issn 0377-2217
1872-6860
language eng
recordid cdi_proquest_journals_204130105
source Elsevier
subjects Core allocation
Cost allocation
Game theory
Hub–spoke network system
Non-excludability
Studies
Telecommunication network
Telecommunications
title A cost allocation problem arising in hub–spoke network systems
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T17%3A43%3A03IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20cost%20allocation%20problem%20arising%20in%20hub%E2%80%93spoke%20network%20systems&rft.jtitle=European%20journal%20of%20operational%20research&rft.au=Matsubayashi,%20Nobuo&rft.date=2005-02-01&rft.volume=160&rft.issue=3&rft.spage=821&rft.epage=838&rft.pages=821-838&rft.issn=0377-2217&rft.eissn=1872-6860&rft.coden=EJORDT&rft_id=info:doi/10.1016/j.ejor.2003.05.002&rft_dat=%3Cproquest_cross%3E715546241%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c447t-71fc552ab530664c0a15c95ae0a1bbf06add8fd2b0ed7058116dde0f40bbad143%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=204130105&rft_id=info:pmid/&rfr_iscdi=true