| Project/Area Number |
15K11988
|
|---|
| Research Category |
Grant-in-Aid for Challenging Exploratory Research
|
| Allocation Type | Multi-year Fund |
|---|
| Research Field |
Theory of informatics
|
|---|
| Research Institution | Chuo University |
|---|
Principal Investigator |
Asano Takao 中央大学, 理工学部, 教授 (90124544)
|
|---|
| Co-Investigator(Renkei-kenkyūsha) |
ASANO YASUHITO 京都大学, 情報学研究科, 准教授 (20361157)
|
|---|
| Project Period (FY) |
2015-04-01 – 2018-03-31
|
| Project Status |
Completed (Fiscal Year 2017)
|
| Budget Amount *help |
¥3,510,000 (Direct Cost: ¥2,700,000、Indirect Cost: ¥810,000)
Fiscal Year 2017: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2016: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2015: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
|
|---|
| Keywords | アルゴリズム / ネットワーク / 近似保証 / 組合せオークション / ナッシュ均衡 |
|---|
| Outline of Final Research Achievements |
We have done algorithmic researches on interdisciplinary topics on highly connected giant network world from the viewpoint of informatics, economics and sociology. Specifically, we proposed an algorithm for the Steiner forest problem, which is a kind of generalization of the Steiner tree problem and one of most important problems in computer science, and evaluated its approximation performance by computational experiment and by comparing the known algorithms for the Steiner forest problem. We also considered a combinatorial auction problem and gave characterizations for the existence of a Nash equilibrium in such a combinatorial auction. These results were published in Journal of Information Processing Society of Japan (and will be published in IEICE Transactions on Fundamentals). Furthermore, we considered the dial-a-ride problem with regret minimization and the result will be published as a paper in Journal of Japan Society of Mechanical Engineers.
|
