Art

J-GLOBAL ID：202102227357351937   Reference number：21A0332083

Capacitated Network Design Games on a Generalized Fair Allocation Model

一般化費用分配モデル下での容量制約付きネットワーク設計ゲーム

Author (3)： HIROSE TOSHIYUKI (名古屋大) ,  HANAKA TESSHU (中央大 理工) ,  ONO HIROTAKA (名古屋大)
Material： 電子情報通信学会技術研究報告(Web)  (IEICE Technical Report (Web))
Volume： 120  Issue： 276(COMP2020 18-27)  Page： 24-27 (WEB ONLY)  Publication year： Nov. 27, 2020 
JST Material Number： U2030A  ISSN： 2432-6380  Document type： Proceedings
Article type： 短報  Country of issue： Japan (JPN)  Language： JAPANESE (JA)

Thesaurus term： constraint condition (restriction) ,  *design ,  network ,  *game ,  *Nash equilibrium ,  state ,  stability condition ,  Capacity constraint ,  disorder
Semi thesaurus term： *network design ,  stability condition ,  disorder

JST classification (1)： Numerical computation  (JE02000J)

Reference (14)：

• Michal Feldman and Tom Ron. Capacitated network design games. Theory of Computing Systems, 57 : 576-597, 2015.
• Thomas Erlebach and Matthew Radoja. Further results on capaci-tated network design games. In Proceedings of 8th Symposium on Algorithmic Game Theory (SAGT2015), pages 57-68, 2015 .
• Michal Feldman and Geri Ofir. Do capacity constraints constrain coalitions? ACM Transactions on Economics and Computation,5(1):No.8, 2016.
• Elliot Anshelevich, Anirban Dasgupta, Jon Kleinberg, Éva Tardos, Tom Wexler, and Tim Roughgarden. The price of stability for net-work design with fair cost allocation. SIAM Journal on Computing,38(4):1602-1623, 2008.
• Robert J. Aumann. Acceptable points in general cooperative n-person games. Contributions to the Theory of Games IV, Annals of Mathe-matical Study, 40:287-324, 1959.

Terms in the title (5)： 分配 ,  モデル ,  容量制約 ,  ネットワーク設計 ,  ゲーム