Sciweavers

1283 search results - page 92 / 257
» Science: the rules of the game
Sort
View
MFCS
2010
Springer
14 years 8 months ago
Asynchronous Omega-Regular Games with Partial Information
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...
Bernd Puchala
STOC
2012
ACM
193views Algorithms» more  STOC 2012»
13 years 9 days ago
A new point of NP-hardness for unique games
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 + )-...
Ryan O'Donnell, John Wright
ICALP
2009
Springer
15 years 10 months ago
The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games
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...
Michael Ummels, Dominik Wojtczak
CHI
2008
ACM
15 years 10 months ago
Socially respectful enjoyment tracking for tabletop games
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...
Ben Kirman, Duncan Rowland
LICS
2009
IEEE
15 years 4 months ago
Winning Concurrent Reachability Games Requires Doubly-Exponential Patience
—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...
Kristoffer Arnsfelt Hansen, Michal Koucký, ...