Constrained automated mechanism design for infinite games of incomplete information
作者:Yevgeniy Vorobeychik, Daniel M. Reeves, Michael P. Wellman
摘要
We present a functional framework for automated Bayesian and worst-case mechanism design, based on a two-stage game model of strategic interaction between the designer and the mechanism participants. At the core of our framework is a black-box optimization algorithm which guides the process of evaluating candidate mechanisms. We apply the approach to several classes of two-player infinite games of incomplete information, producing optimal or nearly optimal mechanisms using various objective functions. By comparing our results with known optimal mechanisms, and in some cases improving on the best known mechanisms, we provide evidence that ours is a promising approach to parametrized mechanism design for infinite Bayesian games.
论文关键词:Computational game theory, Computational mechanism design, Auctions
论文评审过程:
论文官网地址:https://doi.org/10.1007/s10458-011-9177-2