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 De Haan, N Mattei, B Rastegari
Algorithmic Game Theory: 9th International Symposium, SAGT 2016, Liverpool …, 2016
67*2016
Complexity of the winner determination problem in judgment aggregation: Kemeny, Slater, Tideman, Young
U Endriss, R De Haan
432016
Stable matching with uncertain pairwise preferences
H Aziz, P Biró, T Fleiner, S Gaspers, R Haan
362017
Succinctness of languages for judgment aggregation
U Endriss, U Grandi, R De Haan, J Lang
AAAI Press, 2016
302016
Designing participatory budgeting mechanisms grounded in judgment aggregation
S Rey, U Endriss, R de Haan
Proceedings of the International Conference on Principles of Knowledge …, 2020
242020
Fixed-parameter tractable reductions to SAT
R de Haan, S Szeider
International Conference on Theory and Applications of Satisfiability …, 2014
232014
The parameterized complexity of reasoning problems beyond NP
R de Haan, S Szeider
Fourteenth International Conference on the Principles of Knowledge …, 2014
222014
How hard is cognitive science?
P Rich, R de Haan, T Wareham, I van Rooij
Proceedings of the annual meeting of the cognitive science society 43 (43), 2021
212021
Parameterized complexity results for agenda safety in judgment aggregation
U Endriss, R De Haan, S Szeider
202014
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
192020
Hunting for tractable languages for judgment aggregation
R De Haan
Sixteenth International Conference on Principles of Knowledge Representation …, 2018
192018
A compendium of parameterized problems at higher levels of the polynomial hierarchy
R de Haan, S Szeider
Algorithms 12 (9), 188, 2019
172019
The complexity landscape of outcome determination in judgment aggregation
U Endriss, R de Haan, J Lang, M Slavkovik
Journal of Artificial Intelligence Research 69, 687–731-687–731, 2020
162020
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
162017
Stable matching with uncertain pairwise preferences
H Aziz, P Biró, T Fleiner, S Gaspers, R De Haan, N Mattei, B Rastegari
Theoretical Computer Science 909, 1-11, 2022
132022
On the complexity of finding justifications for collective decisions
A Boixel, R de Haan
Proceedings of the AAAI Conference on Artificial Intelligence 35 (6), 5194-5201, 2021
132021
Parameterized Complexity in the Polynomial Hierarchy
R de Haan
Springer Berlin Heidelberg, 2019
132019
Parameterized complexity classes beyond para-NP
R de Haan, S Szeider
Journal of Computer and System Sciences 87, 16-57, 2017
132017
Pareto optimal allocation under uncertain preferences
H Aziz, R De Haan, B Rastegari
arXiv preprint arXiv:1609.02795, 2016
132016
Naturalism, tractability and the adaptive toolbox
P Rich, M Blokpoel, R de Haan, M Otworowska, M Sweers, T Wareham, ...
Synthese 198, 5749-5784, 2021
122021
The system can't perform the operation now. Try again later.
Articles 1–20