Alert button
Picture for Haris Aziz

Haris Aziz

Alert button

Nash Welfare and Facility Location

Oct 06, 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. The Nash welfare objective function, defined as the product of the agents' utilities, is known to provide a compromise between fairness and efficiency in resource allocation problems. We apply this welfare notion to the facility location problem, converting individual costs to utilities and analyzing the facility placement that maximizes the Nash welfare. We give a polynomial-time approximation algorithm to compute this facility location, and prove results suggesting that it achieves a good balance of fairness and efficiency. Finally, we take a mechanism design perspective and propose a strategy-proof mechanism with a bounded approximation ratio for Nash welfare.

Viaarxiv icon

Proportionally Representative Clustering

Apr 27, 2023
Haris Aziz, Barton E. Lee, Sean Morota Chu

Figure 1 for Proportionally Representative Clustering
Figure 2 for Proportionally Representative Clustering
Figure 3 for Proportionally Representative Clustering
Figure 4 for Proportionally Representative Clustering

In recent years, there has been a surge in effort to formalize notions of fairness in machine learning. We focus on clustering -- one of the fundamental tasks in unsupervised machine learning. We propose a new axiom that captures proportional representation fairness (PRF). We make a case that the concept achieves the raison d'{\^{e}}tre of several existing concepts in the literature in an arguably more convincing manner. Our fairness concept is not satisfied by existing fair clustering algorithms. We design efficient algorithms to achieve PRF both for unconstrained and discrete clustering problems.

Viaarxiv icon

Proportional Fairness in Obnoxious Facility Location

Jan 11, 2023
Haris Aziz, Alexander Lam, Bo Li, Fahimeh Ramezani, Toby Walsh

Figure 1 for Proportional Fairness in Obnoxious Facility Location
Figure 2 for Proportional Fairness in Obnoxious Facility Location
Figure 3 for Proportional Fairness in Obnoxious Facility Location
Figure 4 for Proportional Fairness in Obnoxious Facility Location

We consider the obnoxious facility location problem (in which agents prefer the facility location to be far from them) and propose a hierarchy of distance-based proportional fairness concepts for the problem. These fairness axioms ensure that groups of agents at the same location are guaranteed to be a distance from the facility proportional to their group size. We consider deterministic and randomized mechanisms, and compute tight bounds on the price of proportional fairness. In the deterministic setting, not only are our proportional fairness axioms incompatible with strategyproofness, the Nash equilibria may not guarantee welfare within a constant factor of the optimal welfare. 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.

Viaarxiv icon

Task Allocation using a Team of Robots

Jul 20, 2022
Haris Aziz, Arindam Pal, Ali Pourmiri, Fahimeh Ramezani, Brendan Sims

Figure 1 for Task Allocation using a Team of Robots

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. In recent work, research has focused on handling complex objectives and feasibility constraints amongst other variations of the multi-robot task allocation problem. There are many examples of important research progress in these directions. We present a general formulation of the task allocation problem that generalizes several versions that are well-studied. Our formulation includes the states of robots, tasks, and the surrounding environment in which they operate. We describe how the problem can vary depending on the feasibility constraints, objective functions, and the level of dynamically changing information. In addition, we discuss existing solution approaches for the problem including optimization-based approaches, and market-based approaches.

* Accepted for publication in the journal Current Robotics Reports 
Viaarxiv icon

Random Rank: The One and Only Strategyproof and Proportionally Fair Randomized Facility Location Mechanism

May 30, 2022
Haris Aziz, Alexander Lam, Mashbat Suzuki, Toby Walsh

