Many problems arising in computational social choice are of high computational complexity, and some are located at higher levels of the Polynomial Hierarchy. We argue that a param...
—The aim of intelligence analysis is to make sense of information that is often conflicting or incomplete, and to weigh competing hypotheses that may explain a situation. This i...
Alice Toniolo, Timothy J. Norman, Anthony Etuk, Fe...
The inclusion of independent, imperfect knowledge that represents virtual agents’ belief of the local state of a narrative planning world has become a key component of narrative...
d Abstract) Anthony Etuk Timothy J. Norman Nir Oren Dept. of Computing Science University of Aberdeen, UK Murat ¸Sensoy Dept. of Computer Science Özye˘gin University, Turkey We...
Anthony Etuk, Timothy J. Norman, Nir Oren, Murat S...
Teams of voting agents are a powerful tool for solving complex problems. When forming such teams, there are three fundamental issues that must be addressed: (i) Selecting which ag...
We consider the classic problem of envy-free division of a heterogeneous good (aka the cake) among multiple agents. It is well known that if each agent must receive a contiguous p...
Voting among different agents is a powerful tool in problem solving, and it has been widely applied to improve the performance in finding the correct answer to complex problems. ...
PCP-nets generalize CP-nets to model conditional preferences with probabilistic uncertainty. In this paper we use PCP-nets in a multiagent context to compactly represent a collect...