{"ID":2888563,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2508.00181","arxiv_id":"2508.00181","title":"Measuring leadership and productivity in an organisational structure","abstract":"This paper develops a novel methodological framework for assessing leadership potential and productivity within organisational structure represented by directed graphs. In this setting, individuals are modeled as nodes and asymmetric supervisory or reporting relationships as directed edges. Leveraging the theory of transferable utility cooperative games, we introduce the Average Forest (AF) measure, a marginalist leadership measure grounded in the enumeration of maximal spanning forests, where teams are hierarchically structured as arborescences. The AF measure captures each agent`s expected contribution across all feasible team configurations under the assumption of superadditivity of the underlying game. We further define a measure of organisational productivity as the expected aggregate value derived from these configurations. The paper investigates key theoretical properties of the AF measure -- such as linearity, component feasibility, and monotonicity -- and analyzes its sensitivity to structural modifications in the underlying digraph. To address computational challenges in large networks, a Monte Carlo simulation algorithm is proposed for practical estimation. This framework enables the identification of structurally optimal leaders and enhances understanding of how network design impacts collective performance.","short_abstract":"This paper develops a novel methodological framework for assessing leadership potential and productivity within organisational structure represented by directed graphs. In this setting, individuals are modeled as nodes and asymmetric supervisory or reporting relationships as directed edges. Leveraging the theory of tra...","url_abs":"https://arxiv.org/abs/2508.00181","url_pdf":"https://arxiv.org/pdf/2508.00181v1","authors":"[\"Ramón Flores\",\"Elisenda Molina\",\"Juan Tejada\"]","published":"2025-07-31T21:56:28Z","proceeding":"math.OC","tasks":"[\"math.OC\"]","methods":"[\"Generative Adversarial Network\"]","has_code":false}