Haris Aziz

is this you? claim profile

Haris Aziz is a senior research scientist at Data61, CSIRO; a conjoint senior lecturer at UNSW; and a fellow of the AGORA Center for Market Design.

Approximate and Strategyproof Maximin Share Allocation of Chores with Ordinal Preferences

We initiate the work on maximin share (MMS) fair allocation of m indivis...
12/27/2020 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

read it
Computing Fair Utilitarian Allocations of Indivisible Goods

We study the computational complexity of computing allocations that are ...
12/07/2020 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

read it
The Hylland-Zeckhauser Rule Under Bi-Valued Utilities

The Hylland-Zeckhauser (HZ) rule is a well-known rule for probabilistic ...
06/28/2020 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

read it
Simultaneously Achieving Ex-ante and Ex-post Fairness

We present a polynomial-time algorithm that computes an ex-ante envy-fre...
04/06/2020 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

read it
Achieving Envy-freeness and Equitability with Monetary Transfers

When allocating indivisible resources or tasks, an envy-free allocation ...
03/18/2020 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

read it
Participatory Budgeting: Models and Approaches

Participatory budgeting is a democratic approach to deciding the funding...
03/01/2020 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

read it
A Probabilistic Approach to Voting, Allocation, Matching, and Coalition Formation

Randomisation and time-sharing are some of the oldest methods to achieve...
02/24/2020 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

read it
A characterization of proportionally representative committees

A well-known axiom for proportional representation is Proportionality of...
02/22/2020 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

read it
From Matching with Diversity Constraints to Matching with Regional Quotas

In the past few years, several new matching models have been proposed an...
02/17/2020 ∙ by Haris Aziz, et al. ∙ 2 ∙ share

read it
Developments in Multi-Agent Fair Allocation

Fairness is becoming an increasingly important concern when designing ma...
11/22/2019 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

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

We consider the facility location problem in the one-dimensional setting...
11/22/2019 ∙ by Haris Aziz, et al. ∙ 9 ∙ share

read it
Proportionally Representative Participatory Budgeting with Ordinal Preferences

Participatory budgeting (PB) is a democratic paradigm whereby voters dec...
11/03/2019 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

read it
A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation

We consider fair allocation of indivisible items under additive utilitie...
09/02/2019 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

read it
The Constrained Round Robin Algorithm for Fair and Efficient Allocation

We consider a multi-agent resource allocation setting that models the as...
08/01/2019 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

read it
Almost Group Envy-free Allocation of Indivisible Goods and Chores

We consider a multi-agent resource allocation setting in which an agent'...
07/16/2019 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

read it
Weighted Maxmin Fair Share Allocation of Indivisible Chores

We initiate the study of indivisible chore allocation for agents with as...
06/18/2019 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

read it
Strategyproof Multi-Item Exchange Under Single-Minded Dichotomous Preferences

We consider multi-item exchange markets in which agents want to receive ...
05/26/2019 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

read it
Justifications of Welfare Guarantees under Normalized Utilities

It is standard in computational social choice to analyse welfare conside...
05/26/2019 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

read it
Strategyproof and Approximately Maxmin Fair Share Allocation of Chores

We initiate the work on fair and strategyproof allocation of indivisible...
05/22/2019 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

read it
Fair allocation of combinations of indivisible goods and chores

We consider the problem of fairly dividing a set of items. Much of the f...
07/27/2018 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

read it
The Temporary Exchange Problem

We formalize an allocation model under ordinal preferences that is more ...
07/15/2018 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

read it
Mechanism Design without Money for Common Goods

We initiate the study of mechanism design without money for common goods...
06/04/2018 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

read it
A Rule for Committee Selection with Soft Diversity Constraints

Committee selection with diversity or distributional constraints is a ub...
03/30/2018 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

read it
Computing and Testing Pareto Optimal Committees

Selecting a set of alternatives based on the preferences of agents is an...
03/18/2018 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

read it
Proportional Representation in Approval-based Committee Voting and Beyond

Proportional representation (PR) is one of the central principles in vot...
02/03/2018 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

read it
Fair mixing: the case of dichotomous preferences

Agents vote to choose a fair mixture of public outcomes; each agent like...
12/07/2017 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

read it
Proportionally Representative Participatory Budgeting: Axioms and Algorithms

Participatory budgeting is one of the exciting developments in deliberat...
11/22/2017 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

read it
Sub-committee Approval Voting and Generalised Justified Representation Axioms

Social choice is replete with various settings including single-winner v...
11/16/2017 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

read it
Achieving Proportional Representation via Voting

Proportional representation (PR) is often discussed in voting settings a...
08/25/2017 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

read it
Computational Complexity of Testing Proportional Justified Representation

We consider a committee voting setting in which each voter approves of a...
12/20/2016 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

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

We consider the well-studied cake cutting problem in which the goal is t...
04/13/2016 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

read it
Strategyproof Peer Selection using Randomization, Partitioning, and Apportionment

Peer review, evaluation, and selection is a fundamental aspect of modern...
04/13/2016 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

read it
Welfare of Sequential Allocation Mechanisms for Indivisible Goods

Sequential allocation is a simple and attractive mechanism for the alloc...
11/26/2015 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

read it
Boolean Hedonic Games

We study hedonic games with dichotomous preferences. Hedonic games are c...
09/23/2015 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

read it
Online Fair Division: analysing a Food Bank problem

We study an online model of fair division designed to capture features o...
02/26/2015 ∙ by Martin Aleksandrov, et al. ∙ 0 ∙ share

read it
Possible and Necessary Allocations via Sequential Mechanisms

A simple mechanism for allocating indivisible resources is sequential al...
12/06/2014 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

read it
A Study of Proxies for Shapley Allocations of Transport Costs

We propose and evaluate a number of solutions to the problem of calculat...
08/21/2014 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

read it
Justified Representation in Approval-Based Committee Voting

We consider approval-based committee voting, i.e. the setting where each...
07/31/2014 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

read it
Computational Aspects of Multi-Winner Approval Voting

We study computational aspects of three prominent voting rules that use ...
07/11/2014 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

read it
Fair assignment of indivisible objects under ordinal preferences

We consider the discrete assignment problem in which agents express ordi...
12/23/2013 ∙ by Haris Aziz, et al. ∙ 0 ∙ share

read it

Haris Aziz

Featured Co-authors