Tackling climate change with machine learning
Climate change is one of the greatest challenges facing humanity, and we, as machine
learning (ML) experts, may wonder how we can help. Here we describe how ML can be a …
learning (ML) experts, may wonder how we can help. Here we describe how ML can be a …
Fair division in the internet age
H Moulin - Annual Review of Economics, 2019 - annualreviews.org
Fair division, a key concern in the design of many social institutions, has for 70 years been
the subject of interdisciplinary research at the interface of mathematics, economics, and …
the subject of interdisciplinary research at the interface of mathematics, economics, and …
Fair enough: Guaranteeing approximate maximin shares
D Kurokawa, AD Procaccia, J Wang - Journal of the ACM (JACM), 2018 - dl.acm.org
We consider the problem of fairly allocating indivisible goods, focusing on a recently
introduced notion of fairness called maximin share guarantee: each player's value for his …
introduced notion of fairness called maximin share guarantee: each player's value for his …
A discrete and bounded envy-free cake cutting protocol for any number of agents
H Aziz, S Mackenzie - 2016 IEEE 57th Annual Symposium on …, 2016 - ieeexplore.ieee.org
We consider the well-studied cake cutting problem in which the goal is to find an envy-free
allocation based on queries from n agents. The problem has received attention in computer …
allocation based on queries from n agents. The problem has received attention in computer …
Characterizing conflicts in fair division of indivisible goods using a scale of criteria
S Bouveret, M Lemaître - Autonomous Agents and Multi-Agent Systems, 2016 - Springer
We investigate five different fairness criteria in a simple model of fair resource allocation of
indivisible goods based on additive preferences. We show how these criteria are connected …
indivisible goods based on additive preferences. We show how these criteria are connected …
Spliddit: Unleashing fair division algorithms
J Goldman, AD Procaccia - ACM SIGecom Exchanges, 2015 - dl.acm.org
Spliddit: Unleashing Fair Division Algorithms Page 1 Spliddit: Unleashing Fair Division
Algorithms JONATHAN GOLDMAN and ARIEL D. PROCACCIA Carnegie Mellon University …
Algorithms JONATHAN GOLDMAN and ARIEL D. PROCACCIA Carnegie Mellon University …
User fairness, item fairness, and diversity for rankings in two-sided markets
L Wang, T Joachims - Proceedings of the 2021 ACM SIGIR international …, 2021 - dl.acm.org
Ranking items by their probability of relevance has long been the goal of conventional
ranking systems. While this maximizes traditional criteria of ranking performance, there is a …
ranking systems. While this maximizes traditional criteria of ranking performance, there is a …
Fair allocation of indivisible public goods
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 …
goods as elements with feasibility constraints on what subsets of elements can be chosen …
Fair enough: Guaranteeing approximate maximin shares
AD Procaccia, J Wang - Proceedings of the fifteenth ACM conference on …, 2014 - dl.acm.org
We consider the problem of fairly allocating indivisible goods, focusing on a recently-
introduced notion of fairness called maximin share guarantee: Each player's value for his …
introduced notion of fairness called maximin share guarantee: Each player's value for his …
Multi-resource fair allocation in heterogeneous cloud computing systems
We study the multi-resource allocation problem in cloud computing systems where the
resource pool is constructed from a large number of heterogeneous servers, representing …
resource pool is constructed from a large number of heterogeneous servers, representing …