Automated design of social choice rules by optimization and rule extraction
Project/Area Number |
23650073
|
Research Category |
Grant-in-Aid for Challenging Exploratory Research
|
Allocation Type | Multi-year Fund |
Research Field |
Intelligent informatics
|
Research Institution | Kyushu University |
Principal Investigator |
YOKOO Makoto 九州大学, システム情報科学研究院, 教授 (20380678)
|
Co-Investigator(Kenkyū-buntansha) |
IWASAKI Atsushi 九州大学, システム情報科学研究院, 助教 (30380679)
|
Project Period (FY) |
2011 – 2012
|
Project Status |
Completed (Fiscal Year 2012)
|
Budget Amount *help |
¥3,640,000 (Direct Cost: ¥2,800,000、Indirect Cost: ¥840,000)
Fiscal Year 2012: ¥1,950,000 (Direct Cost: ¥1,500,000、Indirect Cost: ¥450,000)
Fiscal Year 2011: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
|
Keywords | ゲーム理論 / 最適化 / メカニズムデザイン / オークション / 架空名義操作 / インターネットオークション / 架空名義入札 |
Research Abstract |
The goal of this research project is to develop a method for automatically generating social choice rules that can be applied to large-scale problem instances by combining existing automated mechanism design techniques (which can be applied only for small-scare problem instances) and rule discovery techniques. In this research, we first develop an important core technology for achieving this goal, i.e., a method for extracting social choice rules that satisfy desirable properties based on the results obtained by automated mechanism design. This result was presented at Forum on Information Technology (FIT) and obtained the best paper award (Funai best paper award). Furthermore, the existing automated mechanism design techniques use integer programming to obtain optimal rules for a given criterion. As a result, the types of participants must be represented as a set of discrete values. We develop a new method for directly obtaining social choice rules based on another optimization technique called quantifier elimination, which can handle non-linear, continuous variables.
|
Report
(3 results)
Research Products
(56 results)
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
[Presentation] The Design of Cryptographic S-Boxes Using CSPs2011
Author(s)
Venkatesh Ramamoorthy, Marius-Calin Silaghi, Toshihiro Matsui, Katsutoshi Hirayama, Makoto Yokoo
Organizer
17th International Conference on Principles and Practice of Constraint Programming (CP-2011) (Best Application Paper Award)
Place of Presentation
Perugia, Italy
Related Report
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-