To make high-quality research more accessible and easier to explore.

Fields:
2 results ✕ Clear filters

Sieve Wald and QLR Inferences on Semi/Nonparametric Conditional Moment Models

Econometrica 2015 83(3), 1013-1079
This paper considers inference on functionals of semi/nonparametric conditional moment restrictions with possibly nonsmooth generalized residuals, which include all of the (nonlinear) nonparametric instrumental variables (IV) as special cases. These models are often ill-posed and hence it is difficult to verify whether a (possibly nonlinear) functional is root-n estimable or not. We provide computationally simple, unified inference procedures that are asymptotically valid regardless of whether a functional is root-n estimable or not. We establish the following new useful results: (1) the asymptotic normality of a plug-in penalized sieve minimum distance (PSMD) estimator of a (possibly nonlinear) functional; (2) the consistency of simple sieve variance estimators for the plug-in PSMD estimator, and hence the asymptotic chi-square distribution of the sieve Wald statistic; (3) the asymptotic chi-square distribution of an optimally weighted sieve quasi likelihood ratio (QLR) test under the null hypothesis; (4) the asymptotic tight distribution of a non-optimally weighted sieve QLR statistic under the null; (5) the consistency of generalized residual bootstrap sieve Wald and QLR tests; (6) local power properties of sieve Wald and QLR tests and of their bootstrap versions; (7) asymptotic properties of sieve Wald and SQLR for functionals of increasing dimension. Simulation studies and an empirical illustration of a nonparametric quantile IV regression are presented.

Tight Revenue Bounds With Possibilistic Beliefs and Level-k Rationality

Econometrica 2015 83(4), 1619-1639 open access
Mechanism design enables a social planner to obtain a desired outcome by leveraging the players’ rationality and their beliefs. It is thus a fundamental, but yet unproven, intuition that the higher the level of rationality of the players, the better the set of obtainable outcomes. In this paper, we prove this fundamental intuition for players with possibilistic beliefs, a model long considered in epistemic game theory. Specifically, • We define a sequence of monotonically increasing revenue benchmarks for single- good auctions, G0 ≤ G1 ≤ G2 ≤ · · ·, where each Gi is defined over the players’ beliefs and G0 is the second-highest valuation (i.e., the revenue benchmark achieved by the second-price mechanism). • We (1) construct a single, interim individually rational, auction mechanism that, without any clue about the rationality level of the players, guarantees revenue Gk if all players have rationality levels ≥ k + 1, and (2) prove that no such mechanism can guarantee revenue even close to Gk when at least two players are at most level-k rational.