no code implementations • 17 Feb 2020 • Haris Aziz, Serge Gaspers, Zhaohong Sun, Toby Walsh
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.
no code implementations • 31 May 2016 • Andres Abeliuk, Haris Aziz, Gerardo Berbeglia, Serge Gaspers, Petr Kalina, Nicholas Mattei, Dominik Peters, Paul Stursberg, Pascal Van Hentenryck, Toby Walsh
We propose a model of interdependent scheduling games in which each player controls a set of services that they schedule independently.
no code implementations • 18 Sep 2015 • Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Živný
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.
no code implementations • 26 Feb 2015 • Martin Aleksandrov, Haris Aziz, Serge Gaspers, Toby Walsh
We study an online model of fair division designed to capture features of a real world charity problem.
no code implementations • 11 Jul 2014 • Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Simon Mackenzie, Nicholas Mattei, Toby Walsh
We study computational aspects of three prominent voting rules that use approval ballots to elect multiple winners.
no code implementations • 12 Jun 2014 • Serge Gaspers, Stefan Szeider
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.
no code implementations • 23 Dec 2013 • Haris Aziz, Serge Gaspers, Simon Mackenzie, Toby Walsh
The computational complexity of checking whether a fair assignment exists is studied for these fairness notions.
no code implementations • 3 Apr 2013 • Serge Gaspers, Thomas Kalinowski, Nina Narodytska, Toby Walsh
Schulze's rule is used in the elections of a large number of organizations including Wikimedia and Debian.