Search Results for author: Haris Aziz

Found 32 papers, 4 papers with code

REVEAL-IT: REinforcement learning with Visibility of Evolving Agent poLicy for InTerpretability

1 code implementation20 Jun 2024 Shuang Ao, Simon Khan, Haris Aziz, Flora D. Salim

Understanding the agent's learning process in complicated environments or tasks is more challenging.

Decision Making

Nash Welfare and Facility Location

no code implementations6 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.


Proportionally Representative Clustering

no code implementations27 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.

Clustering Fairness

Proportional Fairness in Obnoxious Facility Location

no code implementations11 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.


Task Allocation using a Team of Robots

no code implementations20 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.

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

no code implementations30 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.


Obvious Manipulability of Voting Rules

no code implementations3 Nov 2021 Haris Aziz, Alexander Lam

In contrast to the Gibbard-Satterthwaite theorem, many of the rules we examined are not obviously manipulable.

Strategyproof and Proportionally Fair Facility Location

no code implementations2 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.


Multi-Robot Task Allocation -- Complexity and Approximation

no code implementations23 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.

Efficient, Fair, and Incentive-Compatible Healthcare Rationing

no code implementations8 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

The Vigilant Eating Rule: A General Approach for Probabilistic Economic Design with Constraints

no code implementations20 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.

A characterization of proportionally representative committees

no code implementations22 Feb 2020 Haris Aziz, Barton E. Lee

A well-known axiom for proportional representation is Proportionality of Solid Coalitions (PSC).

From Matching with Diversity Constraints to Matching with Regional Quotas

no code implementations17 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.


Facility Location Problem with Capacity Constraints: Algorithmic and Mechanism Design Perspectives

no code implementations22 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.

The Capacity Constrained Facility Location problem

no code implementations4 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.

A Rule for Committee Selection with Soft Diversity Constraints

no code implementations30 Mar 2018 Haris Aziz

Committee selection with diversity or distributional constraints is a ubiquitous problem.


Computing and Testing Pareto Optimal Committees

no code implementations18 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.

Sub-committee Approval Voting and Generalised Justified Representation Axioms

no code implementations16 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.

Decision Making

The Expanding Approvals Rule: Improving Proportional Representation and Monotonicity

no code implementations25 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.

Fair Allocation based on Diminishing Differences

1 code implementation22 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

Computational Complexity of Testing Proportional Justified Representation

no code implementations20 Dec 2016 Haris Aziz, Shenwei Huang

(2016) proposed an intermediate property called proportional justified representation that admits a polynomial-time algorithm to achieve.

Interdependent Scheduling Games

no code implementations31 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.


A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents

1 code implementation13 Apr 2016 Haris Aziz, Simon Mackenzie

We resolve the problem by proposing a discrete and bounded envy-free protocol for any number of agents.

Welfare of Sequential Allocation Mechanisms for Indivisible Goods

no code implementations26 Nov 2015 Haris Aziz, Thomas Kalinowski, Toby Walsh, Lirong Xia

Sequential allocation is a simple and attractive mechanism for the allocation of indivisible goods.

Boolean Hedonic Games

no code implementations23 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.


Online Fair Division: analysing a Food Bank problem

no code implementations26 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.

Possible and Necessary Allocations via Sequential Mechanisms

no code implementations6 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.

A Study of Proxies for Shapley Allocations of Transport Costs

no code implementations21 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.

Computational Aspects of Multi-Winner Approval Voting

no code implementations11 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.

Fair assignment of indivisible objects under ordinal preferences

no code implementations23 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.

Fairness Open-Ended Question Answering

Cannot find the paper you are looking for? You can Submit a new open access paper.