IEICE Technical Committee Submission System
Conference Paper's Information
Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2006-03-23 09:35
Complexity of the pairing strategy for Shannon switching game
Ryosuke Takahashi, Eiji Takimoto, Akira Maruoka (Tohoku Univ.)
Abstract (in Japanese) (See Japanese page) 
(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 $\Sigma_2^P$-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) 
(in English) Shannon switching game / Pairing strategy / Forbidden-pair / $\Sigma_2^P$-complete / / / /  
Reference Info. IEICE Tech. Rep., vol. 105, no. 680, COMP2005-64, pp. 7-14, March 2006.
Paper # COMP2005-64 
Date of Issue 2006-03-16 (COMP) 
ISSN Print edition: ISSN 0913-5685  Online edition: ISSN 2432-6380
Download PDF

Conference Information
Committee COMP  
Conference Date 2006-03-22 - 2006-03-23 
Place (in Japanese) (See Japanese page) 
Place (in English) The University of Electro-Communications 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2006-03-COMP 
Language Japanese 
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) $\Sigma_2^P$-complete  
1st Author's Name Ryosuke Takahashi  
1st Author's Affiliation Tohoku University (Tohoku Univ.)
2nd Author's Name Eiji Takimoto  
2nd Author's Affiliation Tohoku University (Tohoku Univ.)
3rd Author's Name Akira Maruoka  
3rd Author's Affiliation Tohoku University (Tohoku Univ.)
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
Date Time 2006-03-23 09:35:00 
Presentation Time 35 
Registration for COMP 
Paper # IEICE-COMP2005-64 
Volume (vol) IEICE-105 
Number (no) no.680 
Page pp.7-14 
#Pages IEICE-8 
Date of Issue IEICE-COMP-2006-03-16 

[Return to Top Page]

[Return to IEICE Web Page]

The Institute of Electronics, Information and Communication Engineers (IEICE), Japan