用神经网络学习隐性分配规则,确保公平且贴近专家决策。
Learning Fair and Preferable Allocations through Neural Network
- 通过可微分松弛构建神经版轮换法(NRR),学习专家分配顺序
- 在真实案例上训练后,预测结果与专家分配更接近,满足EF1公平性
- 适合需要公平又贴近人类直觉的资源分配场景
不可分资源的公平分配是基础问题。现有研究提出了多种机制以满足不同公平性标准,如轮换法(RR)可实现“除一件物品外无嫉妒”(EF1)。现实中常依赖无数学公式的人类经验规则来获得用户偏好的结果。但这类启发式规则难以形式化,难以融入理论框架;而传统算法又难找到偏好结果,直接复制则可能引入偏见导致不公平。本文旨在从专家分配实例中学习隐性机制,同时严格满足公平约束,聚焦于通过监督学习从报告的估值和对应分配结果中学习EF1分配方法。为此,我们提出神经轮换法(NRR),一种参数化轮换法的神经网络,基于对轮换法的可微分松弛构建,可训练以学习轮换顺序。实验表明,该方法在预测分配与真实结果的接近度等指标上优于基线。
原文摘要 · Abstract (English)
The fair allocation of indivisible resources is a fundamental problem. Existing research has developed various allocation mechanisms or algorithms to satisfy different fairness notions. For example, round robin (RR) was proposed to meet the fairness criterion known as envy-freeness up to one good (EF1). Expert algorithms without mathematical formulations are used in real-world resource allocation problems to find preferable outcomes for users. Therefore, we aim to design mechanisms that strictly satisfy good properties with replicating expert knowledge. However, this problem is challenging because such heuristic rules are often difficult to formalize mathematically, complicating their integration into theoretical frameworks. Additionally, formal algorithms struggle to find preferable outcomes, and directly replicating these implicit rules can result in unfair allocations because human decision-making can introduce biases. In this paper, we aim to learn implicit allocation mechanisms from examples while strictly satisfying fairness constraints, specifically focusing on learning EF1 allocation mechanisms through supervised learning on examples of reported valuations and corresponding allocation outcomes produced by implicit rules. To address this, we developed a neural RR (NRR), a novel neural network that parameterizes RR. NRR is built from a differentiable relaxation of RR and can be trained to learn the agent ordering used for RR. We conducted experiments to learn EF1 allocation mechanisms from examples, demonstrating that our method outperforms baselines in terms of the proximity of predicted allocations and other metrics.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。