We address the strategy problem for ω-regular two-player games with partial information, played on finite game graphs. We consider two different kinds of observability on a gene...
d abstract; full version begins on page 13) Ryan O’Donnell∗ John Wright† November 2, 2011 We show that distinguishing 1 2 -satisfiable Unique-Games instances from (3 8 + )-...
We analyse the computational complexity of finding Nash equilibria in simple stochastic multiplayer games. We show that restricting the search space to equilibria whose payoffs fal...
This paper describes the current state of our ongoing work developing tools for tracking player enjoyment in traditional face-to-face tabletop gaming situations. The challenge pre...
—We exhibit a deterministic concurrent reachability game PURGATORYn with n non-terminal positions and a binary choice for both players in every position so that any positional st...