Search Results for author:
Found 8 papers, 0 papers with code
From Matching with Diversity Constraints to Matching with Regional Quotas
In this paper, we present a polynomial-time reduction to transform an instance of (1) to an instance of (2) and we show how the feasibility and stability of corresponding matchings are preserved under the reduction.
Interdependent Scheduling Games
We propose a model of interdependent scheduling games in which each player controls a set of services that they schedule independently.
Backdoors into Heterogeneous Classes of SAT and CSP
In this paper we extend the classical notion of strong and weak backdoor sets for SAT and CSP by allowing that different instantiations of the backdoor variables result in instances that belong to different base classes; the union of the base classes forms a heterogeneous base class.
Online Fair Division: analysing a Food Bank problem
We study an online model of fair division designed to capture features of a real world charity problem.
Computational Aspects of Multi-Winner Approval Voting
We study computational aspects of three prominent voting rules that use approval ballots to elect multiple winners.
Guarantees and Limits of Preprocessing in Constraint Satisfaction and Reasoning
We show that for most of the considered problems, task (i) admits a polynomial-time preprocessing to a problem kernel whose size is polynomial in a structural problem parameter of the input, in contrast to task (ii) which does not admit such a reduction to a problem kernel of polynomial size, subject to a complexity theoretic assumption.
Fair assignment of indivisible objects under ordinal preferences
The computational complexity of checking whether a fair assignment exists is studied for these fairness notions.
Coalitional Manipulation for Schulze's Rule
Schulze's rule is used in the elections of a large number of organizations including Wikimedia and Debian.
