Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...
cting knowledge base can be seen abstractly as a set of arguments and a binary relation characterising conflict among them. There may be multiple plausible ways to evaluate confli...
This paper presents an argumentative version of the well known alternating offers negotiation protocol. The negotichanism is based on an abstract preference based argumentation fr...
The hurdles in solving Constrained Optimization Problems (COP) arise from the challenge of searching a huge variable space in order to locate feasible points with acceptable solut...
Abu S. S. M. Barkat Ullah, Ruhul A. Sarker, David ...
In the course of the recent complexification and sophistication of commercial computer games, the creation of competitive artificial players that are able to behave intelligentl...
Steffen Priesterjahn, Alexander Weimer, Markus Ebe...