Instability of Decentralized Assignment

Abstract

I am doing this project on research of the instability of decentralized assignments. This thesis is intended to summarize the theory of stable marriages and stable assignments; by the study of decentralized search in the marriage game, to find out an analogous method for search in the assignment game. The background of this thesis is the 2012 Nobel Prize in economics for the theory of stable allocations. In this thesis, there are two main sections: marriage game and assignment game. In the marriage game, I am trying to analyze the measure of instability of matchings by introducing some important concepts and a representative heuristic. To address this question in the assignment game, I will propose an analogous heuristic to investigate the existence of stable outcomes.