Constrained automated mechanism design for infinite games of incomplete information

Yevgeniy Vorobeychik, Daniel M. Reeves, Michael P. Wellman

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)313-351
Number of pages39
JournalAutonomous Agents and Multi-Agent Systems
Volume25
Issue number2
DOIs
StatePublished - Sep 2012

Keywords

  • Auctions
  • Computational game theory
  • Computational mechanism design

Fingerprint

Dive into the research topics of 'Constrained automated mechanism design for infinite games of incomplete information'. Together they form a unique fingerprint.

Cite this