Julius Silver Professor, Faculty of Arts and Science, and
Professor of Economics, New York University
Research Associate, NBER
Part-Time Professor, University of Warwick
Council Member, Game Theory Society
Research Fellow, CESifo
Board Member, BREAD and ThReD
Researcher in Residence, ESOP

Department of Economics, NYU, 19 West 4th Street
New York, NY 10012, U.S.A.
debraj.ray@nyu.edu, +1 (212)-998-8906.

Or use navbar and search icon at the top of this page to look for specific research areas and papers.
Oxford University Press, 2008. This book is now open-access; feel free to download a copy, and to buy the print version if you like the book.
≋ Three Randomly Selected Papers
Re-randomize

Certified Random: A New Order for Co-Authorship

(with Arthur Robson), American Economic Review 108, 489–520 (2018).

Summary. Certified random order (a) distributes the gain from first authorship evenly over the alphabet, (b) allows either author to signal when contributions are extremely unequal, (c) will invade an environment where alphabetical order is dominant, (d) is robust to deviations, (e) may be ex-ante more efficient than alphabetical order, and (f) is no more complex than the existing alphabetical system modified by occasional reversal of name order.

Economic Growth With Intergenerational Altruism

(with Doug Bernheim), Review of Economic Studies 54, 227-243, 1987.

Summary. We consider the properties of equilibrium behavior in an aggregative growth model with intergenerational altruism. Various positive properties such as the cyclicity of equilibrium programs, and the convergence of equilibrium stocks to a steady state, are analyzed. Among other normative properties, it is established that under certain natural conditions, Nash equilibrium programs are efficient and “modified Pareto optimal”, in a sense made clear in the paper, but never Pareto optimal in the traditional sense.

Internally-Negotiation-Proof Equilibrium Sets: Limit Behavior for Low Discounting

Games and Economic Behavior 6, 162-177, 1994.

Summary. Recent literature in the theory of dynamic games addresses renegotiatioin-proof equilibria, For repeated games, I analyze the limit of renegotiation-proof equilibrium sets as discounting vanishes. The main result states that such limit sets must either be singletons or belong to the Pareto frontier of the convex hull of the feasible set of the stage game payoffs.