一句话：提出公平分配领域专用语言 Slice，将协议编译为逻辑约束并调用求解器自动验证无嫉妒性。
公平分配研究关注如何在多个代理间分配资源，使分配满足无嫉妒性；但标准场景下的协议极其复杂，其无嫉妒性证明常包含繁琐的分类讨论。本文提出 Slice，一种面向公平分配的领域特定语言。Slice 程序可被转换为编码无嫉妒性及其他目标属性的逻辑公式，并交给自动求解器判定。作者证明其约束生成过程既可靠又完备，并给出 Slice 的原型实现，用其自动检查了公平分配文献中的若干协议。结果说明，通过 DSL 与求解器结合，可望减轻协议设计与性质验证的负担。
The fair division literature in economics considers how to divide resources between multiple agents such that the allocation is envy-free: each agent receives their favorite piece. Researchers have developed a variety of fair division protocols for the most standard setting, where the agents want to split a single item, however, the protocols are highly intricate and the proofs of envy-freeness involve tedious case analysis. We propose Slice, a domain specific language for fair-division. Programs in our language can be converted to logical formulas encoding envy-freeness and other target properties. Then, the constraints can be dispatched to automated solvers. We prove that our constraint generation procedure is sound and complete. We also report on a prototype implementation of Slice, which we have used to automatically check envy-freeness for several protocols from the fair division literature.
@article{paperbot1972,
title = {Cutting the Cake: A Language for Fair Division},
author = {Noah Bertram and Alex Levinson and Justin Hsu},
journal = {Proceedings of the ACM on Programming Languages},
volume = {7},
number = {PLDI},
year = {2023},
doi = {10.1145/3591293}
}