The optimal offloading of tasks in heterogeneous edge-computing scenarios is of great practical interest, both in the selfish and fully cooperative setting. In practice, such systems are typically very large, rendering exact solutions in terms of cooperative optima or Nash equilibria intractable. For this purpose, we adopt a general mean-field formulation in order to solve the competitive and cooperative offloading problems in the limit of infinitely large systems. We give theoretical guarantees for the approximation properties of the limiting solution and solve the resulting mean-field problems numerically. Furthermore, we verify our solutions numerically and find that our approximations are accurate for systems with dozens of edge devices. As a result, we obtain a tractable approach to the design of offloading strategies in large edge-computing scenarios with many users.

翻译：在多种不同边际计算假设中,最佳卸载任务在自私和完全合作的环境中都具有极大的实际意义。实际上,这种系统通常规模很大,在合作的optima或Nash equilibria这种棘手的方面提供了精确的解决办法。为此目的,我们采用一般的中位法,以解决在无限大系统范围内的竞争和合作卸载问题。我们从理论上保证限制性解决方案的近似特性,并用数字来解决由此产生的中位领域问题。此外,我们用数字来核查我们的解决方案,发现我们的近似对有几十个边缘装置的系统来说是准确的。因此,我们获得了与许多用户一道在大型边端计算情况下设计卸载战略的简单方法。