My dissertation consists of two papers covering distinct topics within Microeconomic Theory. The first chapter is drawn from Matching Theory. One of the oldest but least understood matching problems is Gale and Shapley’s (1962) “roommates problem”: is there a stable way to assign 2N students into N roommate pairs? Unlike the classic marriage problem or college admissions problem…
Author: Morrill, Thayer
Source: University of Maryland
Download Link: Click Here To Download This Report (PDF)
Reference URL 1: Visit Now
Reference URL 2: Visit Now
Contents
1 Introduction
2 The Roommates Problem Revisited
2.1 Introduction
2.2 The Roommates Problem Revisited
2.3 The Roommate Swap Algorithm
2.4 Strategic Implications
2.5 Extensions and Modeling Issues
2.5.1 Extensions to the Model
2.5.2 Alternative Equilibrium Concepts
2.6 Conclusion
2.7 Appendix
2.7.1 Computational Complexity
3 Externalities in Networks
3.1 Introduction
3.2 Graph Theory Terminology
3.3 Degree Based Utility Functions
3.3.1 Pairwise Stability
3.3.2 Equilibrium with Transfers
3.4 A Reduced Form Utility Model
3.5 Conclusion
3.6 Appendix – Proofs
Bibliography