no code implementations • 27 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.
no code implementations • 2 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.
no code implementations • 22 Feb 2020 • Haris Aziz, Barton E. Lee
A well-known axiom for proportional representation is Proportionality of Solid Coalitions (PSC).
no code implementations • 22 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.
no code implementations • 4 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.
no code implementations • 29 Jan 2018 • Barton E. Lee
Furthermore, we prove a limit on `how strategically robust' a PR-based voting rule can be; we show that there is no PR-based voting rule which ensures that every equilibrium satisfies PR.
no code implementations • 16 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.