Sciweavers

165 search results - page 11 / 33
» Cryptographic Complexity Classes and Computational Intractab...
Sort
View
ECAI
2008
Springer
15 years 1 months ago
Theoretical and Computational Properties of Preference-based Argumentation
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 ...
Yannis Dimopoulos, Pavlos Moraitis, Leila Amgoud
FUN
2010
Springer
293views Algorithms» more  FUN 2010»
15 years 4 months ago
Computational Complexity of Two-Dimensional Platform Games
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...
Michal Forisek
CSFW
2010
IEEE
15 years 3 months ago
A Game-Based Definition of Coercion-Resistance and Its Applications
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,...
Ralf Küsters, Tomasz Truderung, Andreas Vogt
93
Voted
AAAI
2006
15 years 1 months ago
The Complexity of Bribery in Elections
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...
PODS
2007
ACM
196views Database» more  PODS 2007»
15 years 11 months ago
On the complexity of managing probabilistic XML data
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 ...
Pierre Senellart, Serge Abiteboul