Classification Aggregation without Unanimity

Olivier Cailloux, Matthieu Hervouin, Ali I. Ozkes, M. Remzi Sanver
10/18/2023
cs.AIcs.MA

No confident code implementation found for this paper.

Abstract

A classification is a surjective mapping from a set of objects to a set of categories. A classification aggregation function aggregates every vector of classifications into a single one. We show that every citizen sovereign and independent classification aggregation function is essentially a dictatorship. This impossibility implies an earlier result of Maniquet and Mongin (2016), who show that every unanimous and independent classification aggregation function is a dictatorship. The relationship between the two impossibilities is reminiscent to the relationship between Wilson's and Arrow's impossibilities in preference aggregation. Moreover, while the Maniquet-Mongin impossibility rests on the existence of at least three categories, we propose an alternative proof technique that covers the case of two categories, except when the number of objects is also two. We also identify all independent and unanimous classification aggregation functions for the case of two categories and two objects.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{cailloux2023classification,
  title  = {Classification Aggregation without Unanimity},
  author = {Olivier Cailloux and Matthieu Hervouin and Ali I. Ozkes and M. Remzi Sanver},
  year   = {2023},
  eprint = {2310.11841},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2310.11841v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2310.11841.svg)](https://codeofpaper.com/paper/2310.11841)

Discussion