no code implementations • 6 Oct 2023 • Alexander Lam, Haris Aziz, Toby Walsh
We consider the problem of locating a facility to serve a set of agents located along a line.
no code implementations • 27 Apr 2023 • Haris Aziz, Barton E. Lee, Sean Morota Chu, Jeremy Vollen
We propose a new axiom ``proportional representation fairness'' (PRF) that is designed for clustering problems where the selection of centroids reflects the distribution of data points and how tightly they are clustered together.
no code implementations • 11 Jan 2023 • Haris Aziz, Alexander Lam, Bo Li, Fahimeh Ramezani, Toby Walsh
On the other hand, in the randomized setting, we identify proportionally fair and strategyproof mechanisms that give an expected welfare within a constant factor of the optimal welfare.
no code implementations • 20 Jul 2022 • Haris Aziz, Arindam Pal, Ali Pourmiri, Fahimeh Ramezani, Brendan Sims
Task allocation using a team or coalition of robots is one of the most important problems in robotics, computer science, operational research, and artificial intelligence.
no code implementations • 30 May 2022 • Haris Aziz, Alexander Lam, Mashbat Suzuki, Toby Walsh
Proportionality is an attractive fairness concept that has been applied to a range of problems including the facility location problem, a classic problem in social choice.
no code implementations • 3 Nov 2021 • Haris Aziz, Alexander Lam
In contrast to the Gibbard-Satterthwaite theorem, many of the rules we examined are not obviously manipulable.
no code implementations • 2 Nov 2021 • Haris Aziz, Alexander Lam, Barton E. Lee, Toby Walsh
We show that imposing strategyproofness renders many of the axioms to be equivalent: the family of mechanisms that satisfy proportionality, unanimity, and strategyproofness is equivalent to the family of mechanisms that satisfy UFS and strategyproofness, which, in turn, is equivalent to the family of mechanisms that satisfy PF and strategyproofness.
no code implementations • 23 Mar 2021 • Haris Aziz, Hau Chan, Ágnes Cseh, Bo Li, Fahimeh Ramezani, Chenhao Wang
Multi-robot task allocation is one of the most fundamental classes of problems in robotics and is crucial for various real-world robotic applications such as search, rescue and area exploration.
no code implementations • 8 Feb 2021 • Haris Aziz, Florian Brandl
Rationing of healthcare resources has emerged as an important issue, which has been discussed by medical experts, policy-makers, and the general public.
Computer Science and Game Theory Theoretical Economics
no code implementations • 20 Aug 2020 • Haris Aziz, Florian Brandl
As a case study, we assume objects have priorities for agents and apply VER to sets of probabilistic allocations that are constrained by stability.
no code implementations • 22 Feb 2020 • Haris Aziz, Barton E. Lee
A well-known axiom for proportional representation is Proportionality of Solid Coalitions (PSC).
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 • 22 Nov 2019 • Haris Aziz, Hau Chan, Barton E. Lee, Bo Li, Toby Walsh
From the algorithmic perspective, we prove that the corresponding optimization problem, where the goal is to locate facilities to minimize either the total cost to all agents or the maximum cost of any agent is NP-hard.
no code implementations • 16 Jul 2019 • Haris Aziz, Simon Rey
We then present a clear taxonomy of the fairness concepts.
no code implementations • 4 Jun 2018 • Haris Aziz, Hau Chan, Barton E. Lee, David C. Parkes
The capacity constrained setting leads to a new strategic environment where a facility serves a subset of the population, which is endogenously determined by the ex-post Nash equilibrium of an induced subgame and is not directly controlled by the mechanism designer.
no code implementations • 30 Mar 2018 • Haris Aziz
Committee selection with diversity or distributional constraints is a ubiquitous problem.
no code implementations • 18 Mar 2018 • Haris Aziz, Jerome Lang, Jerome Monnot
Selecting a set of alternatives based on the preferences of agents is an important problem in committee selection and beyond.
no code implementations • 16 Nov 2017 • Haris Aziz, Barton E. Lee
We study a general model of social choice called Sub-Committee Voting (SCV) that simultaneously generalizes these settings.
no code implementations • 25 Aug 2017 • Haris Aziz, Barton Lee
In view of this, our proposed rule seems to be a compelling solution for achieving proportional representation in voting settings.
1 code implementation • 22 May 2017 • Erel Segal-haLevi, Haris Aziz, Avinatan Hassidim
We give a full characterization of allocations that are necessarily-proportional or possibly-proportional according to this assumption.
Computer Science and Game Theory
no code implementations • 20 Dec 2016 • Haris Aziz, Shenwei Huang
(2016) proposed an intermediate property called proportional justified representation that admits a polynomial-time algorithm to achieve.
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.
1 code implementation • 13 Apr 2016 • Haris Aziz, Omer Lev, Nicholas Mattei, Jeffrey S. Rosenschein, Toby Walsh
Peer reviews, evaluations, and selections are a fundamental aspect of modern science.
1 code implementation • 13 Apr 2016 • Haris Aziz, Simon Mackenzie
We resolve the problem by proposing a discrete and bounded envy-free protocol for any number of agents.
no code implementations • 26 Nov 2015 • Haris Aziz, Thomas Kalinowski, Toby Walsh, Lirong Xia
Sequential allocation is a simple and attractive mechanism for the allocation of indivisible goods.
no code implementations • 23 Sep 2015 • Haris Aziz, Paul Harrenstein, Jérôme Lang, Michael Wooldridge
The assumption of dichotomous preferences means that, additionally, each player's preference relation partitions the set of coalitions of which that player is a member into just two equivalence classes: satisfactory and unsatisfactory.
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 • 6 Dec 2014 • Haris Aziz, Toby Walsh, Lirong Xia
We focus on possible and necessary allocation problems, checking whether allocations of a given form occur in some or all mechanisms for several commonly used classes of sequential allocation mechanisms.
no code implementations • 21 Aug 2014 • Haris Aziz, Casey Cahan, Charles Gretton, Phillip Kilby, Nicholas Mattei, Toby Walsh
We propose and evaluate a number of solutions to the problem of calculating the cost to serve each location in a single-vehicle transport setting.
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 • 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.