Optimal Dynamic Allocation: Simplicity through Information Design

Optimal Dynamic Allocation: Simplicity through Information Design
复制标题

最优动态分配:通过信息设计实现简单化

DOI:
10.2139/ssrn.3610386
复制
发表时间:
2020
期刊:
Proceedings of the 22nd ACM Conference on Economics and Computation
影响因子:
--
通讯作者:
Afshin Nikzad
Afshin Nikzad
中科院分区:
--
文献类型:
--
作者:
I. Ashlagi;F. Monachou;Afshin Nikzad

文献摘要

参考文献

被引文献

相似文献

我们研究动态的非货币市场中的对象被分配给单位需求代理与私人类型。一个代理人的价值是超模的类型和质量的对象,她的回报是准线性的等待成本。我们分析了直接启示机制,引出代理的类型,并将它们分配给对象随着时间的推移。我们确定的福利最大化机制,并表明,它可以实现一个先到先得的等待名单延迟时,做市商可以设计的信息披露给代理人的对象。最优的公开策略池相邻的对象类型。
We study dynamic nonmonetary markets where objects are allocated to unit-demand agents with private types. An agent's value for an object is supermodular in her type and the quality of the object, and her payoff is quasilinear in her waiting cost. We analyze direct-revelation mechanisms that elicit agents' types and assign them to objects over time. We identify the welfare-maximizing mechanism and show that it can be implemented by a first-come first-served wait-list with deferrals when the marketmaker can design the information disclosed to agents about the objects. The optimal disclosure policy pools adjacent object types.
针对拥挤的社会服务的信息设计:基于需求的最佳说服
DOI: 10.1145/3391403.3399504
发表时间: 2020
期刊: 21st ACM Conference on Economics and Computation
影响因子: --
作者:
Anunrojwong, Jerry;Iyer, Krishnamurthy;Manshadi, Vahideh
通讯作者: Manshadi, Vahideh
战略客户不可观察队列中的最佳信号机制
DOI: 10.1145/3033274.3085135
发表时间: 2017
期刊: Proceedings of the 2017 ACM Conference on Economics and Computation (EC
影响因子: --
作者:
Lingenbrink, David;Iyer, Krishnamurthy
通讯作者: Iyer, Krishnamurthy