Automated Optimal OSP Mechanisms for Set Systems - The Case of Small Domains
Automated Optimal OSP Mechanisms for Set Systems - The Case of Small Domains
复制标题
集合系统的自动最优 OSP 机制 - 小域的情况
DOI：
--
复制
发表时间：
2019
期刊：
影响因子：
--
通讯作者：
Carmine Ventre
中科院分区：
文献类型：
--
作者：
Diodato Ferraioli;Adrian Meier;P. Penna;Carmine Ventre
显然，防策略（OSP）机制最近已经成为处理不完美理性的工具。事实上，它们激励那些没有应急推理能力的人“遵守协议”并诚实。然而，其确切的力量仍有待确定。例如，即使对于相对较好理解的设置，例如二进制分配问题，也不清楚何时可以使用OSP机制计算最优解。
Obviously strategyproof (OSP) mechanisms have recently come to the fore as a tool to deal with imperfect rationality. They, in fact, incentivize people with no contingent reasoning skills to “follow the protocol” and be honest. However, their exact power is still to be determined. For example, even for settings relatively well understood, such as binary allocation problems, it is not clear when optimal solutions can be computed with OSP mechanisms.
DOI：
10.1287/opre.2020.2039
发表时间：
2016-12
期刊：
ArXiv
影响因子：
--
作者：
Alon Eden;M. Feldman;Ophir Friedler;Inbal Talgam-Cohen;S. M. Weinberg
通讯作者：
Alon Eden;M. Feldman;Ophir Friedler;Inbal Talgam-Cohen;S. M. Weinberg