Private Firm Valuation Using Multiples: Can Artificial Intelligence Algorithms Learn Better Peer Groups?

Abstract

Forming optimal peer groups is a crucial step in multiplier valuation. Among others, the traditional regression methodology requires the definition of the optimal set of peer selection criteria and the optimal size of the peer group a priori. Since there exists no universally applicable set of closed and complementary rules on selection criteria due to the complexity and the diverse nature of firms, this research exclusively examines unlisted companies, rendering direct comparisons with existing studies impractical. To address this, we developed a bespoke benchmark model through rigorous regression analysis. Our aim was to juxtapose its outcomes with our unique approach, enriching the understanding of unlisted company transaction dynamics. To stretch the performance of the linear regression method to the maximum, various datasets on selection criteria (full as well as F- and NCA-optimized) were employed. Using a sample of over 20,000 private firm transactions, model performance was evaluated employing multiplier prediction error measures (emphasizing bias and accuracy) as well as prediction superiority directly. Emphasizing five enterprise and equity value multiples, the results allow for the overall conclusion that the self-organizing map algorithm outperforms the traditional linear regression model in both minimizing the valuation error as measured by the multiplier prediction error measures as well as in direct prediction superiority. Consequently, the machine learning methodology offers a promising way to improve peer selection in private firm multiplier valuation.

Keywords

• private firm valuation
• multiples
• peer group
• peer selection
• artificial intelligence
• self-organizing map