skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.
Attention:The NSF Public Access Repository (NSF-PAR) system and access will be unavailable from 7:00 AM ET to 7:30 AM ET on Friday, April 24 due to maintenance. We apologize for the inconvenience.


Title: Optimal Decision Rules when Payoffs are Partially Identified
We derive asymptotically optimal statistical decision rules for discrete choice problems when payoffs depend on a partially-identified parameter θ and the decision maker can use a point-identified parameter μ to deduce restrictions on θ. Examples include treatment choice under partial identification and pricing with rich unobserved heterogeneity. Our notion of optimality combines a minimax approach to handle the ambiguity from partial identification of θ given μ with an average risk minimization approach for μ. We show how to implement optimal decision rules using the bootstrap and (quasi-)Bayesian methods in both parametric and semiparametric settings. We provide detailed applications to treatment choice and optimal pricing. Our asymptotic approach is well suited for realistic empirical settings in which the derivation of finite-sample optimal rules is intractable.  more » « less
Award ID(s):
1919034
PAR ID:
10670893
Author(s) / Creator(s):
; ;
Publisher / Repository:
Oxford University Press
Date Published:
Journal Name:
Review of Economic Studies
Volume:
forthcoming
ISSN:
0034-6527
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. This paper studies optimal decision rules, including estimators and tests, for weakly identified GMM models. We derive the limit experiment for weakly identified GMM, and propose a theoretically‐motivated class of priors which give rise to quasi‐Bayes decision rules as a limiting case. Together with results in the previous literature, this establishes desirable properties for the quasi‐Bayes approach regardless of model identification status, and we recommend quasi‐Bayes for settings where identification is a concern. We further propose weighted average power‐optimal identification‐robust frequentist tests and confidence sets, and prove a Bernstein‐von Mises‐type result for the quasi‐Bayes posterior under weak identification. 
    more » « less
  2. Abstract We consider a decision maker who faces a binary treatment choice when their welfare is only partially identified from data. We contribute to the literature by anchoring our finite-sample analysis on mean square regret, a decision criterion advocated by Kitagawa et al. in (2022) Treatment Choice with Nonlinear Regret . We find that optimal rules are always fractional, irrespective of the width of the identified set and precision of its estimate. The optimal treatment fraction is a simple logistic transformation of the commonly used t-statistic multiplied by a factor calculated by a simple constrained optimization. This treatment fraction gets closer to 0.5 as the width of the identified set becomes wider, implying the decision maker becomes more cautious against the adversarial Nature. 
    more » « less
  3. When it comes to collective decisions, we have to deal with the fact that agents have preferences over both decision outcomes and how decisions are made. If we create rules for aggregating preferences over rules, and rules for preferences over rules for preferences over rules, and so on, it would appear that we run into infinite regress with preferences and rules at successively higher “levels.” The starting point of our analysis is the claim that such regress should not be a problem in practice, as any such preferences will necessarily be bounded in complexity and structured coherently in accordance with some (possibly latent) normative principles. Our core contributions are (1) the identification of simple, intuitive preference structures at low levels that can be generalized to form the building blocks of preferences at higher levels, and (2) the de- velopment of algorithms for maximizing the number of agents with such low-level preferences who will “accept” a decision. We analyze algorithms for acceptance maximization in two different domains: asymmetric dichotomous choice and constitutional amendment. In both settings we study the worst-case performance of the appro- priate algorithms, and reveal circumstances under which universal acceptance is possible. In particular, we show that constitutional amendment procedures proposed recently by Abramowitz et al. [2] can achieve universal acceptance. 
    more » « less
  4. Cassio de Campos; Marloes H. Maathuis (Ed.)
    When data contains measurement errors, it is necessary to make modeling assumptions relating the error-prone measurements to the unobserved true values. Work on measurement error has largely focused on models that fully identify the parameter of interest. As a result, many practically useful models that result in bounds on the target parameter -- known as partial identification -- have been neglected. In this work, we present a method for partial identification in a class of measurement error models involving discrete variables. We focus on models that impose linear constraints on the tar- get parameter, allowing us to compute partial identification bounds using off-the-shelf LP solvers. We show how several common measurement error assumptions can be composed with an extended class of instrumental variable-type models to create such linear constraint sets. We further show how this approach can be used to bound causal parameters, such as the average treatment effect, when treatment or outcome variables are measured with error. Using data from the Oregon Health Insurance Experiment, we apply this method to estimate bounds on the effect Medicaid enrollment has on depression when depression is measured with error. 
    more » « less
  5. On a finite probability space, we consider the problem of indifference pricing of contingent claims, where the preferences of an economic agent are modeled by an Inada utility stochastic field — the interior of its effective domain being (a,∞) — for some a∈R∪{−∞}. This allows for including utilities on both R and R+. We consider arbitrary contingent claims and show that, for replicable ones, the indifference price equals the initial value of the replicating strategy and thus depends neither on the agent’s initial wealth, for which the indifference pricing problem is well-posed, nor the utility stochastic field. This, in particular, shows the consistency of the indifference and arbitrage-free pricing methodologies for complete models. For nonreplicable claims, we show that the indifference price is equal to the expectation of the discounted payoff under the dual-optimal measure, which is equivalent to the reference probability measure. In particular, we demonstrate that the indifference price is unique for every choice of a smooth Inada utility stochastic field and initial wealth in (a,∞). Our proofs rely on the change of numéraire technique and a reformulation of the indifference pricing problem. The advantages of the settings of this paper and the approach allow for bypassing the technicalities and issues related to choosing the notion of admissibility and for including a wide range of utilities, including stochastic ones. We augment the results with examples. 
    more » « less