Abstract: This paper studies a class of NTU coalition formation games in which every player’s payoff depends only on the members of her coalition. We identify four natural conditions on individuals’ preferences and show that, under each condition, stable (core) allocations exists.

Abstract: This paper models a contractual process by a sequential mechanism, which mimics matching procedures for many-to-one real-life matching problems. In this framework, we provide a family of mechanisms implementing the student-optimal matching in Subgame Perfect Equilibrium (SPE).

Abstract: This paper analyzes simple mechanisms implementing (subselections of) the core correspondence of matching markets. We provide a sequential mechanism which mimics a matching procedure for many-to-one real life matching markets. We show that only core allocations should be attained when agents act strategically when faced with this mechanism. We also provide a second mechanism to implement the core correspondence in Subgame Perfect Equilibrium.

Abstract: We implement the stable correspondence of a job matching market in Subgame Perfect Equilibrium. We use a simple sequential mechanism in which firms propose a salary to each worker (first stage) and, then, each worker accepts at most one proposal (second stage). Moreover, if agents' preferences are additive, this mechanism implements in Subgame Perfect Equilibrium the firms' optimal corre- spondence when firms use undominated strategies. Finally, we construct another simple sequential mechanism where the order of decisions is permuted and which implements the workers' optimal correspondence when agents' preferences are additive.