Sciweavers

330 search results - page 11 / 66
» Open Problems in Logic and Games
Sort
View
APAL
2008
104views more  APAL 2008»
13 years 8 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy
SODA
2010
ACM
232views Algorithms» more  SODA 2010»
14 years 5 months ago
On the Optimality of Spiral Search
Searching for a point in the plane is a well-known search game problem introduced in the early eigthies. The best known search strategy is given by a spiral and achieves a competi...
Elmar Langetepe
ATAL
2009
Springer
14 years 2 months ago
Boolean combinations of weighted voting games
Weighted voting games are a natural and practically important class of simple coalitional games, in which each agent is assigned a numeric weight, and a coalition is deemed to be ...
Piotr Faliszewski, Edith Elkind, Michael Wooldridg...
AAIM
2009
Springer
105views Algorithms» more  AAIM 2009»
14 years 2 months ago
On Acyclicity of Games with Cycles
We study restricted improvement cycles (ri-cycles) in finite positional n-person games with perfect information modeled by directed graphs (digraphs) that may contain cycles. We o...
Daniel Andersson, Vladimir Gurvich, Thomas Dueholm...
CONCUR
1999
Springer
14 years 7 days ago
Robust Satisfaction
In order to check whether an open system satisfies a desired property, we need to check the behavior of the system with respect to an arbitrary environment. In the most general se...
Orna Kupferman, Moshe Y. Vardi