Almost envy-freeness with general valuations
The goal of fair division is to distribute resources among competing players in a “fair" way.
Envy-freeness is the most extensively studied fairness notion in fair division. Envy-free …
Envy-freeness is the most extensively studied fairness notion in fair division. Envy-free …
Algorithmic mediation in group decisions: Fairness perceptions of algorithmically mediated vs. discussion-based social division
MK Lee, S Baykal - Proceedings of the 2017 acm conference on …, 2017 - dl.acm.org
How do individuals perceive algorithmic vs. group-made decisions? We investigated
people's perceptions of mathematically-proven fair division algorithms making social …
people's perceptions of mathematically-proven fair division algorithms making social …
[HTML][HTML] Manipulation and peer mechanisms: A survey
In peer mechanisms, the competitors for a prize also determine who wins. Each competitor
may be asked to rank, grade, or nominate peers for the prize. Since the prize can be …
may be asked to rank, grade, or nominate peers for the prize. Since the prize can be …
Collective credit allocation in science
HW Shen, AL Barabási - Proceedings of the National …, 2014 - National Acad Sciences
Collaboration among researchers is an essential component of the modern scientific
enterprise, playing a particularly important role in multidisciplinary research. However, we …
enterprise, playing a particularly important role in multidisciplinary research. However, we …
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 …
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 …
Apreflib. org retrospective: Lessons learned and new directions
The Internet enables computers and (by proxy) humans to communicate at distances and
speeds previously unimaginable. Many of the benefits from this technology are derived from …
speeds previously unimaginable. Many of the benefits from this technology are derived from …
Strategyproof linear regression in high dimensions
This paper is part of an emerging line of work at the intersection of machine learning and
mechanism design, which aims to avoid noise in training data by correctly aligning the …
mechanism design, which aims to avoid noise in training data by correctly aligning the …
Impartial nominations for a prize
R Holzman, H Moulin - Econometrica, 2013 - Wiley Online Library
A group of peers must choose one of them to receive a prize; everyone cares only about
winning, not about who gets the prize if someone else. An award rule is impartial if one's …
winning, not about who gets the prize if someone else. An award rule is impartial if one's …
The price of connectivity in fair division
We study the allocation of indivisible goods that form an undirected graph and quantify the
loss of fairness when we impose a constraint that each agent must receive a connected …
loss of fairness when we impose a constraint that each agent must receive a connected …