$u^* = \sqrt{uv}$
This paper aims to compute the unemployment rate $u^*$ that is consistent with full employment in the United States. First, it argues that the most appropriate economic translation of the legal notion of full employment is social efficiency. Here efficiency requires to minimize the nonproductive use of labor -- both unemployment and recruiting. The nonproductive use of labor is measured by the number of jobseekers and vacancies, $u + v$. Through the Beveridge curve, the numbers of vacancies and jobseekers are inversely related, $uv = \text{constant}$. With such symmetry the labor market is efficient when there are as many jobseekers as vacancies ($u = v$), inefficiently tight when there are more vacancies than jobseekers ($v > u$), and inefficiently slack when there are more jobseekers than vacancies ($u > v$). Accordingly, the full-employment rate of unemployment (FERU) is the geometric average of the unemployment and vacancy rates: $u^* = \sqrt{uv}$. Between 1930 and 2023, the FERU averages $4.1\%$ and is quite stable -- it always remains between $2.5\%$ and $6.6\%$.
Code (1)
Similar Papers 제목 키워드 기반
How Does Variance Shape the Regret in Contextual Bandits?
We consider realizable contextual bandits with general function approximation, investigating how small reward variance can lead to better-than-minimax regret bounds. Unlike in minimax bounds, we show that the eluder dime…
Multi-Armed BanditsBanker Online Mirror Descent: A Universal Approach for Delayed Online Bandit Learning
We propose Banker Online Mirror Descent (Banker-OMD), a novel framework generalizing the classical Online Mirror Descent (OMD) technique in the online learning literature. The Banker-OMD framework almost completely decou…
Multi-Armed BanditsOn the Approximation of Cooperative Heterogeneous Multi-Agent Reinforcement Learning (MARL) using Mean Field Control (MFC)
Mean field control (MFC) is an effective way to mitigate the curse of dimensionality of cooperative multi-agent reinforcement learning (MARL) problems. This work considers a collection of $N_{\mathrm{pop}}$ heterogeneous…
Multi-agent Reinforcement LearningNear-Optimal Convergence of Accelerated Gradient Methods under Generalized and $(L_0, L_1)$-Smoothness
We study first-order methods for convex optimization problems with functions $f$ satisfying the recently proposed $\ell$-smoothness condition $||\nabla^{2}f(x)|| \le \ell\left(||\nabla f(x)||\right),$ which generalizes t…
Regret Bounds for Adversarial Contextual Bandits with General Function Approximation and Delayed Feedback
We present regret minimization algorithms for the contextual multi-armed bandit (CMAB) problem over $K$ actions in the presence of delayed feedback, a scenario where loss observations arrive with delays chosen by an adve…