讲座题目:A Notion of Voting Complexity (joint with Qinggong Wu)
报告人:吴星晔
报告时间:2021年5月12日(周三)下午14:00
报告地点:经管院B224
主办单位:best365网页版登录数理经济与数理金融系
主持人:孙祥
内容摘要:We develop a measure of complexity of a voting problem in terms of the dimensionality of its intermediate type space introduced by Grandmont (1978). A voting problem with a lower dimensionality is less vulnerable to the problem of voting cycles and more likely to have a candidate that has a decent popular support.
主讲人简介:吴星晔,2018年毕业于哥伦比亚大学,现为清华经管学院经济系助理教授,研究兴趣包括微观经济学理论,机制设计和匹配理论。