Kyushu University [Taiki Todo (Assistant Professor) Faculty of Information Science and Electrical Engineering, Department of Informatics]

Taiki Todo

Last modified date：2019.06.28

Assistant Professor / Intelligent Systems
Department of Informatics
Faculty of Information Science and Electrical Engineering

1 Research Interests

2 Academic Activities

2.1 Papers

2.2 Presentations

3 Membership in Academic Society

Graduate School

Department of informatics
Graduate School of Information Science and Electrical Engineering

Undergraduate School

Department of Physics
School of Sciences

Department of Electrical Engineering and Computer Science
School of Engineering

E-Mail

Fax

092-802-3576

Academic Degree

Doctor of Informatics

Field of Specialization

Game Theory, Multi-Agent Systems

Research

Research Interests

Applying Game Theory into Mining Software Repositories
keyword : Game Theory, Mining Software Repositories
2014.10～2017.03.
Theory for Exchange of Multiple Indivisible Goods
keyword : Top-Trading-Cycles algorithm, exchange market, core assignments, kidney exchange
2014.04～2021.03.
Effect of False-Name Manipulations in Market Design Environments
keyword : Game Theory, Mechanism Design
2008.04.

Academic Activities

Papers

Show All Papers >>

Etsushi Fujita, Julien Lesca, Akihisa Sonoda, Taiki Todo, Makoto Yokoo, A complexity approach for core-selecting exchange under conditionally lexicographic preferences, Journal of Artificial Intelligence Research, 10.1613/jair.1.11254, 63, 515-555, 2018.11, Core-selection is a crucial property of rules in the literature of resource allocation. It is also desirable, from the perspective of mechanism design, to address the incentive of agents to cheat by misreporting their preferences. this paper investigates the exchange problem where (i) each agent is initially endowed with (possibly multiple) indivisible goods, (ii) agents' preferences are assumed to be conditionally lexicographic, and (iii) side payments are prohibited. We propose an exchange rule called augmented top-trading-cycles (ATTC), based on the original TTC procedure. We first show that ATTC is core-selecting and runs in polynomial time with respect to the number of goods. We then show that finding a beneficial misreport under ATTC is NP-hard. We finally clarify relationship of misreporting with splitting and hiding, two different types of manipulations, under ATTC..

Presentations

Show All Presentations >>

1.	Etsushi Fujita, Julien Lesca, Akihisa Sonoda, Taiki Todo, Makoto Yokoo, A Complexity Approach for Core-Selecting Exchange with Multiple Indivisible Goods under Lexicographic Preferences, Twenty-Ninth AAAI Conference on Artificial Intelligence (AAAI-15), 2015.01.

Membership in Academic Society

Japan Society for Software Science and Technology
The Japanese Society for Artificial Intelligence
Information Processing Society of Japan

Unauthorized reprint of the contents of this database is prohibited.