Complexity of question/answer games (Q2378516): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2008.08.034 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2089085890 / rank | |||
Normal rank |
Revision as of 23:10, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Complexity of question/answer games |
scientific article |
Statements
Complexity of question/answer games (English)
0 references
8 January 2009
0 references
The referred paper is focused on the boundary between the game and complexity theory. It deals with a special type of 2-players game on an acyclic graph, where one of the players chooses a set of vertices and the second player chooses one of the edges starting in one of the chosen vertices. The game is repeated with a limited number of moves. The first player wins when the second player has no other move but the terminal one. The main results characterize the complexity of the considered Q/A games and of some of their modifications. It is also shown that for general strategies the problem is NP complete.
0 references
2-players game
0 references
Game on a graph
0 references
Q/A game
0 references
Complexity of game
0 references