We propose positive and normative foundations for the average prekernel of NTU games, and compare them with the existing ones for the prekernel. In our non-cooperative analysis, the average prekernel is understood as the equilibrium payoffs of a game where each player faces the possibility of...

We extend Nash's bargaining theory to non-convex and coalitional problems. This paper investigates the implications of Nash-like axioms for bilateral problems and the properties of consistency and converse consistency over multilateral settings. The result is a characterization of the Nash set...

One of the many important contributions in David Schmeidler's distinguished career was the introduction of the nucleolus. This paper is an update on the nucleolus and its two related supersolutions, i.e., the kernel and the bargaining set.

Samuelson's (1938) weak (generalized) axiom of revealed preference- WGARP-is a minimal and appealing consistency condition of choice. We offer a rationalization of WGARP in general settings. Our main result is an exact analog of the celebrated Afriat's theorem, but for WGARP. Its ordinal...

The Slutsky matrix function encodes all the information about local variations in demand with respect to small (Slutsky) compensated price changes. When the demand function is the result of utility maximization the Slutsky matrix is symmetric. However, symmetry does not imply rationality. Here,...

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...

Restricting attention to economic environments, we study implementation under perturbed better-response dynamics (BRD). A social choice function (SCF) is implementable in stochastically stable strategies of perturbed BRD whenever the only outcome supported by the stochastically stable strategies...

Watson (2002) proposes non-forcing contracts as a way to show the limitations of the mechanism design program with ex-post renegotiation (Maskin and Moore (1999)). If one takes a partial implementation approach, as Watson does, we show that non-forcing contracts do not constitute an intermediate...

We provide a characterization of virtual Bayesian implementation in pure strategies for environments satisfying no-total-indifference. A social choice function in such environments is virtually Bayesian implementable if and only if it satisfies incentive compatibility and a condition we term...

In this short paper we provide two versions of Arrow’s impossibility theorem, in a world with only one preference profile. Both versions are extremely simple and allow a transparent understanding of Arrow’s theorem. The first version assumes a two-agent society; the second version, which is...