Topological aggregation, the twin paradox and the no show paradox
Guillaume Ch\`eze (IMT)

TL;DR
This paper demonstrates that within the topological aggregation framework, fundamental paradoxes like the Twin Paradox and the No Show Paradox are unavoidable, regardless of anonymity or unanimity assumptions.
Contribution
It proves the inherent presence of these paradoxes in topological aggregation, highlighting limitations of the framework.
Findings
Twin Paradox cannot be avoided in topological aggregation
No Show Paradox cannot be avoided in topological aggregation
Results hold without requiring anonymity or unanimity
Abstract
Consider the framework of topological aggregation introduced by Chichilnisky (1980). We prove that in this framework the Twin Paradox and the No Show Paradox cannot be avoided. Anonymity and unanimity are not needed to obtain these results.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Applications · Advanced Topology and Set Theory · Game Theory and Voting Systems
