10 citations · 30 across the 15 of their papers we have counts for
20 papers
Apportionment with Weighted Seats
Julian Chingoma, Ulle Endriss, Ronald de Haan +2
Apportionment is the task of assigning resources to entities with different entitlements in a fair manner, and specifically a manner that is as proportional as possible. The best-k…
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
One problem to solve in the context of information fusion, decision-making, and other artificial intelligence challenges is to compute justified beliefs based on evidence. In real-…
Viable Algorithmic Options for Creating and Adapting Emergent Software Systems
Todd Wareham, Ronald de Haan
Given the complexity of modern software systems, it is of great importance that such systems be able to autonomously modify themselves, i.e., self-adapt, with minimal human supervi…
Egalitarian Judgment Aggregation
Sirin Botan, Ronald de Haan, Marija Slavkovik +1
Egalitarian considerations play a central role in many areas of social choice theory. Applications of egalitarian principles range from ensuring everyone gets an equal share of a c…
Shortlisting Rules and Incentives in an End-to-End Model for Participatory Budgeting
Simon Rey, Ulle Endriss, Ronald de Haan
We introduce an end-to-end model of participatory budgeting grounded in social choice theory. This model accounts for both the first stage, in which participants propose projects t…
Decentralization in Open Quorum Systems
Andrea Bracciali, Davide Grossi, Ronald de Haan
Decentralisation is one of the promises introduced by blockchain technologies: fair and secure interaction amongst peers with no dominant positions, single points of failure or cen…
A Parameterized Complexity View on Description Logic Reasoning
Ronald de Haan
Description logics are knowledge representation languages that have been designed to strike a balance between expressivity and computational tractability. Many different descriptio…
Hunting for Tractable Languages for Judgment Aggregation
Ronald de Haan
Judgment aggregation is a general framework for collective decision making that can be used to model many different settings. Due to its general nature, the worst case complexity o…
Expressing Linear Orders Requires Exponential-Size DNNFs
Ronald de Haan
We show that any DNNF circuit that expresses the set of linear orders over a set of candidates must be of size . Moreover, we show that there exist DNNF circuits of s…
On the Computational Complexity of Model Checking for Dynamic Epistemic Logic with S5 Models
Ronald de Haan, Iris van de Pol
Dynamic epistemic logic (DEL) is a logical framework for representing and reasoning about knowledge change for multiple agents. An important computational task in this framework is…
Obtaining a Proportional Allocation by Deleting Items
Britta Dorn, Ronald de Haan, Ildikó Schlotter
We consider the following control problem on fair allocation of indivisible goods. Given a set of items and a set of agents, each having strict linear preference over the items…
Pareto Optimal Allocation under Uncertain Preferences
Haris Aziz, Ronald de Haan, Baharak Rastegari
The assignment problem is one of the most well-studied settings in social choice, matching, and discrete allocation. We consider the problem with the additional feature that agents…
Complexity Results for Manipulation, Bribery and Control of the Kemeny Procedure in Judgment Aggregation
Ronald de Haan
We study the computational complexity of several scenarios of strategic behavior for the Kemeny procedure in the setting of judgment aggregation. In particular, we investigate (1)…
Stable Matching with Uncertain Linear Preferences
Haris Aziz, Péter Biró, Serge Gaspers +3
We consider the two-sided stable matching setting in which there may be uncertainty about the agents' preferences due to limited information or communication. We consider three mod…
Characterizing Polynomial Ramsey Quantifiers
Ronald de Haan, Jakub Szymanik
Ramsey quantifiers are a natural object of study not only for logic and computer science, but also for the formal semantics of natural language. Restricting attention to finite mod…
The Parameterized Complexity of Reasoning Problems Beyond NP
Ronald de Haan, Stefan Szeider
Today's propositional satisfiability (SAT) solvers are extremely powerful and can be used as an efficient back-end for solving NP-complete problems. However, many fundamental probl…
Parameterized Complexity Results for Plan Reuse
Ronald de Haan, Anna Roubíčková, Stefan Szeider
Planning is a notoriously difficult computational problem of high worst-case complexity. Researchers have been investing significant efforts to develop heuristics or restrictions t…
Local Backbones
Ronald de Haan, Iyad Kanj, Stefan Szeider
A backbone of a propositional CNF formula is a variable whose truth value is the same in every truth assignment that satisfies the formula. The notion of backbones for CNF formulas…
Functional Logic Programming with Generalized Circular Coinduction
Ronald de Haan
We propose a method to adapt functional logic programming to deal with reasoning on coinductively interpreted programs as well as on inductively interpreted programs. In order to d…
The RegularGcc Matrix Constraint
Ronald de Haan, Nina Narodytska, Toby Walsh
We study propagation of the RegularGcc global constraint. This ensures that each row of a matrix of decision variables satisfies a Regular constraint, and each column satisfies a G…