IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2503.14940.html
   My bibliography  Save this paper

Linear programming approach to partially identified econometric models

Author

Listed:
  • Andrei Voronin

Abstract

Sharp bounds on partially identified parameters are often given by the values of linear programs (LPs). This paper introduces a novel estimator of the LP value. Unlike existing procedures, our estimator is root-n-consistent, pointwise in the probability measure, whenever the population LP is feasible and finite. Our estimator is valid under point-identification, over-identifying constraints, and solution multiplicity. Turning to uniformity properties, we prove that the LP value cannot be uniformly consistently estimated without restricting the set of possible distributions. We then show that our estimator achieves uniform consistency under a condition that is minimal for the existence of any such estimator. We obtain computationally efficient, asymptotically normal inference procedure with exact asymptotic coverage at any fixed probability measure. To complement our estimation results, we derive LP sharp bounds in a general identification setting. We apply our findings to estimating returns to education. To that end, we propose the conditionally monotone IV assumption (cMIV) that tightens the classical monotone IV (MIV) bounds and is testable under a mild regularity condition. Under cMIV, university education in Colombia is shown to increase the average wage by at least $5.5\%$, whereas classical conditions fail to yield an informative bound.

Suggested Citation

  • Andrei Voronin, 2025. "Linear programming approach to partially identified econometric models," Papers 2503.14940, arXiv.org.
  • Handle: RePEc:arx:papers:2503.14940
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2503.14940
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    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:arx:papers:2503.14940. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.