Title of dissertation: TOPICS IN MARKET DESIGN

[1]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[2]  J. Montgomery.  Social Networks and Labor-Market Outcomes: Toward an Economic Analysis , 1991 .

[3]  L. Shapley,et al.  College Admissions and the Stability of Marriage , 1962 .

[4]  S. Currarini.  Stable Organizations with Externalities , 2002 .

[5]  Sanjeev Goyal,et al.  A Noncooperative Model of Network Formation , 2000 .

[6]  Matthew O. Jackson,et al.  The Formation of Networks with Transfers Among Players , 2004, J. Econ. Theory.

[7]  Mark S. Granovetter.  The Strength of Weak Ties , 1973, American Journal of Sociology.

[8]  M. Jackson.  A Survey of Models of Network Formation: Stability and Efficiency , 2003 .

[9]  Mark S. Granovetter.  Getting a Job: A Study of Contacts and Careers , 1974 .

[10]  Robert W. Irving,et al.  The Stable marriage problem - structure and algorithms , 1989, Foundations of computing series.

[11]  Alvin E. Roth,et al.  Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis , 1990 .

[12]  M. Jackson,et al.  A Strategic Model of Social and Economic Networks , 1996 .

[13]  Atila Abdulkadiroglu,et al.  RANDOM SERIAL DICTATORSHIP AND THE CORE FROM RANDOM ENDOWMENTS IN HOUSE ALLOCATION PROBLEMS , 1998 .

[14]  Jimmy J. M. Tan.  A Necessary and Sufficient Condition for the Existence of a Complete Stable Matching , 1991, J. Algorithms.

[15]  D. West.  Introduction to Graph Theory , 1995 .

[16]  R. Kranton,et al.  A Theory of Buyer-Seller Networks , 2001 .

[17]  L. Shapley,et al.  On cores and indivisibility , 1974 .

[18]  Kim-Sau Chung,et al.  On the Existence of Stable Roommate Matchings , 2000, Games Econ. Behav..