Sciweavers

330 search results - page 13 / 66
» Open Problems in Logic and Games
Sort
View
ACMICEC
2006
ACM
111views ECommerce» more  ACMICEC 2006»
13 years 11 months ago
Passive verification of the strategyproofness of mechanisms in open environments
Consider an open infrastructure in which anyone can deploy mechanisms to support automated decision making and coordination amongst self-interested computational agents. Strategyp...
Laura Kang, David C. Parkes
CONCUR
2010
Springer
13 years 9 months ago
Obliging Games
Abstract. Graph games of infinite length provide a natural model for open reactive systems: one player (Eve) represents the controller and the other player (Adam) represents the en...
Krishnendu Chatterjee, Florian Horn, Christof L&ou...
SIAMCOMP
2008
133views more  SIAMCOMP 2008»
13 years 7 months ago
A Deterministic Subexponential Algorithm for Solving Parity Games
The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest known algorithms for the problem are randomized algorithms that r...
Marcin Jurdzinski, Mike Paterson, Uri Zwick
CSL
2008
Springer
13 years 9 months ago
Characterization of Logics over Ranked Tree Languages
We study the expressive power of the logics EF + F-1 , 2 and boolean combinations of 1 over ranked trees. In particular, we provide effective characterizations of those three logic...
Thomas Place
ACMACE
2009
ACM
14 years 20 days ago
Critical gameplay
How do games effect the way we problem solve, socialize, or even view the world? When we shoot do we learn to destroy obstacles instead of work around them? Does the binary world ...
Lindsay Grace