Graph Searching, Parity Games and Imperfect Information

Details Graph Searching, Parity Games and Imperfect Information Graph Searching, Parity Games and Imperfect Information

2011-10-25

arxiv.org/abs/1110.5575v1

Computer Science

Computer Science and Game Theory

Scientific paper

We investigate the interrelation between graph searching games and games with imperfect information. As key consequence we obtain that parity games with bounded imperfect information can be solved in PTIME on graphs of bounded DAG-width which generalizes several results for parity games on graphs of bounded complexity. We use a new concept of graph searching where several cops try to catch multiple robbers instead of just a single robber. The main technical result is that the number of cops needed to catch r robbers monotonously is at most r times the DAG-width of the graph. We also explore aspects of this new concept as a refinement of directed path-width which accentuates its connection to the concept of imperfect information.

Affiliated with

Also associated with

No associations

Rating

Graph Searching, Parity Games and Imperfect Information does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Graph Searching, Parity Games and Imperfect Information, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graph Searching, Parity Games and Imperfect Information will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-95221