Searcharxiv⌕ Search

arXiv · 2610.34508

Screening AI-equipped applicants

Abstract

Generative AI can lower the cost of producing polished application materials without improving applicants' abilities to do the job. We study an employer who observes qualifications and work history, summarized by observable quality, but must infer other job-relevant attributes from reports that applicants can manipulate at costs that depend on privately known manipulation ability. The employer commits to a hiring rule under a capacity constraint, and we evaluate rules by match value net of applicants' manipulation costs. We show that, as manipulation ability becomes increasingly dispersed among applicants with the same observable quality, socially optimal hiring converges to selection on observable quality alone, a phenomenon we call strategic feature collapse. To capture the remaining welfare gain from reports, we construct a simple dual-track mechanism that directly admits applicants with high observable quality and offers some otherwise excluded applicants a report-based route to admission. Despite the complexity of multidimensional screening, this mechanism is asymptotically optimal under additional regularity, matching the unrestricted optimum's welfare gain from reports through second order.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pengyu Qian, Sophie H. Yu. 2026-10-25. Screening AI-equipped applicants. https://arxiv.org/abs/2610.34508

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A Comparison of Cursed Sequential Equilibrium and Sequential Cursed Equilibrium: Different Concepts of Cursedness in Dynamic Games

Cursed Equilibrium of Eyster and Rabin (2005) has been a leading theory for explaining winner's-curse-type behavior in static Bayesian games, but it faces conceptual limitations when applied to dynamic games. Two recent extensions, Cursed Sequential Equilibrium (CSE) by Fong, Lin and Palfrey (2025) and Sequential Cursed Equilibrium (SCE) by Cohen and Li (2026), address these limitations in fundamentally different ways. Complementing these two papers, this paper provides a systematic comparison of CSE and SCE, clarifying their conceptual foundations and technical implications, including their notions of cursedness, belief updating, treatment of public histories, and relationship to cursed equilibrium in one-stage Bayesian games.

econ.TH↗

Breaking Ties among Equals: Serial and Sequential Dictatorships in House Allocation

We study the deterministic allocation of indivisible objects to agents under unit demand and strict preferences, without monetary transfers. When every agent must receive an object, two agents who report identical preferences cannot be treated equally, so every mechanism embodies a rule for breaking such ties. We introduce two invariance requirements on this rule. Fair treatment of equals requires the favored member of every preference-identical pair to be the same at all profiles; the weaker pairwise tie-breaking allows the favored member to depend on the reports of the other agents but not on the pair's common report. Combined with non-wastefulness and strategy-proofness, (i) fair treatment of equals characterizes the serial dictatorships, (ii) pairwise tie-breaking and non-bossiness characterize the sequential dictatorships, and (iii) pairwise tie-breaking and the identical-preference lower bound---which compares each agent's assignment with her outcome when everyone shares her ranking---characterize the serial dictatorships once again. When agents may remain unassigned, the first two characterizations extend upon adding individual rationality, but the identical-preference lower bound no longer forces a fixed order. Among sequential dictatorships, the identical-preference lower bound is equivalent to boundedness: there is a priority whose $k$th-ranked agent is called after at most $k-1$ real objects have been assigned.

econ.TH↗

The pursuit of happiness

This paper studies populations of individuals -- that we call homo-felix -- who maximise an objective function that we call happiness. The happiness of one individual depends on the payoffs that they receive in games they play with their peers as well as on the happiness of the peers they interact with, and on their status. Individuals care more or less about others depending on whether that makes them more or less happy. This paper analyses the ``happiness feedback loops'' that result from these interactions in simple settings. We find that individuals revise their other-regarding attitudes in terms of relative comparisons. In particular, individuals tend to care more about individuals who are happier than them, while spiteful behavior may emerge only under poor socio-economic conditions and is directed towards the worst off individuals. Such general results are illustrated by studying simple 2 x 2 games, where we find that homo-felix can converge to a variety of equilibria which includes but goes beyond Nash equilibria, and in an $n$-persons public good game.

econ.TH↗