10 citations · 30 across the 15 of their papers we have counts for
4 papers · 1 filter
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…