IDEAS home Printed from https://ideas.repec.org/p/ifs/cemmap/33-21.html
   My bibliography  Save this paper

Inference in a class of optimization problems: Con?dence regions and ?nite sample bounds on errors in coverage probabilities

Author

Listed:
  • Joel L. Horowitz

    (Institute for Fiscal Studies and Northwestern University)

  • Sokbae (Simon) Lee

    (Institute for Fiscal Studies and Columbia University)

Abstract

This paper describes three methods for carrying out non-asymptotic inference on partially identi?ed parameters that are solutions to a class of optimization problems. Applications in which the optimization problems arise include estimation under shape restrictions, estimation of models of discrete games, and estimation based on grouped data. The partially identi?ed parameters are characterized by restrictions that involve the unknown population means of observed random variables in addition to the structural parameters of interest. Inference consists of ?nding con?dence intervals for the structural parameters. Our theory provides ?nite-sample lower bounds on the coverage probabilities of the con?dence intervals under three sets of assumptions of increasing strength. With the moderate sample sizes found in most economics applications, the bounds become tighter as the assumptions strengthen. We discuss estimation of population parameters that the bounds depend on and contrast our methods with alternative methods for obtaining con?dence intervals for partially identi?ed parameters. The results of Monte Carlo experiments and empirical examples illustrate the usefulness of our method.

Suggested Citation

  • Joel L. Horowitz & Sokbae (Simon) Lee, 2021. "Inference in a class of optimization problems: Con?dence regions and ?nite sample bounds on errors in coverage probabilities," CeMMAP working papers CWP33/21, Centre for Microdata Methods and Practice, Institute for Fiscal Studies.
  • Handle: RePEc:ifs:cemmap:33/21
    as

    Download full text from publisher

    File URL: https://www.cemmap.ac.uk/wp-content/uploads/2021/08/CWP3321-Inference-in-a-class-of-optimization-problems-Con%EF%AC%81dence-regions-and-%EF%AC%81nite-sample-bounds-on-errors-in-coverage-probabilities.pdf
    Download Restriction: no
    ---><---

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ifs:cemmap:33/21. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Emma Hyman (email available below). General contact details of provider: https://edirc.repec.org/data/cmifsuk.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.