同质可分商品在三个参与者间公平分配的帕累托最优刻画与求解
Characterizing and Finding the Pareto Optimal Equitable Allocation of Homogeneous Divisible Goods Among Three Players
摘要：
我们考虑有限个齐次可分项目在三个玩家之间的划分。假设每个玩家分配一个正值的每一个项目，我们的最优分配的特点，我们开发了两个精确的算法搜索。刻画和算法都是基于两个几何对象之间的紧密关系：个体块集（IPS）和Radon-Nykodim集（RNS）。
英文摘要：
We consider the division of a finite number of homogeneous divisible items among three players. Under the assumption that each player assigns a positive value to every item, we characterize the optimal allocations and we develop two exact algorithms for its search. Both the characterization and the algorithm are based on the tight relationship two geometric objects of fair division: the Individual Pieces Set (IPS) and the Radon-Nykodim Set (RNS).
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
