2013 Fiscal Year Final Research Report
Approximation algorithms for routing and scheduling problems on networks
| Project/Area Number |
23500023
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Chuo University |
|---|
Principal Investigator |
ASANO Takao 中央大学, 理工学部, 教授 (90124544)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
ASANO Yasuhito 京都大学, 情報学研究科, 准教授 (20361157)
|
|---|
| Project Period (FY) |
2011 – 2013
|
| Keywords | 近似保証アルゴリズム / ネットワーク / ルーティング / スケジューリング / ラウンディング / ユニークゲーム予想 / 組合せオークション / ナッシュ均衡 |
|---|
| Research Abstract |
We considered routing and scheduling problems on a network as a combinatorial auction problem for maximizing the social welfare of all participants on the network and investigated the existence of a stable solution (Nash equilibrium) which all participants agree on. We gave a characterization for the existence of a Nash equilibrium in such a combinatorial auction when valuations by all participants satisfy symmetric and subadditive properties. By this characterization, we obtained an algorithm for deciding a Nash equilibrium exists. Furthermore, we showed that, if valuations by all participants satisfy symmetric and submodular properties, Nash equilibrium always exists and we can find such a Nash equilibrium in polynomial time.
|
