SearcharxivSearch

arXiv subjects

George Miller

Publications and source records attributed to George Miller.

2 recordsLinked to original sources

Hiring Discrimination and the Task Content of Jobs: Evidence from a Large-Scale Resume Audit

We conducted a large-scale resume audit of 36,880 applications to 9,220 job advertisements for new college graduates across the United States. Firms express task preferences through job-advertisement text, which we link to occupation-level task measures from O*NET and the American Community Survey. We develop a model in which discrimination increases with evaluative discretion, defined as the share of hiring decisions driven by subjective rather than verifiable assessment. Callback gaps vary systematically with the task content of jobs. In management occupations, callbacks are 28 to 43 percent lower for Black men, Black women, White women, and Hispanic men than for otherwise identical White men. Broad occupation categories conceal important variation in task demands. When jobs are grouped by task intensity, discrimination concentrates in positions combining high analytical and interpersonal demands with low routine content. Decomposing task content into subjective-evaluation and objective-precision components, we find that subjective evaluation widens callback gaps while objective precision compresses them. Customer contact amplifies this divergence, widening gaps in non-routine jobs but not in routine jobs. Randomly assigned resume credentials that increase callbacks on average reduce gaps in low-discretion jobs but not in high-discretion jobs. Early-career exclusion from high-return task bundles may entrench long-run demographic gaps in employment outcomes.

econ.GN

On the Ohba Number and Generalized Ohba Numbers of Complete Bipartite Graphs

We say that a graph $G$ is chromatic-choosable when its list chromatic number $\chi_{\ell}(G)$ is equal to its chromatic number $\chi(G)$. Chromatic-choosability is a well-studied topic, and in fact, some of the most famous results and conjectures related to list coloring involve chromatic-choosability. In 2002 Ohba showed that for any graph $G$ there is an $N \in \mathbb{N}$ such that the join of $G$ and a complete graph on at least $N$ vertices is chromatic-choosable. The Ohba number of $G$ is the smallest such $N$. In 2014, Noel suggested studying the Ohba number, $\tau_{0}(a,b)$, of complete bipartite graphs with partite sets of size $a$ and $b$. In this paper we improve a 2009 result of Allagan by showing that $\tau_{0}(2,b) = \lfloor \sqrt{b} \rfloor - 1$ for all $b \geq 2$, and we show that for $a \geq 2$, $\tau_{0}(a,b) = \Omega( \sqrt{b} )$ as $b \rightarrow \infty$. We also initiate the study of some relaxed versions of the Ohba number of a graph which we call generalized Ohba numbers. We present some upper and lower bounds of generalized Ohba numbers of complete bipartite graphs while also posing some questions.

math.CO