In this paper, we establish sufficient conditions on the domain of preferences and agents' behavior in order to characterize the existence of stable assignments in many-to-one matching problems with externalities. The set of stable matchings depends on what agents believe other agents will do if...

In this paper, we establish sufficient conditions on the domain of preferences and agents' behavior in order to characterize the existence of stable assignments in many-to-one matching problems with externalities. The set of stable matchings depends on what agents believe other agents will do if...

We propose a general framework for the analysis of dynamic optimization with risk- averse agents, extending WhittleÕs (Whittle, 1990) formulation of risk-sensitive optimal control problems to accommodate time-discounting. We show how, within a Markovian set-up, optimal risk-averse behavior is...