Abstract
ABSTRACT This article shows how to construct a likelihood for a general class of censoring problems. This likelihood is proven to be valid, i.e. its maximizer is consistent and the respective root-n estimator is asymptotically efficient and normally distributed under regularity conditions. The method generalizes ordinary maximum likelihood estimation as well as several standard estimators for censoring problems (e.g. tobit type I–tobit type V).
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
