Nonparametric Identification of Accelerated Failure Time Competing Risks Models
Sokbae (Simon) Lee and
Arthur Lewbel
No 755, Boston College Working Papers in Economics from Boston College Department of Economics
Abstract:
We provide new conditions for identification of accelerated failure time competing risks models. These include Roy models and some auction models. In our set up, unknown regression functions and the joint survivor function of latent disturbance terms are all nonparametric. We show that this model is identified given covariates that are independent of latent errors, provided that a certain rank condition is satisfied. We present a simple example in which our rank condition for identification is verified. Our identification strategy does not depend on identification at infinity or near zero, and it does not require exclusion assumptions. Given our identification, we show estimation can be accomplished using sieves.
Keywords: accelerated failure time models; competing risks; identifiability. (search for similar items in EconPapers)
Date: 2010-04-01, Revised 2011-06-30
New Economics Papers: this item is included in nep-ecm
References: View complete reference list from CitEc
Citations:
Downloads: (external link)
http://fmwww.bc.edu/EC-P/wp755.pdf main text (application/pdf)
Related works:
Journal Article: NONPARAMETRIC IDENTIFICATION OF ACCELERATED FAILURE TIME COMPETING RISKS MODELS (2013) 
Working Paper: Nonparametric identification of accelerated failure time competing risks models (2010) 
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:boc:bocoec:755
Access Statistics for this paper
More papers in Boston College Working Papers in Economics from Boston College Department of Economics Boston College, 140 Commonwealth Avenue, Chestnut Hill MA 02467 USA. Contact information at EDIRC.
Bibliographic data for series maintained by Christopher F Baum ().