RI: Mediuim: Abstraction, Equilibrium Finding, Safe Opponent Exploitation, and Robust Strategies for Imperfect-Information Games

虽然博弈论传统上被用作分析真实情况的小型风格化版本的思维工具，但该项目正在开发可操作的工具，用于全面详细地分析真实的大规模场景。为了确保真正的可伸缩性，这些技术将以非常大型的谈判、拍卖和扑克游戏为基准。这项工作正在朝着这样一种愿景迈进：软件代理代表人类进行商业活动，或者至少建议他们采取更明智的行动。这将通过更好的决策来增加社会福利。这也将使更广泛和更公平的机会，因为它将有助于让经验较少/受教育程度较低的人/公司与专业市场参与者处于平等的地位。反过来，更广泛的准入将进一步增加(电子)商务的好处，这些好处将在社会各阶层之间更公平地分配。该范例还将产生一种增强安全性的形式，因为所提议的技术所产生的策略不能被利用(至少不会被利用太多，也不容易)。这些项目对计算博弈论的特别贡献包括开发(无损和有损)博弈抽象方法，以允许扩大到更大规模的社会输入“博弈”，使用两个以上代理人的设置技术，稳健地处理不太理性的对手的技术，以及通过复仇计算推导出近似解的最坏情况保证。

While game theory has traditionally been used as a thinking tool to analyze small stylized versions of real situations, this project is developing operational tools for analyzing real large-scale settings in full detail. To ensure true scalability, the techniques will be benchmarked on very-large-scale games of negotiation, auctions, and poker. This work is on a path toward a vision where software agents conduct commerce on behalf of humans, or at least advise them to act more intelligently. This will lead to increased social welfare through better decision making. This will also enable broader and fairer access because it will help put less experienced/educated people/companies on an equal footing with expert market participants. Broader access will, in turn, increase the benefits of (electronic) commerce further, and the benefits will be distributed more fairly across segments of society. The paradigm will also yield a form of increased security because strategies generated by the proposed techniques cannot be taken advantage of (at least not by much and not easily). The projects particular contributions to computational game theory include the development of (lossless and lossy) game-abstraction methods to allow scale-up to larger 'games' of societal import, techniques for settings with more than two agents, techniques for dealing with less-than-rational opponents robustly, and derivation of worst-case guarantees on approximate solutions via nemesis computation.