Skip to main content

Brandon Fain

Assistant Professor of the Practice of Computer Science
Computer Science

Selected Publications

Fairness in the Assignment Problem with Uncertain Priorities

Conference Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS · January 1, 2023 In the assignment problem, a set of items must be allocated to unit-demand agents who express ordinal preferences (rankings) over the items. In the assignment problem with priorities, agents with higher priority are entitled to their preferred goods with r ... Cite

Welfare and Fairness in Multi-objective Reinforcement Learning

Conference Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS · January 1, 2023 We study fair multi-objective reinforcement learning in which an agent must learn a policy that simultaneously achieves high reward on multiple dimensions of a vector-valued reward. Motivated by the fair resource allocation literature, we model this as an ... Cite

Auditing for Gerrymandering by Identifying Disenfranchised Individuals

Conference ACM International Conference Proceeding Series · June 21, 2022 Gerrymandering is the practice of drawing congressional districts to advantage or disadvantage particular electoral outcomes or population groups. We study the problem of computationally auditing a districting for evidence of gerrymandering. Our approach i ... Full text Cite

Multi-Analyst Differential Privacy for Online Query Answering

Journal Article Proceedings of the VLDB Endowment · January 1, 2022 Most differentially private mechanisms are designed for the use of a single analyst. In reality, however, there are often multiple stake-holders with different and possibly conflicting priorities that must share the same privacy loss budget. This motivates ... Full text Cite

Centrality with Diversity

Journal Article WSDM 2021 - Proceedings of the 14th ACM International Conference on Web Search and Data Mining · August 3, 2021 Graph centrality measures use the structure of a network to quantify central or "important"nodes, with applications in web search, social media analysis, and graphical data mining generally. Traditional centrality measures such as the well known PageRank i ... Full text Cite

Budget sharing for multi-analyst differential privacy

Conference Proceedings of the VLDB Endowment · January 1, 2021 Large organizations that collect data about populations (like the US Census Bureau) release summary statistics that are used by multiple stakeholders for resource allocation and policy making problems. These organizations are also legally required to prote ... Full text Cite

Concentration of distortion: The value of extra voters in randomized social choice

Journal Article IJCAI International Joint Conference on Artificial Intelligence · January 1, 2020 We study higher statistical moments of Distortion for randomized social choice in a metric implicit utilitarian model. The Distortion of a social choice mechanism is the expected approximation factor with respect to the optimal utilitarian social cost (OPT ... Cite

Random dictators with a random referee: Constant sample complexity mechanisms for social choice

Conference 33rd AAAI Conference on Artificial Intelligence, AAAI 2019, 31st Innovative Applications of Artificial Intelligence Conference, IAAI 2019 and the 9th AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019 · January 1, 2019 We study social choice mechanisms in an implicit utilitarian framework with a metric constraint, where the goal is to minimize Distortion, the worst case social cost of an ordinal mechanism relative to underlying cardinal utilities. We consider two additio ... Cite

Proportionally fair clustering

Journal Article 36th International Conference on Machine Learning, ICML 2019 · January 1, 2019 We extend the fair machine learning literature by considering the problem of proportional centroid clustering in a metric context. For clustering n points with k centers, we define fairness as proportionality to mean that any n/k points are entitled to for ... Cite

Fair allocation of indivisible public goods

Conference ACM EC 2018 - Proceedings of the 2018 ACM Conference on Economics and Computation · June 11, 2018 We consider the problem of fairly allocating indivisible public goods. We model the public goods as elements with feasibility constraints on what subsets of elements can be chosen, and assume that agents have additive utilities across elements. Our model g ... Full text Cite

ROBUS: Fair cache allocation for data-parallel workloads

Conference Proceedings of the ACM SIGMOD International Conference on Management of Data · May 9, 2017 Systems for processing big data-e.g., Hadoop, Spark, and massively parallel databases-need to run workloads on behalf of multiple tenants simultaneously. The abundant disk-based storage in these systems is usually complemented by a smaller, but much faster ... Full text Cite

Sequential deliberation for social choice

Conference Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) · January 1, 2017 Social choice is a normative study of designing protocols for collective decision making. However, in instances where the underlying decision space is too large or complex for ordinal voting, standard voting methods may be impractical. How then can we desi ... Full text Cite

The core of the participatory budgeting problem

Conference Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) · January 1, 2016 In participatory budgeting, communities collectively decide on the allocation of public tax dollars for local public projects. In this work, we consider the question of fairly aggregating preferences to determine an allocation of funds to projects. We argu ... Full text Cite