We consider the general many-to-one matching model with ordinal preferences and give a procedure to partition the set … of preference profiles into subsets with the property that all preference profiles in the same subset have the same Core … generate as strict extensions all the (complete) preference profiles with the same Core. This is important for applications …

exists and is unique. It belongs to the bargaining set and to the core whenever the latter is not empty. In fact, when the …

order is specified. We associate cooperative games with these sequencing situations, study their core, and provide links …

We prove the non-emptiness of the core of an NTU game satisfying a condition of payoff-dependent balancedness, based on … transfer rate mappings. We also define a new equilibrium condition on transfer rates and we prove the existence of core payoff … vectors satisfying this condition. The additional requirement of transfer rate equilibrium refines the core concept and allows …

-wise stability and Core. We first establish that the Set-wise stable set is contained in the Core and it contains the non-empty set … competitive equilibrium payoffs. Third, for any number of replicas there is a market with a Core payoff that is not a competitive …

We extend Jackson and Watts's (2002) result on the coincidence of S-stochastically stable and core stable networks from … marriage problems to roommate problems. In particular, we show that the existence of a side-optimal core stable network, on …

assignment game. We consider the Core, three other notions of group stability and two al- ternative definitions of competitive … equilibrium. We show that (i) each group stable set is closely related with the Core of certain games defined using a proper …

In this paper we answer a question posed by Sertel and Sanver (2002) on the manipulability of optimal matching rules in … matching problems with endowments. We characterize the classes of consumption rules under which optimal matching rules can be …