A long and lasting problem in agent research has been to close the gap between agent logics and agent programming frameworks. The main reason for this problem of establishing a li...
Koen V. Hindriks, Frank S. de Boer, Wiebe van der ...
In this work we use cryptography to solve a game-theoretic problem which arises naturally in the area of two party strategic games. The standard game-theoretic solution concept for...
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Agent-based computing in Arti cial Intelligence has given rise to a number of diverse and competing proposals for agent programming languages. Agents, in the sense we are using it...
Koen V. Hindriks, Frank S. de Boer, Wiebe van der ...
Set-based analysis is a constraint-based whole program analysis that is applicable to functional and objectoriented programming languages. Unfortunately, the analysis is useless f...