activity
20082026
most citedStable partitions in additively separable hedonic games

112 citations · 871 across the 84 of their papers we have counts for

collaborators
Showing 2014Show all

11 papers · 1 filter

cs.AI2014★ 33 cited

Possible and Necessary Allocations via Sequential Mechanisms

Haris Aziz, Toby Walsh, Lirong Xia

A simple mechanism for allocating indivisible resources is sequential allocation in which agents take turns to pick items. We focus on possible and necessary allocation problems, c…

cs.GT2014

Structure and complexity of ex post efficient random assignments

Haris Aziz, Simon Mackenzie, Lirong Xia +1

In the random assignment problem, objects are randomly assigned to agents keeping in view the agents' preferences over objects. A random assignment specifies the probability of an…

cs.GT2014

A Generalization of the AL method for Fair Allocation of Indivisible Objects

Haris Aziz

We consider the assignment problem in which agents express ordinal preferences over objects and the objects are allocated to the agents based on the preferences. In a recent pa…

cs.GT2014

A Study of Proxies for Shapley Allocations of Transport Costs

Haris Aziz, Casey Cahan, Charles Gretton +3

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. Such cost to serve analysis has a…

cs.GT2014

Computational Aspects of Multi-Winner Approval Voting

Haris Aziz, Serge Gaspers, Joachim Gudmundsson +3

We study computational aspects of three prominent voting rules that use approval ballots to elect multiple winners. These rules are satisfaction approval voting, proportional appro…

cs.MA2014★ 1 cited

Justified Representation in Approval-Based Committee Voting

Haris Aziz, Markus Brill, Vincent Conitzer +3

We consider approval-based committee voting, i.e. the setting where each voter approves a subset of candidates, and these votes are then used to select a fixed-size set of winners…