Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/108866
Type: | Conference paper |
Title: | Parametric mechanism design via quantifier elimination |
Author: | Iwasaki, A. Fujita, E. Todo, T. Iwane, H. Anai, H. Guo, M. Yokoo, M. |
Citation: | Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS, 2015, vol.3, pp.1885-1886 |
Publisher: | IFAAMS |
Issue Date: | 2015 |
ISBN: | 978-1-4503-3413-6 |
ISSN: | 1548-8403 1558-2914 |
Conference Name: | 14th International Conference on Autonomous Agents and Multiagent Systems (AAMAS '15) (4 May 2015 - 8 May 2015 : Istanbul, Turkey) |
Statement of Responsibility: | Atsushi Iwasaki, Etsushi Fujita, Taiki Todo, Hidenao Iwane, Hirokazu Anai, Mingyu Guo, and Makoto Yokoo |
Abstract: | This paper proposes an alternative automated mechanism design approach called parametric mechanism design via quantifier elimination (PMD-QE), which utilizes QE, a symbolic formula manipulation technique. In PMD-QE, we start from a skeleton of mechanisms, which is characterized by a set of parameters, e.g., critical values. The range of parameters where the given constraints are satisfied is automatically identified by QE. To demonstrate the potential of this idea, we are able to identify a non-trivial dominant-strategy incentive compatible mechanism for a setting where a bidder has a publicly known budget limit. |
Keywords: | Mechanism design, VCG, budget limit, quantifier elimination |
Description: | Extended abstract |
Rights: | Copyright © 2015, International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All rights reserved. |
Published version: | http://www.ifaamas.org/Proceedings/aamas2015/forms/index.htm |
Appears in Collections: | Aurora harvest 3 Computer Science publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
RA_hdl_108866.pdf Restricted Access | Restricted Access | 313.89 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.