Fairness and privacy are two important concerns in social decision-making processes such as resource allocation. We study privacy in the fair allocation of indivisible resources using the well-established framework of differential privacy. We present algorithms for approximate envy-freeness and proportionality when two instances are considered to be adjacent if they differ only on the utility of a single agent for a single item. On the other hand, we provide strong negative results for both fairness criteria when the adjacency notion allows the entire utility function of a single agent to change.

翻译：公平和隐私是资源分配等社会决策进程的两个重要问题。我们利用既定的区别隐私框架,研究在公平分配不可分割资源方面的隐私。我们提出一种算法,在两种情况被认为相邻时,如果仅就单一代理人对单一物品的效用有不同之处,则采用近似无嫉妒和相称性的算法。另一方面,当对等概念允许单一代理人的整个功用功能发生变化时,我们为两种公平标准都提供了强烈的负面结果。