Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Keiichi Namikoshi

dblp:222/3682 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
3since 2021 · last 2026
0009-0006-5519-553XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 1 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Multi-agent systems · 61% Graph learning · 39%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning
graph neural network
1.012026
Behavioral-Similarity and Clustering-Based Methods for Static Graph Estimation in Hybrid GNNs (Student Abstract) · AAAI 2026
Knowledge, reasoning and agents › Multi-agent systems › social dynamics modeling
social influence
1.012026
Social Influence-Based Mutual Acknowledgement Token Exchange (Student Abstract) · AAAI 2026
Machine learning › Graph learning
graph construction
0.312026
Behavioral-Similarity and Clustering-Based Methods for Static Graph Estimation in Hybrid GNNs (Student Abstract) · AAAI 2026

Methods — techniques the papers use, named apart from their topics

reinforcement learning · 1.0mutual acknowledgment token exchange · 1.0k-nearest neighbors · 1.0k-means · 1.0co-occurrence normalization · 1.0
YearPublicationVenuePosition
2026 Social Influence-Based Mutual Acknowledgement Token Exchange (Student Abstract)
abstract
External incentive mechanisms have been studied as a method to promote cooperation in sequential social dilemmas involving multiple autonomous agents. Mutual Acknowledgment Token Exchange (MATE) is one such approach: by enabling agents to exchange acknowledgment tokens, it induces cooperation without additional training. However, MATE’s use of fixed, manually tuned token values limits adaptability to nonstationary environments and can constrain performance. To enable a dynamically adapted token, we introduce Social Influence-based MATE (SI-MATE), which allows agents to share their individual improvement signals and to self-punishment in response to inequality. Experiments in a four-agent environment show that SI-MATE outperforms MATE across multiple metrics, including learning speed.
Shoma Mizuno, Keiichi Namikoshi, Yuko Sakurai
AAAI2
2026 Behavioral-Similarity and Clustering-Based Methods for Static Graph Estimation in Hybrid GNNs (Student Abstract)
abstract
In this study, we propose two methods to estimate static graphs from a single dynamic graph and integrate them into hybrid Graph Neural Networks (GNNs), which combine long-term static structure with transient dynamic interactions. Since static graphs are often unavailable and attributes may be difficult to use at scale or under privacy constraints, we introduce: (i) a “behavioral similarity” estimator based on normalized co-occurrence, which requires no attributes, and (ii) an attribute-aware K-means + k-NN estimator that is more efficient than cosine similarity. Experiments on multiple real-world datasets show that both methods consistently improve predictive accuracy and training efficiency, underscoring the importance of static graph choice in hybrid GNNs.
Ryusei Otani, Keiichi Namikoshi, Yuko Sakurai, Mingyu Guo 0001, Satoshi Oyama
AAAI2
2024 On LLM Wizards: Identifying Large Language Models' Behaviors for Wizard of Oz Experiments
abstract
The Wizard of Oz (WoZ) method is a widely adopted research approach where a human Wizard “role-plays” a not readily available technology and interacts with participants to elicit user behaviors and probe the design space. With the growing ability for modern large language models (LLMs) to role-play, one can apply LLMs as Wizards in WoZ experiments with better scalability and lower cost than the traditional approach. However, methodological guidance on responsibly applying LLMs in WoZ experiments and a systematic evaluation of LLMs’ role-playing ability are lacking. Through two LLM-powered WoZ studies, we take the first step towards identifying an experiment lifecycle for researchers to safely integrate LLMs into WoZ experiments and interpret data generated from settings that involve Wizards role-played by LLMs. We also contribute a heuristic-based evaluation framework that allows the estimation of LLMs’ role-playing ability in WoZ experiments and reveals LLMs’ behavior patterns at scale.
Jingchao Fang, Nikos Aréchiga, Keiichi Namikoshi, Nayeli Bravo, Candice Hogan, David A. Shamma
IVA3
2018 Estimation of the heterogeneous strategies from action log
abstract
Agent-based crowd simulation is a widely used technique for designing and evaluating human-in-the-loop situations such as evacuation plans and building design. Valid evaluation requires a correct model of an individual agent's action rule, which causes human behavior in a crowd. However, in general, designing a specific action rule of each agent depends strongly on a trial-and-error approach because a real crowd shows diverse behaviors.
Keiichi Namikoshi, Sachiyo Arai
GECCO1