Please use this identifier to cite or link to this item:
Type: Conference paper
Title: Computationally feasible automated mechanism design: general approach and case studies
Author: Guo, M.
Conitzer, V.
Citation: Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI-10), 2010, vol.3, pp.1676-1679
Publisher: AAAI
Publisher Place: California; USA
Issue Date: 2010
ISBN: 9781577354635
Conference Name: AAAI Conference on Artificial Intelligence (AAAI) (11 Jul 2010 - 15 Jul 2010 : Atlanta, Georgia; USA)
Statement of
Mingyu Guo and Vincent Conitzer
Abstract: In many multiagent settings, a decision must be made based on the preferences of multiple agents, and agents may lie about their preferences if this is to their benefit. In mechanism design, the goal is to design procedures (mechanisms) for making the decision that work in spite of such strategic behavior, usually by making untruthful behavior suboptimal. In automated mechanism design, the idea is to computationally search through the space of feasible mechanisms, rather than to design them analytically by hand. Unfortunately, the most straightforward approach to automated mechanism design does not scale to large instances, because it requires searching over a very large space of possible functions. In this paper, we describe an approach to automated mechanism design that is computationally feasible. Instead of optimizing over all feasible mechanisms, we carefully choose a parameterized subfamily of mechanisms. Then we optimize over mechanisms within this family, and analyze whether and to what extent the resulting mechanism is suboptimal outside the subfamily. We demonstrate the usefulness of our approach with two case studies.
Rights: Copyright © 2010, Association for the Advancement of Artificial Intelligence ( All rights reserved
Published version:
Appears in Collections:Aurora harvest 7
Computer Science publications

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.