| Budget Amount *help |
¥5,070,000 (Direct Cost: ¥3,900,000、Indirect Cost: ¥1,170,000)
Fiscal Year 2013: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2012: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2011: ¥2,470,000 (Direct Cost: ¥1,900,000、Indirect Cost: ¥570,000)
|
|---|
| 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.
|
