
Individually Rational Land and Neighbor Allocation: Impossibility Results
We consider a setting in which agents are allocated land plots and they ...
read it

MultiRobot Task Allocation – Complexity and Approximation
Multirobot task allocation is one of the most fundamental classes of pr...
read it

Optimal Kidney Exchange with Immunosuppressants
Algorithms for exchange of kidneys is one of the key successful applicat...
read it

Efficient, Fair, and IncentiveCompatible Healthcare Rationing
As the COVID19 pandemic shows no clear signs of subsiding, fair and eff...
read it

Cutoff stability under distributional constraints with an application to summer internship matching
We introduce a new twosided stable matching problem that describes the ...
read it

Participatory Funding Coordination: Model, Axioms and Rules
We present a new model of collective decision making that captures impor...
read it

Approximate and Strategyproof Maximin Share Allocation of Chores with Ordinal Preferences
We initiate the work on maximin share (MMS) fair allocation of m indivis...
read it

Computing Fair Utilitarian Allocations of Indivisible Goods
We study the computational complexity of computing allocations that are ...
read it

The HyllandZeckhauser Rule Under BiValued Utilities
The HyllandZeckhauser (HZ) rule is a wellknown rule for probabilistic ...
read it

Simultaneously Achieving Exante and Expost Fairness
We present a polynomialtime algorithm that computes an exante envyfre...
read it

Achieving Envyfreeness and Equitability with Monetary Transfers
When allocating indivisible resources or tasks, an envyfree allocation ...
read it

Participatory Budgeting: Models and Approaches
Participatory budgeting is a democratic approach to deciding the funding...
read it

A Probabilistic Approach to Voting, Allocation, Matching, and Coalition Formation
Randomisation and timesharing are some of the oldest methods to achieve...
read it

A characterization of proportionally representative committees
A wellknown axiom for proportional representation is Proportionality of...
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...
read it

Developments in MultiAgent Fair Allocation
Fairness is becoming an increasingly important concern when designing ma...
read it

Facility Location Problem with Capacity Constraints: Algorithmic and Mechanism Design Perspectives
We consider the facility location problem in the onedimensional setting...
read it

Proportionally Representative Participatory Budgeting with Ordinal Preferences
Participatory budgeting (PB) is a democratic paradigm whereby voters dec...
read it

A polynomialtime algorithm for computing a Pareto optimal and almost proportional allocation
We consider fair allocation of indivisible items under additive utilitie...
read it

The Constrained Round Robin Algorithm for Fair and Efficient Allocation
We consider a multiagent resource allocation setting that models the as...
read it

Almost Group Envyfree Allocation of Indivisible Goods and Chores
We consider a multiagent resource allocation setting in which an agent'...
read it

Weighted Maxmin Fair Share Allocation of Indivisible Chores
We initiate the study of indivisible chore allocation for agents with as...
read it

Strategyproof MultiItem Exchange Under SingleMinded Dichotomous Preferences
We consider multiitem exchange markets in which agents want to receive ...
read it

Justifications of Welfare Guarantees under Normalized Utilities
It is standard in computational social choice to analyse welfare conside...
read it

Strategyproof and Approximately Maxmin Fair Share Allocation of Chores
We initiate the work on fair and strategyproof allocation of indivisible...
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...
read it

The Temporary Exchange Problem
We formalize an allocation model under ordinal preferences that is more ...
read it

Mechanism Design without Money for Common Goods
We initiate the study of mechanism design without money for common goods...
read it

A Rule for Committee Selection with Soft Diversity Constraints
Committee selection with diversity or distributional constraints is a ub...
read it

Computing and Testing Pareto Optimal Committees
Selecting a set of alternatives based on the preferences of agents is an...
read it

Proportional Representation in Approvalbased Committee Voting and Beyond
Proportional representation (PR) is one of the central principles in vot...
read it

Fair mixing: the case of dichotomous preferences
Agents vote to choose a fair mixture of public outcomes; each agent like...
read it

Proportionally Representative Participatory Budgeting: Axioms and Algorithms
Participatory budgeting is one of the exciting developments in deliberat...
read it

Subcommittee Approval Voting and Generalised Justified Representation Axioms
Social choice is replete with various settings including singlewinner v...
read it

Achieving Proportional Representation via Voting
Proportional representation (PR) is often discussed in voting settings a...
read it

Computational Complexity of Testing Proportional Justified Representation
We consider a committee voting setting in which each voter approves of a...
read it

A Discrete and Bounded EnvyFree Cake Cutting Protocol for Any Number of Agents
We consider the wellstudied cake cutting problem in which the goal is t...
read it

Strategyproof Peer Selection using Randomization, Partitioning, and Apportionment
Peer review, evaluation, and selection is a fundamental aspect of modern...
read it

Welfare of Sequential Allocation Mechanisms for Indivisible Goods
Sequential allocation is a simple and attractive mechanism for the alloc...
read it

Boolean Hedonic Games
We study hedonic games with dichotomous preferences. Hedonic games are c...
read it

Online Fair Division: analysing a Food Bank problem
We study an online model of fair division designed to capture features o...
read it

Possible and Necessary Allocations via Sequential Mechanisms
A simple mechanism for allocating indivisible resources is sequential al...
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...
read it

Justified Representation in ApprovalBased Committee Voting
We consider approvalbased committee voting, i.e. the setting where each...
read it

Computational Aspects of MultiWinner Approval Voting
We study computational aspects of three prominent voting rules that use ...
read it

Fair assignment of indivisible objects under ordinal preferences
We consider the discrete assignment problem in which agents express ordi...
read it
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.