| Presentation | 2006-03-23 Complexity of the pairing strategy for Shannon switching game Ryosuke TAKAHASHI, Eiji TAKIMOTO, Akira MARUOKA, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Shannon switching game is a game where two players alternately place stones on the vertices of a given graph. The first player's goal is to occupy one of paths connecting a specified pair of vertices, and the second player's goal is to prevent it. To decide which player has a winning strategy is known to be PSPACE-complete. In this paper, we restrict the second player's strategy to a simple one called the pairing strategy and investigate the complexity of the game. In paticular, we show that to decide the second player will win with a pairing strategy is Σ^P_2 -complete, Moreover, we shw that to decide the first player will win is NP-complete in the case where the second player's strategy is revealed. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Shannon switching game / Pairing strategy / Forbidden-pair / Σ^P_2 -complete |
| Paper # | COMP2005-64 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2006/3/16(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Theoretical Foundations of Computing (COMP) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Complexity of the pairing strategy for Shannon switching game |
| Sub Title (in English) | |
| Keyword(1) | Shannon switching game |
| Keyword(2) | Pairing strategy |
| Keyword(3) | Forbidden-pair |
| Keyword(4) | Σ^P_2 -complete |
| 1st Author's Name | Ryosuke TAKAHASHI |
| 1st Author's Affiliation | Graduate School of Information Sciences, Tohoku University() |
| 2nd Author's Name | Eiji TAKIMOTO |
| 2nd Author's Affiliation | Graduate School of Information Sciences, Tohoku University |
| 3rd Author's Name | Akira MARUOKA |
| 3rd Author's Affiliation | Graduate School of Information Sciences, Tohoku University |
| Date | 2006-03-23 |
| Paper # | COMP2005-64 |
| Volume (vol) | vol.105 |
| Number (no) | 680 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |