While there is a broad theoretic foundation for creating computational players for two-player games, such as Chess, the multi-player domain is not as well explored. We make an att...
In the process of interactive theorem proving one often works with incomplete higher order proofs. In this paper we address the problem of giving a correctness criterion for these ...
This paper presents a novel, unified distributed constraint satisfaction framework based on automated negotiation. The Distributed Constraint Satisfaction Problem (DCSP) is one t...
Trust and reputation measures are crucial in distributed open systems where agents need to decide whom or what to choose. Existing work has mainly focused on the reputation of sing...
Given a specification of communication rules in a multiagent system (in the form of protocols, ACL semantics, etc.), the question of how to design appropriate agents that can oper...