The $k$-winners-take-all ($k$WTA) problem is to find the $k$ largest inputs from $N$ inputs. In this paper, we design and propose a novel distributed $k$WTA model, for which no central unit is needed to realize the computation of the $k$ winners. As a result, the proposed model has the general advantages of distributed models over centralized ones, such as better robustness to faults of agents. The global asymptotic convergence of the proposed distributed model is proven. Besides, two numerical examples on networks of agents with static inputs and time-varying inputs are presented to validate the performance of the proposed model.

中文翻译：

---

分布式分析与设计 $ķ$-赢家通吃的模型

的 $ķ$-获胜者通吃（$ķ$WTA）的问题是找到 $ķ$ 来自最大的投入 $ñ$输入。在本文中，我们设计并提出了一种新颖的分布式$ķ$WTA模型，不需要中央单元即可实现 $ķ$赢家。结果，与集中式模型相比，所提出的模型具有分布式模型的一般优势，例如对代理程序故障具有更好的鲁棒性。证明了所提出的分布式模型的全局渐近收敛性。此外，还给出了两个具有静态输入和时变输入的智能体网络的数值示例，以验证所提出模型的性能。