In this paper, we consider a perfect coordinated water-filling game, where each user transmits solely on a given carrier. The main goal of the proposed algorithm (which we call FEAT) is to get close to the optimal, while keeping a decent level of fairness. The key idea within FEAT is to minimize the ratio between the best and the worst utilities of the users. This is done by ensuring that, at each iteration (channel assignment), a user is satisfied with this assignment as long as he does not loose much more than other users in the system. It has been shown that FEAT outperforms most related algorithms in many aspects, especially in interference-limited systems. Indeed, with FEAT we can ensure a near-optimal, fair and energy efficient solution with low computational complexity. In terms of robustness, it turns out that the balance between being nearly globally optimal and good from individual point of view seems hard to sustain with a significant number of users. Also notice that, in this regard, global optimality gets less affected than the individual one, which offers hope that such an accurate water-filling algorithm can be designed around competition in interference-limited systems.

翻译：在本文中,我们考虑一个完全协调的填水游戏,即每个用户只向特定承运人传输。拟议的算法(我们称之为FEAT)的主要目标是接近最佳,同时保持适当的公平水平。FEAT的关键想法是最大限度地减少用户最佳和最差公用事业之间的比例。这是通过确保用户在每次循环(频道分配)中对这一任务感到满意,只要他没有比系统中其他用户多得多的松散。已经表明,FEAT在许多方面都比最相关的算法(我们称之为FEAT)好,特别是在受干扰的系统中。事实上,在FEAT的情况下,我们可以确保接近最佳、公平和节能的解决方案,而计算复杂性低。从稳健的角度看,从个人的角度看,几乎全球最佳和好之间的平衡似乎很难与大量用户维持。此外,在这方面,全球最佳性的影响比单个用户要小,这使人们希望这种精确的补水算法能够围绕有限的竞争系统设计。