Even an infinite bureaucracy eventually makes a decision
classification
🧮 math.CO
keywords
decisioninfiniteanswerbureaucracycasecommitteesconjecturedetermined
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.