Follow
Ronald de Haan
Ronald de Haan
University of Amsterdam
Verified email at ronalddehaan.eu - Homepage
Title
Cited by
Cited by
Year
Stable matching with uncertain linear preferences
H Aziz, P Biró, S Gaspers, R Haan, N Mattei, B Rastegari
International Symposium on Algorithmic Game Theory, 195-206, 2016
43*2016
Complexity of the winner determination problem in judgment aggregation: Kemeny, Slater, Tideman, Young
U Endriss, R De Haan
372016
Stable matching with uncertain pairwise preferences
H Aziz, P Biró, T Fleiner, S Gaspers, R Haan
312017
Succinctness of languages for judgment aggregation
U Endriss, U Grandi, R De Haan, J Lang
Fifteenth International Conference on the Principles of Knowledge …, 2016
252016
Fixed-parameter tractable reductions to SAT
R Haan, S Szeider
International Conference on Theory and Applications of Satisfiability …, 2014
222014
The parameterized complexity of reasoning problems beyond NP
R de Haan, S Szeider
Fourteenth International Conference on the Principles of Knowledge …, 2014
212014
Parameterized complexity results for agenda safety in judgment aggregation
U Endriss, R De Haan, S Szeider
192014
A compendium of parameterized problems at higher levels of the polynomial hierarchy
R de Haan, S Szeider
Algorithms 12 (9), 188, 2019
152019
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
132018
Hunting for tractable languages for judgment aggregation
R De Haan
Sixteenth International Conference on Principles of Knowledge Representation …, 2018
122018
Pareto optimal allocation under uncertain preferences
H Aziz, R De Haan, B Rastegari
arXiv preprint arXiv:1609.02795, 2016
122016
Parameterized complexity classes beyond para-NP
R de Haan, S Szeider
Journal of Computer and System Sciences 87, 16-57, 2017
112017
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
112017
Parameterized complexity results for the Kemeny rule in judgment aggregation
R de Haan
Proceedings of the Twenty-second European Conference on Artificial …, 2016
112016
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 (01), 1740-1747, 2019
102019
Complexity results for manipulation, bribery and control of the Kemeny judgment aggregation procedure
R de Haan
Proceedings of the 16th Conference on Autonomous Agents and Multiagent …, 2017
102017
On the subexponential-time complexity of CSP
R De Haan, I Kanj, S Szeider
Journal of Artificial Intelligence Research 52, 203-234, 2015
102015
Machine characterizations for parameterized complexity classes beyond para-NP
R Haan, S Szeider
International Conference on Current Trends in Theory and Practice of …, 2015
102015
How intractability spans the cognitive and evolutionary levels of explanation
P Rich, M Blokpoel, R de Haan, I van Rooij
Topics in cognitive science 12 (4), 1382-1402, 2020
92020
Naturalism, tractability and the adaptive toolbox
P Rich, M Blokpoel, R de Haan, M Otworowska, M Sweers, T Wareham, ...
Synthese 198 (6), 5749-5784, 2021
82021
The system can't perform the operation now. Try again later.
Articles 1–20