The examples given in the paper are single-player games. (Some of these are interesting toy games, i.e. the leftmost path problem and left move problem.) However, I believe the algorithm is adaptable to multiplayer games. (There are a couple of options for throttling the algorithm.)
Paper: http://www.lamsade.dauphine.fr/~cazenave/papers/nested.pdf
The examples given in the paper are single-player games. (Some of these are interesting toy games, i.e. the leftmost path problem and left move problem.) However, I believe the algorithm is adaptable to multiplayer games. (There are a couple of options for throttling the algorithm.)