2025 Zayira Ray
Julius Silver Professor, Faculty of Arts and Science,
Professor of Economics, New York University
Research Associate, NBER
Part-Time Professor, University of Warwick
Research Fellow, CESifo
Spool Member, ThReD

Department of Economics
New York University,
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

Nash Bargaining in Coalitional Games

(with Rajiv Vohra). April 2025. Supplementary Notes.

Summary. We revisit Nash’s axiomatic approach to bargaining when both individuals and coalitions of individuals have outside options. As in Nash, our solution maximizes a (possibly weighted) product of payoffs net of individual disagreements, but coalitional threats appear as conventional constraints that are not netted out. We embed this solution into a setting with cross-coalitional externalities, and develop a “Nash-in-Nash” theory of viable coalitional structures. Every coalition follows its coalitional Nash solution but interacts noncooperatively with other coalitions, leading to a recursive determination of both threats and solutions. We discuss applications to public goods provision, R&D coalitions, and cartels in oligopolistic competition. Finally, for transferable utility characteristic functions, we connect the coalitional Nash solution to a notion of “pragmatic egalitarianism.”

Evolving Aspirations and Cooperation

(with Rajeeva Karandikar,  Dilip Mookherjee, and Fernando Vega-Redondo), Journal of Economic Theory 80, 292-331, 1998.

Summary. A 2×2 game is played repeatedly by two satisficing players. The game considered includes the Prisoner’s Dilemma, as well as games of coordination and common interest. Each player has an aspiration at each date, and takes an action. The action is switched at the subsequent period only if the achieved payoff falls below aspirations; the switching probability depends on the shortfall. Aspirations are periodically updated according to payoff experience, but are occasionally subject to trembles. For sufficiently slow updating of aspirations and small tremble probability, it is shown that both players must ultimately cooperate most of the time.

Inequality and Inefficiency in Joint Projects

(with Jean-Marie Baland and Olivier Dagnelie), Economic Journal 117, 922-935, 2007.

SummaryA group of agents voluntarily participates in a joint project, in which efforts are not perfectly substitutable. The output is divided according to some given vector of shares. A share vector is unimprovable if no other share vector yields a higher sum of payoffs. We describe unimprovable share vectors.