Search Results for author:
Found 6 papers, 0 papers with code
Gerrymandering Planar Graphs
This motivates the study of approximation algorithms for gerrymandering planar graphs.
Penalties and Rewards for Fair Learning in Paired Kidney Exchange Programs
Rather, the key factor in increasing the number of transplants, decreasing waiting times and improving group fairness is the judicious assignment of a negative weight (penalty) to the small number of non-directed donors in the kidney exchange program.
A General Framework for a Class of Quarrels: The Quarrelling Paradox Revisited
If a measure of voting power assigns greater voting power to a player because it no longer effectively cooperates with another, then the measure displays the quarrelling paradox and violates the quarrel postulate.
The Blocker Postulates for Measures of Voting Power
A proposed measure of voting power should satisfy two conditions to be plausible: first, it must be conceptually justified, capturing the intuitive meaning of what voting power is; second, it must satisfy reasonable postulates.
Fair Algorithm Design: Fair and Efficacious Machine Scheduling
In this paper, we prove that this dichotomy between fairness and efficacy can be overcome if we allow for a negligible amount of bias: there exist algorithms that are both "almost perfectly fair" and have a constant factor efficacy ratio, that is, are guaranteed to output solutions that have social welfare within a constant factor of optimal welfare.
A Recursive Measure of Voting Power that Satisfies Reasonable Postulates
We design a recursive measure of voting power based on partial as well as full voting efficacy.
