公平积分网络流
Fair Integral Network Flows
摘要：
一种强多项式算法，用于找到给定流量的整数值可行$st$流，该给定流量在边的指定子集$F$上是递减最小的，在这个意义上，$F$上的最大流量值尽可能小，在这个意义上，$F$上的第二大流量值尽可能小，在这个意义上，$F$上的第三大流量值尽可能小，这些$st$流的集合的特征给出了一种算法，用于计算给定流量的最便宜的$F$ -递减最小整数值可行$st$流。递减最小性是一种可能的形式化方法来捕捉公平的直观概念。
英文摘要：
A strongly polynomial algorithm is developed for finding an integer-valued feasible $st$-flow of given flow-amount which is decreasingly minimal on a specified subset $F$ of edges in the sense that the largest flow-value on $F$ is as small as possible, within this, the second largest flow-value on $F$ is as small as possible, within this, the third largest flow-value on $F$ is as small as possible, and so on. A characterization of the set of these $st$-flows gives rise to an algorithm to compute a cheapest $F$-decreasingly minimal integer-valued feasible $st$-flow of given flow-amount. Decreasing minimality is a possible formal way to capture the intuitive notion of fairness.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
