Showing 1 - 9 of 9
Persistent link: https://www.econbiz.de/10012110356
We consider a variable selection problem for the prediction of binary outcomes. We study the best subset selection procedure by which the explanatory variables are chosen by maximizing Manski (1975, 1985)'s maximum score type objective function subject to a constraint on the maximal number of...
Persistent link: https://www.econbiz.de/10011775359
We develop a practical and novel method for inference on intersection bounds, namely bounds defined by either the infimum or supremum of a parametric or nonparametric function, or equivalently, the value of a linear programming problem with a potentially infinite constraint set. Our approach is...
Persistent link: https://www.econbiz.de/10003869258
We develop a practical and novel method for inference on intersection bounds, namely bounds defined by either the infimum or supremum of a parametric or nonparametric function, or equivalently, the value of a linear programming problem with a potentially infinite constraint set. Our approach is...
Persistent link: https://www.econbiz.de/10009375645
Persistent link: https://www.econbiz.de/10009752302
We develop a practical and novel method for inference on intersection bounds, namely bounds defined by either the infimum or supremum of a parametric or nonparametric function, or equivalently, the value of a linear programming problem with a potentially infinite constraint set. We show that...
Persistent link: https://www.econbiz.de/10009668003
We develop a practical and novel method for inference on intersection bounds, namely bounds defined by either the infimum or supremum of a parametric or nonparametric function, or equivalently, the value of a linear programming problem with a potentially infinite constraint set. We show that...
Persistent link: https://www.econbiz.de/10010318689
We develop a practical and novel method for inference on intersection bounds, namely bounds defined by either the infimum or supremum of a parametric or nonparametric function, or equivalently, the value of a linear programming problem with a potentially infinite constraint set. Our approach is...
Persistent link: https://www.econbiz.de/10010288330
We develop a practical and novel method for inference on intersection bounds, namely bounds defined by either the infimum or supremum of a parametric or nonparametric function, or equivalently, the value of a linear programming problem with a potentially infinite constraint set. Our approach is...
Persistent link: https://www.econbiz.de/10010288411