preprint · research square · 2025

Computational Complexity of Organizational Decision Hierarchies

abstract

Models organizational decision hierarchies as bounded-span monotone threshold circuits, making the tradeoffs between decision latency, accuracy, and headcount formally explicit. Aggregating n binary signals with span s requires depth at least ⌈logₛ n⌉. Simulations with 256 signals show the tension concretely: widening spans from 4 to 16 cuts latency roughly in half but drops decision accuracy from 100% to about 90% under realistic noise.

@misc{nguyen2025hierarchies,
  author = {Nguyen, Michel},
  title = {Computational Complexity of Organizational Decision Hierarchies},
  year = {2025},
  howpublished = {Research Square},
  doi = {10.21203/rs.3.rs-7948428/v1},
  url = {https://doi.org/10.21203/rs.3.rs-7948428/v1}
}