The Nash program is an important research agenda initiated in Nash (Econometrica 21:128-140, 1953) in order to bridge the gap between the noncooperative and cooperative counterparts of game theory. The program is thus turning sixty-seven years old, but I will argue it is not ready for...

The value is a solution concept for n-person strategic games, developed by Nash, Shapley, and Harsanyi. The value of a game is an a priori evaluation of the economic worth of the position of each player, reflecting the players' strategic possibilities, including their ability to make threats...

Strategy‐proofness (SP) is a sought‐after property in social choice functions because it ensures that agents have no incentive to misrepresent their private information at both the interim and ex post stages. Group strategy‐proofness (GSP), however, is a notion that is applied to the ex...

This paper studies bargaining outcomes in economies in which agents may be able to impose outcomes that deviate from the relevant social norms but incur costs when they do so. It characterizes bargaining outcomes that are easiest for a society to sustain as part of a social norm that everybody...

Why do some incomplete information markets feature intermediaries while others do not? I study the allocation of two goods in an incomplete information setting with a single principal, multiple agents with unit demand, and interdependent valuations. I construct a novel dynamic mechanism...

We generalize the disutility of effort function in the linear-Constant Absolute Risk Aversion (CARA) puremoral hazardmodel.We assume that agents are heterogeneous in ability. Each agent's ability is observable and treated as a parameter that indexes the disutility of effort associated with the...

We prove that in a market where agents rank objects independently and uniformly at random, there exists an assignment of objects to agents with a constant average rank (i.e., an average rank independent of the market size). The proof builds on techniques from random graph theory and the FKG...

This paper develops a dynamic model of tender offers in which there is trading on the target's shares during the takeover, and bidders can freeze out target shareholders (compulsorily acquire remaining shares not tendered at the bid price), features that prevail on almost all takeovers. We show...

We revisit the classical object reallocation problem under strict preferences. When attention is constrained to the set of Pareto-efficient rules, it is known that top trading cycles (TTC) is the only rule that is strategy-proof and individually rational. We relax this constraint and consider...

Efficiency Adjusted Deferred Acceptance Rule (EDA) is a promising candidate mechanism for a public school assignment. A potential drawback of EDA is that it could encourage students to game the system since it is not strategy-proof. However, to successfully strategize, students typically need...