Randomization inference when N equals one
From MaRDI portal
Randomization inference when \(N\) equals one
Cites work
- 4SID: Subspace algorithms for the identification of combined deterministic-stochastic systems
- A central limit theorem for generalized quadratic forms
- A new approach to causal inference in mortality studies with a sustained exposure period—application to control of the healthy worker survivor effect
- A New Approach to Learning Linear Dynamical Systems
- Analysis of Boolean Functions
- Analysis of Financial Time Series
- Batch policy learning in average reward Markov decision processes
- Causal models for longitudinal and panel data: a survey
- Double reinforcement learning for efficient off-policy evaluation in Markov decision processes
- Efficiently Breaking the Curse of Horizon in Off-Policy Evaluation with Double Reinforcement Learning
- Estimation of the Causal Effect of a Time-Varying Exposure on the Marginal Mean of a Repeated Binary Outcome
- Exact confidence intervals for the average causal effect on a binary outcome
- Investigating Causal Relations by Econometric Models and Cross-spectral Methods
- Off-policy estimation of long-term average outcomes with applications to mobile health
- Off-policy evaluation in partially observed Markov decision processes under sequential ignorability
- Optimal Dynamic Treatment Regimes
- Optimal Structural Nested Models for Optimal Sequential Decisions
- Panel experiments and dynamic causal effects: A finite population perspective
- Subspace model identification Part 1. The output-error state-space model identification class of algorithms
- Sufficiency of excitation
- The nonstochastic control problem
- Time series experiments and causal estimands: exact randomization tests and trading
This page was built for publication: Randomization inference when \(N\) equals one
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6915819)
