Art

J-GLOBAL ID：201402273044812167   Reference number：13A1952538

Detecting Edges Causing Braess’s Paradox Via Simulation

シミュレーションを用いたBraessのパラドックスを引き起こすエッジの検出

Author (3)： KOJIMA Toshiki (Graduate School of Engineering Master’s Program, Gunma Univ.) ,  BAZZI Ahmad (Graduate School of Engineering Doctor’s Program, Gunma Univ.) ,  ONOZATO Yoshikuni (Graduate School of Engineering, Gunma Univ.)
Material： 日本シミュレーション学会論文誌(Web)  (Transaction of the Japan Society for Simulation Technology (Web))
Volume： 4  Issue： 4  Page： 200-207 (J-STAGE)  Publication year： 2012 
JST Material Number： U0267A  ISSN： 1883-5058  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： edge detection ,  *paradox ,  *network programming ,  Time ,  network structure ,  edge ,  computer algorithm ,  speedup ,  simulation ,  transportation problem ,  transit time
Semi thesaurus term： *Braessのパラドックス ,  paradox ,  edge

JST classification (2)： System and control theory in general  (IA02010H) ,  Network methods  (KA03040X)

Reference (5)：

• 1) Easley, D., & Kleinberg, J., Modeling Network Traffic using Game Theory, Networks, Crowds, and Markets: Reasoning about a Highly Connected World, 229-247, 2010
• 2) Valiant, G., & Roughgarden, T., Braess's paradox in large random graphs, Proceedings of the 7th ACM conference on Electronic commerce, New York, USA, 296-305, 2006
• 3) Altman, E., El Azouzi, R., & Pourtallier, O., Avoiding paradoxes in routing games, Proceedings of the 17th International Teletraffic Congress, 24-28, 2001
• 4) Macko, M., Larson, K., & Steskal, L., Braess's Paradox for Flows over Time, Algorithmic Game Theory, Springer Berlin/Heidelberg, 262-275, 2010
• 5) Roughgarden, T., On the Severity of Braess's Paradox: Designing Networks for Selfish Users is Hard, Journal of Computer and System Sciences, vol. 72, 992-953, 2006.

Terms in the title (3)： シミュレーション ,  パラドックス ,  エッジ