During the last years, argumentation has been gaining increasing interest in modeling different reasoning tasks of an agent. Many recent works have acknowledged the importance of ...
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
Coercion-resistance is one of the most important and intricate security requirements for voting protocols. Several definitions of coercion-resistance have posed in the literature,...
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by a certain amount of bribing voter...
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hem...
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...