Ronald de Haan

According to our database, Ronald de Haan authored at least 63 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Apportionment with Weighted Seats.

Julian Chingoma, Ulle Endriss, Ronald de Haan, Adrian Haret, Jan Maly

CoRR, 2024

Complexity Results and Algorithms for Manipulation and Bribery in Judgment Aggregation.

Ari Conati, Andreas Niskanen, Ronald de Haan, Matti Järvisalo

Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

2023

Egalitarian judgment aggregation.

Sirin Botan, Ronald de Haan, Marija Slavkovik, Zoi Terzopoulou

Auton. Agents Multi Agent Syst., June, 2023

Swarm Control for Distributed Construction: A Computational Complexity Perspective.

Todd Wareham, Ronald de Haan, Andrew Vardy, Iris van Rooij

ACM Trans. Hum. Robot Interact., 2023

All instances of MONOTONE 3-SAT-(3, 1) are satisfiable.

Hannah Van Santvliet, Ronald de Haan

CoRR, 2023

A Belief Model for Conflicting and Uncertain Evidence: Connecting Dempster-Shafer Theory and the Topology of Evidence.

Daira Pinto Prieto, Ronald de Haan, Aybüke Özgün

Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, 2023

2022

Stable matching with uncertain pairwise preferences.

Haris Aziz, Péter Biró, Tamás Fleiner, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari

Theor. Comput. Sci., 2022

Viable Algorithmic Options for Creating and Adapting Emergent Software Systems.

Todd Wareham, Ronald de Haan

CoRR, 2022

Using hierarchies to efficiently combine evidence with Dempster's rule of combination.

Daira Pinto Prieto, Ronald de Haan

Proceedings of the Uncertainty in Artificial Intelligence, 2022

Intractability of Bayesian belief-updating during communication.

Laura van de Braak, Ronald de Haan, Iris van Rooij, Mark Blokpoel

Proceedings of the 44th Annual Meeting of the Cognitive Science Society, 2022

Simulating Multiwinner Voting Rules in Judgment Aggregation.

Julian Chingoma, Ulle Endriss, Ronald de Haan

Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

A Calculus for Computing Structured Justifications for Election Outcomes.

Arthur Boixel, Ulle Endriss, Ronald de Haan

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Naturalism, tractability and the adaptive toolbox.

Patricia Rich, Mark Blokpoel, Ronald de Haan, Maria Otworowska, Marieke Sweers, Todd Wareham, Iris van Rooij

Synth., 2021

On the Computational Complexity of Model Checking for Dynamic Epistemic Logic with S5 Models.

Ronald de Haan, Iris van de Pol

FLAP, 2021

Obtaining a Proportional Allocation by Deleting Items.

Britta Dorn, Ronald de Haan, Ildikó Schlotter

Algorithmica, 2021

Shortlisting Rules and Incentives in an End-to-End Model for Participatory Budgeting.

Simon Rey, Ulle Endriss, Ronald de Haan

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Why is scaling up models of language evolution hard?

Marieke Woensdregt, Matthew Spike, Ronald de Haan, Todd Wareham, Iris van Rooij, Mark Blokpoel

Proceedings of the 43rd Annual Meeting of the Cognitive Science Society, 2021

How hard is cognitive science?

Patricia Rich, Ronald de Haan, Todd Wareham, Iris van Rooij

Proceedings of the 43rd Annual Meeting of the Cognitive Science Society, 2021

On the Complexity of Finding Justifications for Collective Decisions.

Arthur Boixel, Ronald de Haan

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

How Intractability Spans the Cognitive and Evolutionary Levels of Explanation.

Patricia Rich, Mark Blokpoel, Ronald de Haan, Iris van Rooij

Top. Cogn. Sci., 2020

On Existential MSO and Its Relation to ETH.

Robert Ganian, Ronald de Haan, Iyad Kanj, Stefan Szeider

ACM Trans. Comput. Theory, 2020

The Complexity Landscape of Outcome Determination in Judgment Aggregation.

Ulle Endriss, Ronald de Haan, Jérôme Lang, Marija Slavkovik

J. Artif. Intell. Res., 2020

Stable Matching with Uncertain Linear Preferences.

Haris Aziz, Péter Biró, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari

Algorithmica, 2020

Decentralization in Open Quorum Systems: Limitative Results for Ripple and Stellar.

Andrea Bracciali, Davide Grossi, Ronald de Haan

Proceedings of the 2nd International Conference on Blockchain Economics, 2020

Designing Participatory Budgeting Mechanisms Grounded in Judgment Aggregation.

Simon Rey, Ulle Endriss, Ronald de Haan

Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

2019

Parameterized Complexity in the Polynomial Hierarchy - Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy

Ronald de Haan

Lecture Notes in Computer Science 11880, Springer, ISBN: 978-3-662-60669-8, 2019

Characterizing polynomial Ramsey quantifiers.

Ronald de Haan, Jakub Szymanik

