| Budget Amount *help |
¥2,340,000 (Direct Cost: ¥1,800,000、Indirect Cost: ¥540,000)
Fiscal Year 2015: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2014: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
|
|---|
| Outline of Final Research Achievements |
During this research project, we investigated the effect of dummy input in various algorithms. For individual allocation problems, we consider both barter exchange and cake cutting. We also define a weaker notion of resistance, based on computational complexity, against dummy input and showed that a simple extension of the top-trading-cycles algorithm satisfies it. For social decision problems, we dealt with location of two identical facilities on a line. We successfully characterized the behavior of algorithms that is resistant to dummy input. Furthermore, we provided several complexity results for a variant of picking sequence problem, in which the sequence is randomly determined.
Some of these contributions appeared in proceedings of top-tier AI conferences, such as AAAI, AAMAS, and IJCAI, and presented at the venues.
|
