66 citations · 206 across the 36 of their papers we have counts for
10 papers · 1 filter
From Matching with Diversity Constraints to Matching with Regional Quotas
Haris Aziz, Serge Gaspers, Zhaohong Sun +1
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) scho…
Stable Matching with Uncertain Linear Preferences
Haris Aziz, Péter Biró, Serge Gaspers +3
We consider the two-sided stable matching setting in which there may be uncertainty about the agents' preferences due to limited information or communication. We consider three mod…
Interdependent Scheduling Games
Andres Abeliuk, Haris Aziz, Gerardo Berbeglia +7
We propose a model of interdependent scheduling games in which each player controls a set of services that they schedule independently. A player is free to schedule his own service…
Equilibria Under the Probabilistic Serial Rule
Haris Aziz, Serge Gaspers, Simon Mackenzie +3
The probabilistic serial (PS) rule is a prominent randomized rule for assigning indivisible goods to agents. Although it is well known for its good fairness and welfare properties,…
Online Fair Division: analysing a Food Bank problem
Martin Aleksandrov, Haris Aziz, Serge Gaspers +1
We study an online model of fair division designed to capture features of a real world charity problem. We consider two simple mechanisms for this model in which agents simply decl…
Manipulating the Probabilistic Serial Rule
Haris Aziz, Serge Gaspers, Simon Mackenzie +3
The probabilistic serial (PS) rule is one of the most prominent randomized rules for the assignment problem. It is well-known for its superior fairness and welfare properties. Howe…
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…
Strategic aspects of the probabilistic serial rule for the allocation of goods
Haris Aziz, Serge Gaspers, Nick Mattei +2
The probabilistic serial (PS) rule is one of the most prominent randomized rules for the assignment problem. It is well-known for its superior fairness and welfare properties. Howe…
Fair assignment of indivisible objects under ordinal preferences
Haris Aziz, Serge Gaspers, Simon Mackenzie +1
We consider the discrete assignment problem in which agents express ordinal preferences over objects and these objects are allocated to the agents in a fair manner. We use the stoc…
Possible and Necessary Winner Problem in Social Polls
Serge Gaspers, Victor Naroditskiy, Nina Narodytska +1
Social networks are increasingly being used to conduct polls. We introduce a simple model of such social polling. We suppose agents vote sequentially, but the order in which agents…