Dynamic Models of Reputation and Competition in Job-Market Matching

A fundamental decision faced by a firm hiring employees --- and a familiar one to anyone who has dealt with the academic job market, for example --- is deciding what caliber of candidates to pursue. Should the firm try to increase its reputation by making offers to higher-quality candidates, despite the risk that the candidates might reject the offers and leave the firm empty-handed? Or is it better to play it safe and go for weaker candidates who are more likely to accept the offer? The question acquires an added level of complexity once we take into account the effect one hiring cycle has on the next: hiring better employees in the current cycle increases the firm's reputation, which in turn increases its attractiveness for higher-quality candidates in the next hiring cycle. These considerations introduce an interesting temporal dynamic aspect to the rich line of research on matching models for job markets, in which long-range planning and evolving reputational effects enter into the strategic decisions made by competing firms. The full set of ingredients in such recruiting decisions is complex, and this has made it difficult to model the fundamental strategic tension at the core of the problem. Here we develop a model based on two competing firms to try capturing as cleanly as possible the elements that we believe constitute this strategic tension: the trade-off between short-term recruiting success and long-range reputation-building; the inefficiency that results from underemployment of people who are not ranked highest; and the influence of earlier accidental outcomes on long-term reputations. Our model exhibits all these phenomena in a stylized setting, governed by a parameter $q$ that captures the difference in strength between the top candidate in each hiring cycle and the next best. Building on an economic model of competition between parties of unequal strength, we show that when $q$ is relatively low, the efficiency of the job market is improved by long-range reputational effects, but when $q$ is relatively high, taking future reputations into account can sometimes reduce the efficiency. While this trade-off arises naturally in the model, the multi-period nature of the strategic reasoning it induces adds new sources of complexity, and our analysis reveals interesting connections between competition with evolving reputations and the the dynamics of urn processes.

[1]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[2]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[3]  Mark S. Granovetter Getting a Job: A Study of Contacts and Careers , 1974 .

[4]  D. Berry,et al.  Bernoulli One-Armed Bandits--Arbitrary Discount Sequences , 1979 .

[5]  V. Krishna,et al.  Dynamic Duopoly: Prices and Quantities , 1987 .

[6]  Alvin E. Roth,et al.  Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis , 1990 .

[7]  J. Coleman Matching Processes in the Labor Market , 1991 .

[8]  P. Klemperer,et al.  Multi-Period Competition with Switching Costs , 1992 .

[9]  A. J. Padilla,et al.  Revisiting Dynamic Duopoly with Consumer Switching Costs , 1995 .

[10]  K. Hamza The smallest uniform upper bound on the distance between the mean and the median of the binomial and Poisson distributions , 1995 .

[11]  S. Skaperdas Contest success functions , 1996 .

[12]  Dale T. Mortensen,et al.  Chapter 39 New developments in models of search in the labor market , 1999 .

[13]  Lones Smith,et al.  Assortative Matching and Search , 2000 .

[14]  G. Tullock Efficient Rent Seeking , 2001 .

[15]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[16]  Randall Wright,et al.  Search-Theoretic Models of the Labor Market: A Survey , 2002 .

[17]  Alan M. Frieze,et al.  Balls and bins models with feedback , 2002, SODA '02.

[18]  Michael Mitzenmacher,et al.  A Brief History of Generative Models for Power Law and Lognormal Distributions , 2004, Internet Math..

[19]  D. Cable,et al.  Firm reputation and applicant pool characteristics , 2003 .

[20]  Xavier Vives,et al.  Strategic incentives in dynamic duopoly , 2004, J. Econ. Theory.

[21]  A. Shleifer,et al.  Coarse Thinking and Persuasion , 2006 .

[22]  Nicole Immorlica,et al.  Secretary Problems with Competing Employers , 2006, WINE.

[23]  A survey of random processes with reinforcement , 2007, math/0610076.

[24]  Sergei Vassilvitskii,et al.  The hiring problem and Lake Wobegon strategies , 2008, SODA '08.

[25]  U. Doraszelski,et al.  Avoiding market dominance: product compatibility in markets with network effects , 2009 .

[26]  Sujit Gujar,et al.  Tolerable Manipulability in Dynamic Assignment without Money , 2010, AAAI.

[27]  Adam Tauman Kalai,et al.  Dueling algorithms , 2011, STOC '11.

[28]  Guillaume Haeringer,et al.  Decentralized job matching , 2011, Int. J. Game Theory.

[29]  Lauren A. Rivera,et al.  Hiring as Cultural Matching , 2012 .

[30]  Ariel D. Procaccia,et al.  Dynamic Matching via Weighted Myopia with Application to Kidney Exchange , 2012, AAAI.