Figure 1 for Random Rank: The One and Only Strategyproof and Proportionally Fair Randomized Facility Location Mechanism
Figure 2 for Random Rank: The One and Only Strategyproof and Proportionally Fair Randomized Facility Location Mechanism
Figure 3 for Random Rank: The One and Only Strategyproof and Proportionally Fair Randomized Facility Location Mechanism

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. In our work, we propose a concept called Strong Proportionality, which ensures that when there are two groups of agents at different locations, both groups incur the same total cost. We show that although Strong Proportionality is a well-motivated and basic axiom, there is no deterministic strategyproof mechanism satisfying the property. We then identify a randomized mechanism called Random Rank (which uniformly selects a number $k$ between $1$ to $n$ and locates the facility at the $k$'th highest agent location) which satisfies Strong Proportionality in expectation. Our main theorem characterizes Random Rank as the unique mechanism that achieves universal truthfulness, universal anonymity, and Strong Proportionality in expectation among all randomized mechanisms. Finally, we show via the AverageOrRandomRank mechanism that even stronger ex-post fairness guarantees can be achieved by weakening universal truthfulness to strategyproofness in expectation.

Viaarxiv icon

Obvious Manipulability of Voting Rules

Nov 03, 2021
Haris Aziz, Alexander Lam

Figure 1 for Obvious Manipulability of Voting Rules
Figure 2 for Obvious Manipulability of Voting Rules
Figure 3 for Obvious Manipulability of Voting Rules

The Gibbard-Satterthwaite theorem states that no unanimous and non-dictatorial voting rule is strategyproof. We revisit voting rules and consider a weaker notion of strategyproofness called not obvious manipulability that was proposed by Troyan and Morrill (2020). We identify several classes of voting rules that satisfy this notion. We also show that several voting rules including k-approval fail to satisfy this property. We characterize conditions under which voting rules are obviously manipulable. One of our insights is that certain rules are obviously manipulable when the number of alternatives is relatively large compared to the number of voters. In contrast to the Gibbard-Satterthwaite theorem, many of the rules we examined are not obviously manipulable. This reflects the relatively easier satisfiability of the notion and the zero information assumption of not obvious manipulability, as opposed to the perfect information assumption of strategyproofness. We also present algorithmic results for computing obvious manipulations and report on experiments.

Viaarxiv icon

Strategyproof and Proportionally Fair Facility Location

Nov 02, 2021
Haris Aziz, Alexander Lam, Barton E. Lee, Toby Walsh

Figure 1 for Strategyproof and Proportionally Fair Facility Location
Figure 2 for Strategyproof and Proportionally Fair Facility Location
Figure 3 for Strategyproof and Proportionally Fair Facility Location
Figure 4 for Strategyproof and Proportionally Fair Facility Location

We focus on a simple, one-dimensional collective decision problem (often referred to as the facility location problem) and explore issues of strategyproofness and proportional fairness. We present several characterization results for mechanisms that satisfy strategyproofness and varying levels of proportional fairness. We also characterize one of the mechanisms as the unique equilibrium outcome for any mechanism that satisfies natural fairness and monotonicity properties. Finally, we identify strategyproof and proportionally fair mechanisms that provide the best welfare-optimal approximation among all mechanisms that satisfy the corresponding fairness axiom.

Viaarxiv icon

Multi-Robot Task Allocation -- Complexity and Approximation

Mar 23, 2021
Haris Aziz, Hau Chan, Ágnes Cseh, Bo Li, Fahimeh Ramezani, Chenhao Wang

Figure 1 for Multi-Robot Task Allocation -- Complexity and Approximation

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. We consider the Single-Task robots and Multi-Robot tasks Instantaneous Assignment (ST-MR-IA) setting where each task requires at least a certain number of robots and each robot can work on at most one task and incurs an operational cost for each task. Our aim is to consider a natural computational problem of allocating robots to complete the maximum number of tasks subject to budget constraints. We consider budget constraints of three different kinds: (1) total budget, (2) task budget, and (3) robot budget. We provide a detailed complexity analysis including results on approximations as well as polynomial-time algorithms for the general setting and important restricted settings.

* AAMAS 2021 
Viaarxiv icon

A characterization of proportionally representative committees

Feb 22, 2020
Haris Aziz, Barton E. Lee

A well-known axiom for proportional representation is Proportionality of Solid Coalitions (PSC). We characterize committees satisfying PSC as possible outcomes of the Minimal Demand rule, which generalizes an approach pioneered by Michael Dummett.

Viaarxiv icon

From Matching with Diversity Constraints to Matching with Regional Quotas

Feb 17, 2020
Haris Aziz, Serge Gaspers, Zhaohong Sun, Toby Walsh

Figure 1 for From Matching with Diversity Constraints to Matching with Regional Quotas
Figure 2 for From Matching with Diversity Constraints to Matching with Regional Quotas
Figure 3 for From Matching with Diversity Constraints to Matching with Regional Quotas
Figure 4 for From Matching with Diversity Constraints to Matching with Regional Quotas

In the past few years, several new matching models have been proposed and studied that take into account complex distributional constraints. Relevant lines of work include (1) school choice with diversity constraints where students have (possibly overlapping) types and (2) hospital-doctor matching where various regional quotas are imposed. 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. Our reduction provides a formal connection between two important strands of work on matching with distributional constraints. We then apply the reduction in two ways. Firstly, we show that it is NP-complete to check whether a feasible and stable outcome for (1) exists. Due to our reduction, these NP-completeness results carry over to setting (2). In view of this, we help unify some of the results that have been presented in the literature. Secondly, if we have positive results for (2), then we have corresponding results for (1). One key conclusion of our results is that further developments on axiomatic and algorithmic aspects of hospital-doctor matching with regional quotas will result in corresponding results for school choice with diversity constraints.

* Conference version had some missing details 
Viaarxiv icon