Economics
0 plays · 0 likes
The day in economics: the evidence behind how people and markets behave.
Economics reads the day's econ papers: the mechanism, the agents it assumes, and the identification that makes the claim evidence rather than a story. The show asks what would falsify it, and who in the model benefits when they can choose.
Episode: Daily Summary for 2026-11-01
November 02, 2026
Listen in the app · Audio file · Video file
Introduction to the show: ident: Economics. The day in economics: theory, mechanisms and the evidence beneath them.
Ruth: It's the first of November, twenty twenty-six, and this is the day's research.
Warren: 11 new papers came out today.
Ruth: I'm Ruth.
Warren: And I'm Warren, here with Iris.
Ruth: We'll take the day in one pass, then pull out the papers we're staying with.
Warren: Start us off with From Many Models, One.
The day's research: Ruth: Combining Follow-the-Leader and Hedge algorithms aggregates Multi-Frequency Echo State Networks for quarterly GDP growth.
Warren: That adaptive aggregation significantly reduced the mean squared forecasting error compared to individual models.
Iris: We also developed methods for conditional forecasting in large Bayesian vector autoregressions using a factor structure on reduced-form errors.
Ruth: This technique allows us to compute counterfactual predictions, like oil price paths under different structural shocks.
Warren: Realized stochastic volatility models with skew-t distributions compare against EGARCH and REGARCH benchmarks for tail risk forecasting.
Iris: Adding realized volatility improves forecasts for both the Dow Jones and Nikkei 225, though gains are not uniform.
Ruth: The model showing how manufacturing and commercial capabilities interact determines exporter types like direct or hybrid firms.
Warren: That model shows that equilibrium endogenously generates four exporter types based on product manufacturing and platform use.
Iris: Thresholding Multiple Outcomes adjusts standard errors for cross-sectional dependence using observations from several outcomes instead of geographic distance.
Ruth: The procedure estimates location correlation and finds a threshold based on the distribution of those estimates to categorize pairs.
Warren: Pairs exceeding this threshold are treated as correlated, which leads to sizable reductions in bias in county-level regressions.
Iris: The TMO estimator can substantively change estimated standard errors, showing a median increase of thirty-seven percent compared to geographic proximity methods.
Lucky paper: 2512.13642: Ruth: Alright, we’re looking at From Many Models, One today. This paper explores how combining different forecasting models can beat using just one model on its own.
Warren: It investigates ensembles of Multi-Frequency Echo State Networks and uses online learning algorithms like Follow-the-Leader and Hedge to manage the combination process.
Iris: The key finding here is that model combination, specifically using the Follow-the-Leader scheme, provides significant predictive gains over using a single MFESN model alone.
Ruth: You mentioned gains up to forty-one percent for the best model type in the M-MFESN B setting; what does that actually mean for someone trying to build a forecasting system?
Warren: It means if you use this ensemble approach, you could see error reductions exceeding fifty-one percent compared to the standard AR(one) benchmarks.
Iris: That level of reduction is substantial because it suggests that the model combination method efficiently sidesteps the need for hyperparameter tuning, which is usually very non-trivial with these types of networks.
Ruth: I’m curious about those leak rates you mentioned; are we talking about setting the weight dynamics around zero point seven for S-MFESNs?
Warren: Yes, the empirical analysis showed that baseline S-MFESNs start with an alpha of zero point one, but values around zero point seven are suggested to be more robust across different classes of MFESN models.
Iris: That difference in the optimal leak rate based on whether you are looking at an S-MFESN or an M-MFESN model shows how adaptivity is particularly valuable for these networks because the randomness induces persistent heterogeneity.
Ruth: So, if someone is building a real-time prediction system, does this mean they can use this combination approach instead of just tuning one giant model?
Warren: It suggests that instead of selecting one single forecasting model, you can use an ensemble and let the online algorithms manage the weight dynamics adaptively.
Iris: The paper provides pseudo-code for FTL and AdaHedge, which lets engineers actually see how these weight dynamics are supposed to operate in practice.
Ruth: So the combination of theory and practical algorithms gives a clear path forward for better macroeconomic forecasting without getting bogged down in manual tuning?
Lucky paper: 2607.29215: Ruth: Okay, let's get into the details of this paper, Conditional projection methods for large-scale Bayesian VARs.
Warren: The core idea seems to be using factor structures on reduced-form errors to estimate those high dimensional vector autoregressions fast and order invariant.
Iris: So, what does that factor structure actually do for the estimation process when you have a really large cross section of endogenous variables and long lag orders?
Tom: From an ML engineering standpoint, I'm curious about the algorithm itself; is the cost truly cubic only in the number of restrictions while the system size enters linearly?
Lu: The paper proposes an exact sampler for conditional projections where you draw from auxiliary distributions N (zero Id) and N (zero Ω) independently to get restricted innovations ξ star.
Ruth: And that allows you to construct those final conditional projections y t plus one through H R r omega from the distribution N (µy, Vy).
Warren: That makes sense because it lets you enforce distributional restrictions on observables, structural shocks, and idiosyncratic components separately.
Iris: When you look at the empirical demonstration with that framework, how does restricting those structural origins affect the counterfactual predictions for something like an oil price path?
Tom: The results show that under obs/idio/struc conditioning, the required magnitude of the structural oil price shock increases by an order of magnitude.
Lu: That specific conditioning scheme produces a pronounced pattern of stagflation when you look at those required shocks.
Ruth: But does that level of certainty about the structural origin come with diffuse counterfactual predictions?
Iris: Yes, the paper concludes that restricting the structural origins is relevant because those required shocks differ markedly across conditioning schemes.
Tom: If we are looking at computational efficiency comparisons, how does Algorithm one actually stack up against its four competing samplers in larger system cells?
Lu: In the biggest sparsely restricted configurations, Algorithm one outpaces the joint samplers by factors of five to ten.
Warren: That means for very large systems with sparse restrictions, this method is significantly faster than other approaches.
Iris: Are there any limitations mentioned regarding when this framework can be applied, or what it doesn't handle well?
Tom: The authors mention that the precision sampler takes over in the most densely restricted settings, which tells us where the trade-off lies.
Ruth: So, even with these fast methods, how certain are we about those structural origins when you use that full obs/idio/struc conditioning scheme?
Iris: The certainty about the structural origin comes at the price of much more diffuse counterfactual predictions.
Warren: It suggests a trade-off between getting a clear picture of the structure versus having a more general set of possible outcomes.
Lucky paper: 2401.13179: Ruth: Let's look at this paper now, From Many Models, One. We’re focusing on the Realized Stochastic Volatility Models with Skew-t Distributions for Volatility and Tail Risk Forecasting.
Warren: So, we talked about how combining models cuts error down to a certain level. What is the main finding here about incorporating realized volatility?
Iris: The analysis on the DJIA shows that including realized volatility improves volatility forecasting under extreme market stress, but the gains in tail-risk forecasting are more modest.
Ruth: Modest how modest are we talking about? Does it mean it’s only a small improvement to the value-at-risk measures?
Warren: It means the cross-model differences in FZ0 loss aren't statistically significant for the tail risk part, but once you add those free psi models, things look better overall.
Iris: Exactly. When you include the free psi RSV models, they attain a lower QLIKE than any psi equals one model across all four proxies and a lower FZ0 loss than their stochastic volatility counterparts in all six matched pairs at both risk levels.
Ruth: So we're seeing a clear win there when we relax that restriction on psi. What about the specific indices? Does this hold true for the Nikkei two hundred twenty-five?
Warren: For the N225, estimating psi freely helps RSV volatility forecasts for four of the six distributions, but it costs FZ0 loss almost everywhere.
Iris: That's a key distinction. It shows that the benefit from relaxing psi is index-specific rather than general across all markets.
Ruth: So we have an index-specific trade-off then? Is fixing psi equals one still a defensible default for making models comparable?
Warren: It's defensible for keeping the RSV and REGARCH measurement equations comparable, but it's not what a free estimate would select for the RSV models on this sample.
Iris: The text states that fixing psi equals one is a device for comparability, but the gain from relaxing it is index-specific rather than general.
Ruth: That means we can keep things consistent if we prioritize comparison across different model types, even if we miss out on some potential improvement on a single index.
Warren: Right, so the benefit of free psi depends entirely on which index you are looking at.
Iris: Furthermore, the paper notes that for REGARCH models on the N225, a free psi raises QLIKE under all four proxies there but leaves the FZ0 loss essentially unchanged.
Ruth: So we have this split: one index gets a clear win from relaxing psi, and another doesn't see much change in loss when it does.
Warren: It reinforces that the benefit of relaxing psi is index-specific rather than general across all markets.
Iris: And the overall conclusion is that incorporating realized volatility substantially improves forecast accuracy when comparing RSV and REGARCH models against their SV and EGARCH counterparts.
Lucky paper: 2609.15573: Ruth: We're looking at Algorithmic Attention and Content Creation on Social Media Platforms today, a paper by Chen, Li, and Preuss from Cornell.
Warren: The core idea is how recommendation algorithms allocate attention to maximize revenue by balancing harvesting ads with creating content incentives for users.
Iris: It seems the authors characterize creators into four types based on their ability: Inactive, Local Entertainers, Ladder Climbers, and Global Influencers.
Ruth: They suggest the optimal design uses attention subsidies discriminatorily based on these creator types.
Warren: Under complete information about user and creator vertical types, the optimal algorithm is defined by an increasing total attention function Xi such that xii(theta, v) equals one if n Gij(v) greater than or equal to one minus Xi(theta) beta i o.
Iris: That characterization segments creators based on their ability, but what happens when the information about those vertical types is private?
Ruth: When the vertical types are private information on both sides, the optimal allocation function changes to one that involves an integral over theta of u-tilde dtheta.
Warren: This shift means that private information makes it more costly for the platform to expand and monetize network effects, which leads to lower viewer attention and lower creator effort.
Iris: So, when they introduce direct monetary payments to creators, does the optimal mechanism still rely solely on exposure or does it incorporate payment jointly?
Ruth: The comparative static shows that a higher z means each unit of viewer attention is more valuable in direct advertising monetization, pushing platforms toward more monetary transfers.
Warren: That suggests a trade-off between attention allocation and direct payments, which is interesting because the results point to regulatory considerations for how these systems operate.
Iris: The implementation involves mapping observed quality into a promised total attention via an allocation rule chii(q), and the results suggest a regulatory trade-off regarding diversity versus user welfare.
Lucky paper: 2512.20918: Ruth: Moving on to welfare at risk, we look at how Costas Lambros and Emerson Melo developed this distributional framework that accounts for heterogeneity in policy welfare.
Warren: The core idea here is using quantile-based bounds to estimate the distribution of individual welfare changes even when we don't know that distribution directly.
Iris: They build on a perturbed utility model, which is essentially a latent choice model, accommodating additive unobserved heterogeneity like ARUMs or bundling models.
Ruth: So they are defining a conditional average welfare W(x) as the expectation of the maximum utility among choices within a budget B.
Warren: And they introduce superquantiles to generalize quantiles, so for instance, the twenty percent superquantile reports the average welfare among those in the bottom twenty percent.
Iris: Theorem one shows that these unobservable individual welfare changes are bounded above by their conditional average counterpart, which is identified.
Ruth: But this framework also handles ambiguity about what we know about the distribution of our observables X, using a phi-divergence neighborhood around the nominal covariate distribution.
Warren: That robust bound S R beta(Z) is defined as the infimum over a set U phi of G in U over F and rho.
Iris: Theorem three confirms that this upper bound on the superquantile of individual welfare changes holds even when the marginal distribution of X is ambiguous, controlled by rho.
Ruth: They apply this to generalized Roy models with subjective participation costs, deriving bounds for treatment on the treated group that are new in this literature.
Warren: Corollary four gives us a lower bound on the buffered probability of welfare loss among those who received treatment, which can be computed from just the identified function WTT(X, Z).
Iris: The results are immune to instrument sensitivity because they take the infimum over an ambiguity set rather than choosing specific instruments.
Ruth: The price for this robustness is quantified by Inf(rho*), which measures the distance above a trivial floor relative to the non-robust bound, and that quantity can be computed directly from estimated propensity scores.
Warren: So this framework provides distributional bounds for treatment effects that are new, even extending naturally to the multi-sector environments studied by HUV.
Episode: Learning to Detect Recessions from Pseudo-out-of-sample Tests
In short: An algorithm was developed to detect US recessions in real time by creating hundreds of millions of classifiers from unemployment and vacancy data. This method identifies all 15 historical recessions without false positives by selecting classifiers on an anticipation-precision frontier, leading to a robust, fast signal.
November 01, 2026
Listen in the app · Audio file · Video file
Introduction to the show: ident: Economics. The day in economics: theory, mechanisms and the evidence beneath them.
Ruth: We're looking at the paper: "Learning to Detect Recessions from Pseudo-out-of-sample Tests".
Warren: Here's the gist of the paper. This paper develops an algorithm for detecting US recessions in real time by constructing hundreds of millions of recession classifiers from unemployment and vacancy data because this approach identifies all 15 historical recessions without any false positives and selects classifiers on the anticipation-precision frontier to optimize both earliness and accuracy Algorithm Construction The algorithm constructs hundreds of millions of recession classifiers by combining the unemployment and vacancy data These indicators are constructed in four steps: smoothing the data, detecting turning points, scaling variations, and combining single-variable indicators The process involves constructing 95,832 recession indicators from the unemployment and vacancy rates These indicators are created by processing unemployment and vacancy data in many different ways.
Ruth: Classifier Selection Criteria The algorithm selects perfect classifiers, which avoid both false negatives (undetected true recessions) and false positives (falsely detected recessions) between 1929 and 2021 These perfect classifiers are constructed by combining all the recession indicators with all thresholds ζ = 0.0001, 0.0002, 0.3,..., 1 In total, this procedure produces 4,481,622 perfect classifiers that detect all the recessions that occurred between 1929 and 2021 without false positives.
Warren: Optimization of Detection The algorithm selects classifiers on the anticipation-precision frontier to optimize jointly the earliness and accuracy of detection The frontier comprises the classifiers with lowest mean error (highest anticipation) and lowest standard deviation of errors (highest precision).
Ruth: The high-precision segment of this frontier is selected because it has a standard deviation of errors below 3 months.
Paper summary: Ruth: To wrap up, this paper "Learning to Detect Recessions from Pseudo-out-of-sample Tests" developed an algorithm that builds hundreds of millions of recession classifiers by combining unemployment and vacancy data to find real-time recession signals >
Warren: The core contribution seems to be the optimization process. They select perfect classifiers and then narrow them down onto the high precision segment of the anticipation-precision frontier to get earliness without losing accuracy >
Iris: It’s important that they establish this method works by showing it identifies all fifteen historical recessions from one thousand nine hundred twenty-nine to two thousand twenty-one without any false positives, and then uses a placebo test to confirm those are genuine economic signals > <ref:2506.09664#pg1>
Ruth: And the implication is that labor market conditions characteristic of a recession aren't just coming; they are already here, evidenced by the sixty-four percent probability in September two thousand twenty-five > <ref:2506.09664#pg1>
Warren: The paper suggests this approach is better than traditional methods because it filters the data more intelligently, extracting more information than just using arbitrary rules like the Michez or Sahm rule >
Iris: The method’s limitation they flag is that if you were to retrain it on a longer period, specifically including two thousand twenty-two through two thousand twenty-five only classifiers that don't detect recessions in those later years would be selected > <ref:2506.09664#pg1>
Ruth: So the paper shows how optimizing the filtering process can lead to faster and more accurate detection than older approaches like the NBER Business Cycle Dating Committee >
Conclusion: Ruth: So we've been looking at how they built this massive set of classifiers to find recessions using unemployment and job vacancy data across nearly a century, and now we're getting to the end of this paper, "Learning to Detect Recessions from Pseudo-out-of-sample Tests."
Warren: Right. The core idea here is taking those hundreds of millions of potential recession signals and really filtering them down onto this specific frontier between earliness and accuracy. It sounds like they’ve optimized a system where the cost of running that detection strategy is being carefully managed against how early they catch things.
Iris: What I see in the conclusion is that these results are quite robust because they tested it on data before, not just data after, which adds a layer of confidence to their findings about those perfect classifiers. The authors are saying this isn't some fluke; it’s systematic identification based on how the variables behave.
Ruth: Exactly. The paper argues that this method improves upon older ways of filtering labor market data because it’s not just picking arbitrary rules; they are mathematically optimizing the selection process itself to get a signal that is both early and precise.
Warren: And what this means for us, as someone who deals with trading or forecasting, is that if you can build a system like this—one that keeps the error standard deviation low, below three months—you’re looking at a detection time much faster than established bodies like the NBER Business Cycle Dating Committee.
Iris: That speed difference you mentioned earlier is key. They found this ensemble of eleven classifiers signals recessions about two point one months after they start, with an error standard deviation of one point eight months. That’s a significant improvement over that committee’s average six point three months.
Ruth: And it points to something deeper, doesn't it? The conclusion suggests that the conditions we see now in the labor market aren't just coming; they are actually here, given those sixty-four percent probabilities they calculated for September twenty twenty-five.
Warren: That’s a strong statement. They conclude that only classifiers not detecting recessions from two thousand twenty-two through two thousand twenty-five would have been selected if they had retrained the model on that extended period, which is an interesting way to test the stability of the signal.
Iris: It also flags a limitation, though. The authors state clearly that if you were to retrain this model using a longer historical window, specifically including two thousand twenty-two through two thousand twenty-five only those classifiers that failed to detect recessions in that later period would be chosen.
Ruth: So the implication is that the current structure of the labor market is already displaying characteristics of a recession according to these optimized rules, and we’re looking at a highly reliable way to track those changes in real time.
Episode: The day in conversation for 2026-11-01
November 01, 2026
Listen in the app · Audio file
The discussion: Ruth: That idea about adaptive aggregation in the reservoir ensemble reducing GDP forecast errors is compelling because it addresses the inherent instability of relying on any one structural model when trying to capture cyclical shifts in U.S. quarterly growth. Warren: It does seem robust, but I’m curious how much predictive power we actually gain compared to a sophisticated single-model approach, especially given the computational overhead of running those ensemble methods across multiple iterations? Iris: The real advantage isn't necessarily the raw accuracy improvement over a baseline model; it’s the robustness during periods where underlying assumptions—like inflation expectations—change abruptly. For instance, in Q3 of last year when we saw that sudden supply chain bottleneck, a single ARIMA model completely failed to anticipate the deceleration rate, but those ensemble methods maintained a relatively narrow band. Ruth: That speaks to the concept of cross-model validation we discussed earlier regarding structural breaks; if one component captures inflation well and another captures monetary policy transmission, combining them should theoretically smooth out that discrepancy. Have we considered what happens when the weighting scheme itself needs to adapt dynamically, rather than following a fixed leader? Warren: I think dynamic weighting is the sticking point. If the aggregation method is too rigid, it might just be averaging errors rather than mitigating them. That makes me wonder if the effectiveness of Follow-the-Leader really depends on the quality of the initial model selection we feed into that ensemble process. Iris: And speaking of quality, I was
Episode: Daily Summary for 2026-11-01
November 01, 2026
Episode: How Firms Export: An Assignment Theory of Export Organization
In short: The study models how firms with different manufacturing and commercial capabilities organize exporting through multi-product platforms. It shows that this leads to four distinct exporter types: direct, hybrid, pure intermediary, and indirect exporters. The equilibrium depends on the complementarity between manufacturing skill and commercial skill.
November 01, 2026
Episode: Using Multiple Outcomes to Adjust Standard Errors for Spatial Correlation
November 01, 2026
Episode: Inference with Granular Instruments in Large Panels
November 01, 2026
Episode: From Many Models, One: Macroeconomic Forecasting with Reservoir Ensembles
In short: This study investigates combining multiple Multi-Frequency Echo State Networks (MFESNs) using ensemble learning schemes like Hedge and Follow-the-Leader. The combination significantly improves forecasting performance over single models, with Follow-the-Leader proving most effective. This method offers substantial error reduction, up to 51% for some models, while simplifying the complex hyperparameter tuning process.
November 01, 2026
Episode: Conditional projection methods for large-scale Bayesian VARs
In short: This work develops fast methods for forecasting and structural scenario analysis of large-scale Bayesian Vector Autoregressions (VARs). It uses a factor structure on errors to allow quick, order-invariant estimation across many variables. The method enables researchers to test how different assumptions about the source of economic shocks drastically change counterfactual predictions.
November 01, 2026
Episode: Realized Stochastic Volatility Models with Skew-t Distributions for Volatility and Tail Risk Forecasting
November 01, 2026
Episode: Self-Equivalent Voting Rules
In short: The paper introduces 'self-equivalence,' a stability axiom for stochastic voting rules, meaning a society won't change its rule if it is self-equivalent. Theorem 1 proves that the only rule satisfying anonymity, efficiency, monotonicity, neutrality, and self-equivalence is the uniform random dictatorship. This suggests why societies sometimes switch rules or hold binary elections.
November 01, 2026
Episode: Welfare at Risk: Distributionally Robust Bounds for Policy Evaluation
November 01, 2026
Episode: Algorithmic Attention and Content Creation on Social Media Platforms
In short: The study investigates how social media platforms should allocate user attention between advertising revenue and creator incentives. The optimal strategy involves using attention subsidies discriminatorily based on creator types, leading to specific allocation rules under different information settings. This framework suggests trade-offs between maximizing ad revenue and supporting content production.
November 01, 2026
Episode: The Costs of Early-career Disciplinary Pivots: Evidence from Ph.D. Admissions
In short: The study investigated if switching fields early in a career—specifically during doctoral admissions—imposes a penalty. Researchers found that pivoters face a 1.3 percentage point lower acceptance rate and are less likely to graduate, suggesting substantial costs to entering new disciplines.
November 01, 2026
Episode: The day in conversation for 2026-10-31
October 31, 2026
Episode: Daily Summary for 2026-10-31
October 31, 2026
Episode: Testing for peer effects in short panels without identifying the network structure
In short: The paper proposes an instrument-based test to detect peer effects in short-panel data when the underlying network structure is unknown. The test statistic aggregates pairwise comparisons of covariate-projected outcomes against residualized own outcomes. It provides a robust framework for testing peer effects under various complex modeling conditions, offering reliable inference without requiring prior knowledge of the social network.
October 31, 2026
Episode: Rewarding Noise: Incentives in Decentralized A/B Testing
In short: The paper investigates how testing incentives in decentralized organizations lead to low statistical power and noisy decisions. It shows that when product teams maximize private rewards, they favor many low-precision tests. Switching to a posterior-mean scoring rule removes this reward for noise, leading product teams to focus on fewer, more precise tests of ambitious ideas.
October 31, 2026
Episode: Dynamic Mechanism and Information Design in AI-Agent Environments: A General Analytical Framework
In short: This framework designs optimal mechanisms for AI agents dealing with evolving hidden information and unobservable actions under partial verification. It establishes a dynamic revelation principle, showing how truthful reporting and subsequent obedience can be linked through continuation incentives. The result is a system that quantifies transaction costs related to information, verification, and enforcing hidden actions in complex multi-agent settings.
October 31, 2026
Episode: Rational Learning One Step Off the Path
October 31, 2026
Episode: Recurrent Neural Networks for Forecasting Autoregressive Noncausal Processes
October 31, 2026
Episode: Envy-free, efficient and strategy-proof division of a heterogeneous good between two agents
In short: The study examines dividing a resource [0,1] between two agents with ordinal preferences that are monotonic in quantity. It shows that a rule satisfying Pareto efficiency, envy-freeness, and strategy-proofness cannot exist. Fairness is determined by the agents' 'balanced cuts,' meaning no single rule can guarantee all three properties simultaneously.
October 31, 2026
Episode: Rationalizable Behavior in Matching with Externalities
In short: The paper introduces conjecture-rationalizable stability to handle externalities in matching markets where agents care about others' matches too. This concept always exists and extends Gale-Shapley stability when no externalities are present. It links rationalizability, a logic from game theory, to matching solutions, providing an epistemic foundation based on pairwise rationality.
October 31, 2026
Episode: The Impossibility of a Gerrymander-Proof Representative Democracy
October 31, 2026
Episode: Uniform Inference for Parameters Identified by Conditional Quantile Restrictions
In short: The paper develops methods for uniform inference when testing parameters using conditional quantile restrictions. It shows that penalized statistics converge uniformly to a limiting process plus a deterministic drift term, establishing consistency and providing robust tools for testing parameter restrictions across different quantile indices in complex models.
October 31, 2026
Episode: The day in conversation for 2026-10-30
October 30, 2026
Episode: Daily Summary for 2026-10-30
October 30, 2026
Episode: A polyhedral characterization of worker-quasi-stable matchings
In short: The paper provides a polyhedral characterization of worker-quasi-stable matchings in one-to-one markets by modifying classical stability constraints into a convex polytope. This new formulation is integral, meaning its vertices correspond exactly to worker-quasi-stable matchings. This shows that the geometric tractability of standard stable matching extends to scenarios where only unemployed workers can initiate blocking deviations.
October 30, 2026
Episode: Nonlinear Drivers of Macroeconomic Tail Risk: A Threshold Stochastic Volatility-in-Mean VAR with Regime-Dependent Leverage
In short: The study develops a complex VAR model to understand how macroeconomic shocks affect extreme risks versus average outcomes. It finds that shocks driving the center of predictions do not necessarily drive tail risk, and this relationship changes depending on whether the economy is in a high or low inflation state.
October 30, 2026
Episode: The day in conversation for 2026-10-27
October 29, 2026
Episode: Daily Summary for 2026-10-27
October 29, 2026
Episode: Daily Summary for 2026-10-16
October 29, 2026
Episode: Daily Summary for 2026-10-17
October 29, 2026
Episode: Daily Summary for 2026-10-18
October 29, 2026
Episode: The day in conversation for 2026-10-21
October 29, 2026
Episode: Daily Summary for 2026-10-21
October 29, 2026
Episode: The day in conversation for 2026-10-23
October 29, 2026
Episode: Daily Summary for 2026-10-23
October 29, 2026
Episode: The day in conversation for 2026-10-16
October 28, 2026
Episode: The day in conversation for 2026-10-17
October 28, 2026
Episode: The day in conversation for 2026-10-18
October 28, 2026
Episode: The day in conversation for 2026-10-21
October 28, 2026
Episode: The day in conversation for 2026-10-23
October 28, 2026