Given a (finite or infinite) set X, a collection C P(X ) of subsets of X is called a hierarchy if it satisfies the condition ` '' In this note, we characterize maximal hierarchies as set systems that contain the empty set, the full set, and all one-element sets, and in addition satisfy either one of
A NOTE ON THE HIERARCHY–TEAM DEBATE
✍ Scribed by A. GEORGES L. ROMME
- Publisher
- John Wiley and Sons
- Year
- 1996
- Tongue
- English
- Weight
- 588 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0143-2095
No coin nor oath required. For personal study only.
✦ Synopsis
This note explores the debate between proponents of organizational learning who have criticized hierarchy as an obstacle to learning and those who have defended hierarchy as indispensable for large organizations. By considering hierarchy and team as ideal-typical information systems, it is argued that both teams and hierarchies are essentiai for organizational learning in large organizations. Teams appear to be the key learning units which are indispensable for producing and understanding novel information, and hierarchies are indispensable for processing and storing important learning results. The trade-off between teams and hierarchy can be solved by emphasizing the idea of circularity, involving the ability to switch between teams and hierarchies as complementary information systems in the context of organizational learning. 10, pp.
📜 SIMILAR VOLUMES
Environmental impact assessment (EIA) is an intrinsically complex multi-dimensional process, involving multiple criteria and multiple actors. Multi-criteria methods can serve as useful decision aids for carrying out the EIA. This paper proposes the use of a multi-criteria technique, namely the analy
In this note, it is shown that the Hardy᎐Hilbert inequality for double series can Ž . be improved by introducing a proper weight function of the form rsin rp y Ž . 1y1rr Ž Ž . . O n rn with O n ) 0 into either of the two single summations. When r r r s 2, the classical Hilbert inequality is improved
For f (X ) # Z[X], let D f (n) be the least positive integer k for which f (1), ..., f (n) are distinct modulo k. Several results have been proven about the function D f in recent years, culminating in Moree's characterization of D f (n) whenever f lies in a certain (large) subset of Z[X ] and n is