Feature selection, also known as variable selection, is a foundational problem in econometrics, artificial intelligence, and machine learning. However, widely used procedures may be inaccurate, unstable under collinearity, and sensitive to sampling noise and may lack a principled interpretation in terms of how they allocate explanatory power. This paper develops a feature-selection framework that extends a fair-division approach introduced by Hu ([2020, 2025). We represent the explanatory or forecasting performance of feature subsets as payoffs in a coalitional game subject to sampling uncertainty. Candidate features are partitioned into selected and unselected sets according to their fair-division values, defined using a modified Shapley value. Model uncertainty is represented by a beta-binomial distribution over subset size and a uniform distribution over subsets conditional on size. Each feature’s value combines the expected marginal gain from inclusion with the expected opportunity loss associated with exclusion, thereby treating all candidates symmetrically ex ante under a veil-of-ignorance principle. We further propose a sequential selection algorithm that uses a Monte Carlo approximation and a likelihood-ratio screening rule that admits at most one feature per iteration. Across the simulation designs considered, the procedure attains substantially higher exact-identification rates than those of the benchmark methods, including stepwise, unidirectional, GETS-style, and LASSO-based procedures. The paper also examines residual-share-based hyperparameter calibration, computational complexity, selection consistency, and practical implementation considerations.