Sciweavers

16 search results - page 2 / 4
» Some Notes on the Formal Properties of Bidirectional Optimal...
Sort
View
ATAL
2010
Springer
13 years 5 months ago
Verifying agents with memory is harder than it seemed
ATL+ is a variant of alternating-time temporal logic that does not have the expressive power of full ATL , but still allows for expressing some natural properties of agents. It ha...
Nils Bulling, Wojciech Jamroga
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
13 years 3 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
Paul W. Goldberg
AC
2000
Springer
13 years 9 months ago
The Join Calculus: A Language for Distributed Mobile Programming
In these notes, we give an overview of the join calculus, its semantics, and its equational theory. The join calculus is a language that models distributed and mobile programming. ...
Cédric Fournet, Georges Gonthier
IANDC
2006
101views more  IANDC 2006»
13 years 5 months ago
Mind change efficient learning
This paper studies efficient learning with respect to mind changes. Our starting point is the idea that a learner that is efficient with respect to mind changes minimizes mind cha...
Wei Luo, Oliver Schulte
AAAI
2007
13 years 7 months ago
Dominance and Equivalence for Sensor-Based Agents
This paper describes recent results from the robotics community that develop a theory, similar in spirit to the theory of computation, for analyzing sensor-based agent systems. Th...
Jason M. O'Kane, Steven M. LaValle