Adjusting to Trade Opening: The Case of Labor Share in India\u27s Manufacturing Industry

The objective of this paper is to study how manufacturing plants in India adjusted to trade liberalization during the period 1998–99 to 2007–08. We estimate how the labor share changed due to tariff reduction. Our results indicate that a decline in output tariffs led to an increase in the labor share of income. In contrast, a fall in input tariffs led to a decrease in the labor share. Controlling for factor intensity, we find that in technology intensive and human capital resource intensive sectors, both a decline in input and output tariff rates led to a decline in labor share. A fall in tariffs only led to an increase in labor share for labor intensive and low-technology plants. Hence, India’s bias towards capital and technology intensive production explains the overall decline in labor share in the post reform period. Furthermore, the empirical results show that labor adjustment occurred more efficiently in Indian states with flexible labor laws

Education and the Pandemic: Engaging in Epistemic Humility to Question Assumptions, Institutions, and Knowledges

Education systems are the formal institutionalisations of the knowledges and values our societies privilege, who they privilege, how, and on what terms. They are imbued with assumptions. These assumptions inform how systems are structured. The pandemic has exposed existing global and local inequalities, non-binary dynamics of inclusion and exclusion, and dysfunctions of education systems. This paper argues that the global scale and severity of the education disruption challenges taken-for-granted distinctions that privilege systems of the ‘West’ as referential for ‘the Rest’. It argues that the existing overarching technicist knowledge regime is inadequate for recovery, and proposes an alternative approach

The Non-Uniform k-Center Problem

In this paper, we introduce and study the Non-Uniform k-Center problem (NUkC). Given a finite metric space $(X,d)$ and a collection of balls of radii $\{r_1\geq \cdots \ge r_k\}$, the NUkC problem is to find a placement of their centers on the metric space and find the minimum dilation $\alpha$, such that the union of balls of radius $\alpha\cdot r_i$ around the $i$th center covers all the points in $X$. This problem naturally arises as a min-max vehicle routing problem with fleets of different speeds. The NUkC problem generalizes the classic $k$-center problem when all the $k$ radii are the same (which can be assumed to be $1$ after scaling). It also generalizes the $k$-center with outliers (kCwO) problem when there are $k$ balls of radius $1$ and $\ell$ balls of radius $0$. There are $2$-approximation and $3$-approximation algorithms known for these problems respectively; the former is best possible unless P=NP and the latter remains unimproved for 15 years. We first observe that no $O(1)$-approximation is to the optimal dilation is possible unless P=NP, implying that the NUkC problem is more non-trivial than the above two problems. Our main algorithmic result is an $(O(1),O(1))$-bi-criteria approximation result: we give an $O(1)$-approximation to the optimal dilation, however, we may open $\Theta(1)$ centers of each radii. Our techniques also allow us to prove a simple (uni-criteria), optimal $2$-approximation to the kCwO problem improving upon the long-standing $3$-factor. Our main technical contribution is a connection between the NUkC problem and the so-called firefighter problems on trees which have been studied recently in the TCS community.Comment: Adjusted the figur