Computer Science – Computer Science and Game Theory
Scientific paper
2010-06-08
EPTCS 25, 2010, pp. 146-161
Computer Science
Computer Science and Game Theory
Scientific paper
10.4204/EPTCS.25.15
This work studies the following question: can plays in a Muller game be stopped after a finite number of moves and a winner be declared. A criterion to do this is sound if Player 0 wins an infinite-duration Muller game if and only if she wins the finite-duration version. A sound criterion is presented that stops a play after at most 3^n moves, where n is the size of the arena. This improves the bound (n!+1)^n obtained by McNaughton and the bound n!+1 derived from a reduction to parity games.
Fearnley John
Zimmermann Martin
No associations
LandOfFree
Playing Muller Games in a Hurry 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 Playing Muller Games in a Hurry, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Playing Muller Games in a Hurry will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-29327