Tayfun Sönmez

Tayfun Sönmez is a Turkish-American professor of economics at Boston College. He is a Fellow of the Econometric Society[1] and the 2008 winner of the Social Choice and Welfare Prize, which honors scholars under the age of 40 for excellent accomplishment in the area of social choice theory and welfare economics.[2] Sönmez has made significant contributions in the areas of microeconomic theory, mechanism/market design, and game theory. His work has been featured by the U.S. National Science Foundation for its practical relevance.[3]

Tayfun Sönmez
Born
Tayfun Sönmez

Turkey
NationalityTurkish/United States
CitizenshipTurkish-American
InstitutionBoston College
FieldGame theory, market design, microeconomic theory
Alma materBilkent University
University of Rochester
Doctoral
advisor		William Thomson
ContributionsMarket design
AwardsSocial Choice and Welfare Prize (2008)
Information at IDEAS / RePEc
Websitewww2.bc.edu/~sonmezt/

Work

Sönmez's early work studied the mathematical properties of allocation systems without transfers. His PhD dissertation established the relationship between the core and strategy-proof mechanisms.[4] He was awarded University of Rochester's Conibear Prize as a graduate student for the best third-year paper.[5] Following his first job at the University of Michigan, Sönmez identified a connection between the housing market model of Lloyd Shapley and Herbert Scarf and the house allocation model of Hylland and Richard Zeckhauser in a 1999 paper on "House Allocation with Existing Tenants.[6]

Student Assignment and School Choice

Sönmez's work involves a mix of theoretical and applied topics. He launched a research program studying the mechanism design aspects of student assignment systems. His 1999 article with Michel Balinski analyzes the connection between David Gale and Lloyd Shapley's college admissions model and priority based resource allocation problems.[7] A subsequent paper with Atila Abdulkadiroglu defines the school choice problem and documents how many U.S. cities are using assignment mechanisms with undesirable properties.[8] This paper has since become his most widely cited work.[9] Sönmez's interest in policy issues developed from his initial academic work on school choice. A 2003 Boston Globe article "School assignment flaws detailed: Two economists study problem, offer relief" described the failings of the mechanism to the general public and lead to his involvement in changing the mechanism.[10] Working together with Atila Abdulkadiroglu, Parag Pathak and Alvin E. Roth, the team of economists identified parents in Boston who developed heuristics on how to play this real-world game so that their children would not be unassigned, leaving those unaware of these features disadvantaged.[11] The policy change was the first time an incentive compatible strategyproof mechanism, based on an abstract concept from mechanism design, played a role in a public policy discussion.[12] Beginning in 2003, Boston held city-wide discussions and hearings on the school selection system and finally in 2005 narrowed the choice to one of two mechanisms initially proposed by Abdulkadiroglu and Sönmez: the top trading cycles mechanism for schools and the student-optimal stable mechanism based on the stable marriage problem. Eventually, Boston adopted the student-optimal stable mechanism.

Since then, a number of other districts have abandoned Boston's old mechanism. In 2007, through an act of Parliament, British authorities outlawed the use of First Preference First arrangements, which made Boston's old method of school assignment illegal throughout 150 English districts.[13] Sönmez continues to be involved with the Boston school choice plan, including the most recent changes to the school choice plan in 2013.[14]

Centralized Kidney Exchange

