CAREER: Towards a Robust Theory of Mechanism Design
CAREER: Towards a Robust Theory of Mechanism Design
批准号:
1942583
负责人:
Yang Cai
金额:
$60.0万
依托单位:
依托单位国家:
美国
项目类别:
Continuing Grant
财政年份:
2020
资助国家:
美国
项目状态:
已结题
起止时间:
2020-01-01 至 2024-12-31
中文摘要
点击翻译按钮获取中文摘要
英文摘要
The ever-growing technology platforms such as sponsored search, online marketplaces, crowdsourcing, and sharing economies are becoming cornerstones of the modern economy. A central problem faced by these online markets and platforms is how to design the right incentive structure, so that the participants, who are only interested in optimizing their own utilities, are motivated to take actions that will help to realize the designer's goals. The classic economic theory of mechanism design is dedicated to addressing this problem. However, it is not yet robust or realistic enough to provide concrete guidelines for practice due to several shortcomings such as the strong reliance on distributional assumptions, the focus on optimal but impractical mechanisms, as well as the lack of attention to the role of information. The goal of this research is to build a robust mechanism design theory by offering new frameworks and solutions to alleviate and resolve these shortcomings. In tackling these weaknesses, this project not only improves the practicality of mechanism design, but also develops insights to answer some of the long-standing theoretical open questions. This project includes an education plan that incorporates course development of both graduate and undergraduate courses as well as training for graduate students and research opportunities for undergraduates. More concretely, this project focuses on the following three research thrusts. (i) Weakening Bayesian assumptions: a common but unrealistic assumption in mechanism design is that the participants' preferences are drawn from a known distribution. The investigator plans to revisit mechanism design under two alternative and realistic distribution access models: (a) sample access to the distribution and (b) max-min robust learning -- given only an approximate distribution, learn a mechanism that performs well under the unknown true distribution. (ii) Understanding the tradeoff between simplicity and optimality: the optimal mechanism is usually too complex to be practical. The investigator will develop a framework to design simple and approximately optimal mechanisms and address open questions in multi-item auctions and two-sided markets. (iii) Information design via an algorithmic lens: unlike traditional mechanism design, which focuses on influencing participants via direct incentives, information design studies how information revelation can shift the participants’ behavior. The investigator aims to understand the design of information structure via an algorithmic lens, focusing on the computational complexity of the optimal information revelation scheme. This work will rely on tools from optimization, learning theory, statistics and machine learning, and statistical physics, and forge new connections between these fields and mechanism design.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.
期刊论文(15)
专著(0)
科研奖励(0)
会议论文
登录
查看更多内容
Multi-Item Mechanisms without Item-Independence: Learnability via Robustness
没有项目独立性的多项目机制:通过鲁棒性实现可学习性
DOI:
10.1145/3391403.3399541
发表时间:
2020
期刊:
21st ACM Conference on Economics and Computation
影响因子:
--
作者:
[Brustle, Johannes, Cai, Yang, Daskalakis, Constantinos]
通讯作者:
Daskalakis, Constantinos
Is Selling Complete Information (Approximately) Optimal?
出售(大约)完整信息是最佳选择吗?
DOI:
10.1145/3490486.3538304
发表时间:
2022
期刊:
Proceedings of the 23rd ACM Conference on Economics and Computation
影响因子:
--
作者:
[Bergemann, Dirk, Cai, Yang, Velegkas, Grigoris, Zhao, Mingfei]
通讯作者:
Zhao, Mingfei
DOI:
--
发表时间:
2022
期刊:
China Economic Review
影响因子:
6.8
作者:
[Yang Cai;Argyris Oikonomou;Weiqiang Zheng]
通讯作者:
Yang Cai;Argyris Oikonomou;Weiqiang Zheng
How to Sell Information Optimally: An Algorithmic Study
如何最佳地销售信息:算法研究
DOI:
10.4230/lipics.itcs.2021.81
发表时间:
2021
期刊:
Proceedings of the12th Innovations in Theoretical Computer Science Conference
影响因子:
--
作者:
[Cai, Yang, Velegkas, Grigoris]
通讯作者:
Velegkas, Grigoris
An Efficient epsilon-BIC to BIC Transformation and Its Application to Black-Box Reduction in Revenue Maximization
一种有效的 epsilon-BIC 到 BIC 转换及其在收益最大化黑盒还原中的应用
DOI:
--
发表时间:
2021
期刊:
ACM-SIAM Symposium on Discrete Algorithms (SODA21
影响因子:
--
作者:
[Cai, Yang, Oikonomou, Argyris, Velegkas, Grigoris, Zhao, Mingfei]
通讯作者:
Zhao, Mingfei
共 15 条
AF: Small: Equilibrium Computation and Multi-Agent Learning in High-Dimensional Games
-
批准号:2342642
-
项目类别:Standard Grant
-
资助金额:$59.97万
-
财政年份:2024
-
负责人:Yang Cai
-
依托单位:
Support for Instinctive Computing Workshop
-
批准号:0936487
-
项目类别:Standard Grant
-
资助金额:$1.28万
-
财政年份:2009
-
负责人:Yang Cai
-
依托单位:
CT-ER: Privacy Algorithms for Human Imaging Systems
-
批准号:0716657
-
项目类别:Standard Grant
-
资助金额:$0.0万
-
财政年份:2007
-
负责人:Yang Cai
-
依托单位:
海外基金