Ronald de Haan
Ronald de Haan
University of Amsterdam
Geverifieerd e-mailadres voor ronalddehaan.eu - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
Complexity of the winner determination problem in judgment aggregation: Kemeny, Slater, Tideman, Young
U Endriss, R de Haan
282016
Stable matching with uncertain linear preferences
H Aziz, P Biró, S Gaspers, R De Haan, N Mattei, B Rastegari
International Symposium on Algorithmic Game Theory, 195-206, 2016
25*2016
Stable matching with uncertain pairwise preferences
H Aziz, P Biró, T Fleiner, S Gaspers, R Haan
242017
Fixed-parameter tractable reductions to SAT
R de Haan, S Szeider
International Conference on Theory and Applications of Satisfiability …, 2014
212014
The parameterized complexity of reasoning problems beyond NP
R de Haan, S Szeider
arXiv preprint arXiv:1312.1672, 2013
212013
Succinctness of languages for judgment aggregation
U Endriss, U Grandi, R De Haan, J Lang
AAAI Press, 2016
192016
Parameterized complexity results for agenda safety in judgment aggregation
U Endriss, R De Haan, S Szeider
182014
A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy
R de Haan, S Szeider
Algorithms 12 (9), 188, 2019
132019
Parameterized complexity classes beyond para-NP
R de Haan, S Szeider
Journal of Computer and System Sciences 87, 16-57, 2017
102017
Parameterized complexity results for the Kemeny rule in judgment aggregation
R de Haan
Proceedings of the Twenty-second European Conference on Artificial …, 2016
102016
Pareto optimal allocation under uncertain preferences
H Aziz, R De Haan, B Rastegari
arXiv preprint arXiv:1609.02795, 2016
92016
Machine characterizations for parameterized complexity classes beyond para-NP
R de Haan, S Szeider
International Conference on Current Trends in Theory and Practice of …, 2015
92015
Complexity Results for Manipulation, Bribery and Control of the Kemeny Judgment Aggregation Procedure.
R de Haan
AAMAS, 1151-1159, 2017
82017
Complexity results for aggregating judgments using scoring or distance-based procedures
R de Haan, M Slavkovik
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent …, 2017
82017
Fixed-parameter tractable reductions to SAT for planning
R De Haan, M Kronegger, A Pfandler
Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015
82015
On the subexponential-time complexity of CSP
R De Haan, I Kanj, S Szeider
Journal of Artificial Intelligence Research 52, 203-234, 2015
82015
Aggregating incomplete judgments: Axiomatisations for scoring rules
Z Terzopoulou, U Endriss, R de Haan
Proceedings of the 7th international workshop on computational social choice …, 2018
72018
Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics.
R de Haan, S Szeider
KR, 453-462, 2016
72016
Parameterized complexity results for plan reuse
R De Haan, A Roubíčková, S Szeider
arXiv preprint arXiv:1307.4440, 2013
72013
Pareto optimal allocation under compact uncertain preferences
H Aziz, P Biro, R De Haan, B Rastegari
Proceedings of the AAAI Conference on Artificial Intelligence 33, 1740-1747, 2019
62019
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20