The m-sophistication of a finite binary string x is introduced as a generalization of some parameter in the proof that complexity of complexity is rare. A probabilistic near sufficient statistic of x is given which length is upper bounded by the m-sophistication of x within small additive terms. This shows that m-sophistication is lower bounded by coarse sophistication and upper bounded by soph...

We propose a broadly applicable empirical approach to classify individuals as time-consistent versus naive or sophisticated regarding their self-control limitations. Operationalizing our based on nationally representative data reveals that problems are pervasive and most people at least partly aware of limited self-control. Compared naifs, sophisticates have higher IQs, better educated parents,...