Even an infinite bureaucracy eventually makes a decision
Johannes Carmesin

TL;DR
The paper demonstrates that decision-making processes through infinite committee structures can still yield definitive outcomes, extending finite decision models and contributing to matroid theory.
Contribution
It introduces a novel extension of decision-making models to infinite structures, linking to the Matroid Intersection Conjecture.
Findings
Infinite committee trees can produce determinate decisions
Extension of finite decision models to infinite cases
New special case of the Matroid Intersection Conjecture
Abstract
We show that the fact that a political decision filtered through a finite tree of committees gives a determined answer generalises in some sense to infinite trees. This implies a new special case of the Matroid Intersection Conjecture.
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
TopicsAdvanced Graph Theory Research · Game Theory and Voting Systems · Topological and Geometric Data Analysis