Math. Struct. Comput. Sci., 2019

Decentralization in Open Quorum Systems.

Andrea Bracciali, Davide Grossi, Ronald de Haan

CoRR, 2019

A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy.

Ronald de Haan, Stefan Szeider

Algorithms, 2019

Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity.

Haris Aziz, Péter Biró, Ronald de Haan, Baharak Rastegari

Artif. Intell., 2019

Answer Set Programming for Judgment Aggregation.

Ronald de Haan, Marija Slavkovik

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Pareto Optimal Allocation under Compact Uncertain Preferences.

Haris Aziz, Péter Biró, Ronald de Haan, Baharak Rastegari

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Expressing Linear Orders Requires Exponential-Size DNNFs.

Ronald de Haan

CoRR, 2018

A Parameterized Complexity View on Description Logic Reasoning.

Ronald de Haan

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, 2018

Hunting for Tractable Languages for Judgment Aggregation.

Ronald de Haan

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, 2018

Restricted Power - Computational Complexity Results for Strategic Defense Games.

Ronald de Haan, Petra Wolf

Proceedings of the 9th International Conference on Fun with Algorithms, 2018

Tool Auctions.

Janosch Döcker, Britta Dorn, Ulle Endriss, Ronald de Haan, Sebastian Schneckenburger

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances.

Ronald de Haan, Iyad A. Kanj, Stefan Szeider

ACM Trans. Comput. Log., 2017

Parameterized complexity classes beyond para-NP.

Ronald de Haan, Stefan Szeider

J. Comput. Syst. Sci., 2017

Pareto Optimal Allocation under Uncertain Preferences.

Haris Aziz, Ronald de Haan, Baharak Rastegari

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Complexity Results for Aggregating Judgments using Scoring or Distance-Based Procedures.

Ronald de Haan, Marija Slavkovik

Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

Complexity Results for Manipulation, Bribery and Control of the Kemeny Judgment Aggregation Procedure.

Ronald de Haan

Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

2016

Complexity Results for Manipulation, Bribery and Control of the Kemeny Procedure in Judgment Aggregation.

Ronald de Haan

CoRR, 2016

Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics.

Ronald de Haan, Stefan Szeider

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, 2016

Succinctness of Languages for Judgment Aggregation.

Ulle Endriss, Umberto Grandi, Ronald de Haan, Jérôme Lang

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, 2016

Parametrisierte Komplexität in der polynomiellen Hierarchie.

Ronald de Haan

Proceedings of the Ausgezeichnete Informatikdissertationen 2016, 2016

Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation.

Ronald de Haan

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

2015

On the Subexponential-Time Complexity of CSP.

Ronald de Haan, Iyad A. Kanj, Stefan Szeider

J. Artif. Intell. Res., 2015

An Overview of Non-Uniform Parameterized Complexity.

Ronald de Haan

Electron. Colloquium Comput. Complex., 2015

A Dichotomy Result for Ramsey Quantifiers.

Ronald de Haan, Jakub Szymanik

Proceedings of the Logic, Language, Information, and Computation, 2015

Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP.

Ronald de Haan, Stefan Szeider

Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

Fixed-Parameter Tractable Reductions to SAT for Planning.

Ronald de Haan, Martin Kronegger, Andreas Pfandler

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Parameterized Complexity Results for Agenda Safety in Judgment Aggregation.

Ulle Endriss, Ronald de Haan, Stefan Szeider

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Complexity of the Winner Determination Problem in Judgment Aggregation: Kemeny, Slater, Tideman, Young.

Ulle Endriss, Ronald de Haan

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014

Fixed-Parameter Tractable Reductions to SAT.

Ronald de Haan, Stefan Szeider

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

The Parameterized Complexity of Reasoning Problems Beyond NP.

Ronald de Haan, Stefan Szeider

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, 2014

Small Unsatisfiable Subsets in Constraint Satisfaction.

Ronald de Haan, Iyad A. Kanj, Stefan Szeider

Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

Subexponential Time Complexity of CSP with Global Constraints.

Ronald de Haan, Iyad A. Kanj, Stefan Szeider

Proceedings of the Principles and Practice of Constraint Programming, 2014

2013

Local Backbones.

Ronald de Haan, Iyad A. Kanj, Stefan Szeider

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

Parameterized Complexity Results for Plan Reuse.

Ronald de Haan, Anna Roubícková, Stefan Szeider

Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012

Functional Logic Programming with Generalized Circular Coinduction

Ronald de Haan

CoRR, 2012

Detecting Temporally Related Arithmetical Patterns - An Extension of Complex Event Processing.

Ronald de Haan, Mikhail Roshchin

Proceedings of the KDIR 2012 - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval, Barcelona, Spain, 4, 2012

The RegularGcc Matrix Constraint.

Ronald de Haan, Nina Narodytska, Toby Walsh

Proceedings of the AI 2012: Advances in Artificial Intelligence, 2012