分类聚合:一个量化不可能定理
Classification aggregation: a quantitative impossibility theorem
AI总结:
本文研究了在概率1-ε下保证分类结果满射的聚合机制,证明了即使聚合函数远离常数,仍存在不可能性定理,并扩展到等价关系聚合的情况。
摘要:
一组个体希望将m个对象分类为n个类别,使得每个类别都不为空(称为满射)。个体的意见通过依赖于对象的聚合函数分别聚合。Maniquet和Mongin证明,如果聚合函数是多数同意且结果必须始终满射,则聚合机制是独裁的。Cailloux等人证明,即使将多数同意放松为公民主权(每个对象可以分配到任何类别),同样成立。本文证明,即使仅要求结果在概率1-ε下满射(相对于任意对称i.i.d.分布),只要聚合函数远离常数,相似结果仍成立。在过程中,我们characterized所有无需对聚合函数做任何假设的聚合机制,其结果始终满射。我们的方法使用了Alekseev和Filmus的一般结果,具有更广泛的应用性。我们通过证明一个类似的不可能性结果来展示这一点,该结果适用于聚合等价关系。
英文摘要:
A group of individuals wishes to classify $m$ objects into $n$ categories in such a way that no class is left empty, a condition known as surjectivity. The opinions of the individuals are aggregated separately for each object using an aggregation function that can depend on the object. Maniquet and Mongin showed that if the aggregation functions are unanimous and the outcome must always be surjective, then the aggregation mechanism is dictatorial. Cailloux et al. showed that the same holds even if unanimity is relaxed to citizen sovereignty (each object can be classified into any category). We show that similar results hold even if we only require the outcome to be surjective with probability $1-ε$ (with respect to an arbitrary symmetric i.i.d. distribution), provided that the aggregation functions are far from being constant. On the way, we characterize all aggregation mechanisms whose outcome is always surjective without any assumptions on the aggregation functions. Our approach uses a general result of Alekseev and Filmus which has wider applicability. We illustrate this by proving a similar impossibility result for aggregating equivalence relations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。