The permute-and-flip mechanism is a recently proposed differentially private selection algorithm that was shown to outperform the exponential mechanism. In this paper, we show that permute-and-flip is equivalent to the well-known report noisy max algorithm with exponential noise. This equivalence is used to simplify the utility and privacy analysis, and extend it to bounded range and concentrated differential privacy.

翻译：permute- and-flip 机制是最近提出的一种有差别的私人选择算法, 其效果超过了指数机制。 在本文中, 我们显示, permute- and- flip 等同于有指数噪声的著名报告“ 吵闹最大算法 ” 。 这一等值用于简化实用性和隐私分析, 并扩大到封闭范围以及集中式的隐私。