Sönmez was a founder of the New England Program for Kidney Exchange along with Alvin E. Roth and Utku Unver.[15] The program was initially designed to operate primarily through the use of two pairs of incompatible donors. Each donor was incompatible with her partner but could be compatible with another donor who was likewise incompatible with his partner, allowing for trade. Because the National Organ Transplant Act of 1984 forbids the creation of binding contracts for organ transplant, the procedure had to be performed roughly simultaneously. Two pairs of patients means four operating rooms and four surgical teams acting in concert with each other. Hospitals and professionals in the transplant community initially felt that the practical burden of allowing three pairwise exchanges would be too large. However research by Roth, Sönmez, and Unver revealed that the efficiency loss from the lack of three pair exchanges are considerable. [16] As a result, various kidney exchange programs today utilize three pair exchanges in addition to two pair exchanges. A 12-party (six donors and six recipients) kidney exchange was performed in April 2008.[17] Nancy Lutz, program director for the Social and Economic Sciences (SES) Division of NSF's Directorate for Social, Behavioral and Economic Sciences remarked "it's especially rewarding to see such a clear and immediate benefit to the public. This research moved from abstract, academic theory to real world, direct impact very quickly."[18]

gollark: sin = 1.
gollark: Is this an array language?
gollark: That sounds noncommunistic and also bad.
gollark: 1.00003.
gollark: Current ones have to coördinate at much larger scale though.

References
  1. "Fellows of the Econometric Society". Archived from the original on 2008-12-10.
  2. "The Society for Social Choice and Welfare".
  3. "Kidney Exchange: A Life-Saving Application of Matching Theory". National Science Foundation.
  4. Sonmez, Tayfun (May 1999). "Strategy-proofness and Essentially Single Valued Cores". Econometrica. 67 (3): 677–89. doi:10.1111/1468-0262.00044.
  5. "The Conibear Prize: Department of Economics, University of Rochester". Archived from the original on 2013-11-02. Retrieved 2013-09-01.
  6. Sonmez, Tayfun; Abdulkadiroglu, Atila (1999). "House Allocation with Existing Tenants" (PDF). Journal of Economic Theory. 88 (2): 233–60. doi:10.1006/jeth.1999.2553.
  7. Sonmez, Tayfun; Balinski, Michelle (1999). "A Tale of Two Mechanisms: Student Placement" (PDF). Journal of Economic Theory. 84: 73–94. doi:10.1006/jeth.1998.2469.
  8. Sonmez, Tayfun; Abdulkadiroglu, Atila (June 2003). "School Choice: A Mechanism Design Approach" (PDF). American Economic Review. 93 (3): 729–47. doi:10.1257/000282803322157061. hdl:10161/2090.
  9. "Tayfun Sonmez, Google Scholar".
  10. Cook, Gareth (2003). "School assignment flaws detailed: Two economists study problem, offer relief". Boston Globe.
  11. Sonmez, Tayfun; Parag Pathak (2008). "Leveling the Playing Field: Sincere and Sophisticated Players in the Boston Mechanism". American Economic Review. 98 (4): 1636–52. doi:10.1257/aer.98.4.1636.
  12. Sonmez, Tayfun; Atila Abdulkadiroglu; Parag Pathak; Alvin Roth (2006). "Changing the Boston Mechanism". NBER Working Paper Series. doi:10.3386/w11965.
  13. Sonmez, Tayfun; Pathak, Parag (February 2013). "School Admissions Reform in Chicago and England: Comparing Mechanisms by their Vulnerability to Manipulation" (PDF). American Economic Review. 103 (1): 80–106. doi:10.1257/aer.103.1.80.
  14. Seelye, Katharine Q. (2013-03-12). "No Division Required in This School Problem". New York Times.
  15. Sonmez, Tayfun; Alvin Roth; Utku Unver (May 2005). "A Kidney Exchange Clearinghouse in New England". American Economic Review. 95 (2): 376–80. doi:10.1257/000282805774669989.
  16. Roth, Alvin E; Sönmez, Tayfun; Ünver, M. Utku (2007). "Efficient Kidney Exchange: Coincidence of Wants in Markets with Compatibility-Based Preferences" (PDF). American Economic Review. 97 (3): 828–851. doi:10.1257/aer.97.3.828. ISSN 0002-8282.
  17. "'Six-way' kidney transplant first". BBC. 8 April 2008.
  18. "New Software Matches More Kidney Donations, Faster". Retrieved October 22, 2012.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.