We study auction design when parties cannot commit themselves to the mechanism. The seller may change the rules of the game and the buyers choose their outside option at all stages. We assume that the seller has a leading role in equilibrium selection at any stage of the game. Stationary...

Farsighted formulations of coalitional formation, for instance by Harsanyi (1974) and Ray and Vohra (2015), have typically been based on the von Neumann-Morgenstern (1944) stable set. These farsighted stable sets use a notion of indirect dominance in which an outcome can be dominated by a chain...

We study repeated prize allocation problem when the discount factors f the agents are not equal. It is shown that the feasible set of payoffs is not well behaved. In particular, it is not convex as it contains holes and caves. The Pareto frontier is everywhere discontinuous and there is an open...

We consider an n-player bargaining problem where the utility possibility set is compact, convex, and stricly comprehensive. We show that a stationary subgame perfect Nash equilibrium exists, and that, if the Pareto surface is differentiable, all such equilibria converge to the Nash bargaining...

We show that whenever a decision maker reasons about an optimal decision he is able to find one, even with non-transitive preferences. The existence of a reasoning process allows him to strategically manipulate how he reasons. A reasoning strategy that is robust against (finite) deviations is...

We study farsighted stability under the assumption that coalitions may condition actions on the history of the play. vNM stable set over possible play paths is defined with respect to the indirect dominance relation. We show that such dynamic stable set always exists. It is characterized by a...

We provide a simple characterization of the stationary subgame perfect equilibrium of an alternating offers bargaining game when the number of players increases without a limit. Core convergence literature is emulated by increasing the number of players by replication. The limit allocation is...

We study a dynamic vNM stable set in a compact metric space under the assumption of complete and continuous dominance relation. Internal and external stability are defined with respect to farsighted dominance. Stability of an outcome is conditioned on the history via which it is reached. A...

This paper studies allocations that can be implemented by an arbitrator subject to the constraint that the agents' outside option is to start bargaining by themselves. As the population becomes large, the set of implementable allocations shrinks to a singleton point - the conflict-free...

We study auction design when parties cannot commit to the mechanism. The seller may change the rules of the game any number of times and the buyers may choose their outside option at any stage of the game. A dynamic consistency condition and an optimality condition property are defined to...