Demo Data from SIGIR 2026 / reviewers in the wild / expert
Kei Ikegami
dblp:266/5642
· DBLP profile ↗
2ranked-venue papers
2as first author
1since 2021 · last 2025
0000-0002-0995-3065ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorTheory of computation · 1 · 1 first-author · 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.
| Theoretical computer science
2 papers |
Algorithmic game theory and mechanism design · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computational social science and digital humanities · 100% |
Topics — the 6 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithmic game theory and mechanism design › market design
matching markets |
0.9 | 1 | 2025 | Evaluating the Efficiency of Regulation in Matching Markets with Distributional Disparities · EC 2025 |
Algorithmic game theory and mechanism design › learning in games
best-response dynamics |
0.4 | 1 | 2020 | A Simple, Fast, and Safe Mediator for Congestion Management · AAAI 2020 |
Algorithmic game theory and mechanism design
equilibrium computation |
0.4 | 1 | 2020 | A Simple, Fast, and Safe Mediator for Congestion Management · AAAI 2020 |
Algorithmic game theory and mechanism design
mechanism design |
0.4 | 1 | 2020 | A Simple, Fast, and Safe Mediator for Congestion Management · AAAI 2020 |
Algorithmic game theory and mechanism design › mechanism design › implementation theory
mediator design |
0.4 | 1 | 2020 | A Simple, Fast, and Safe Mediator for Congestion Management · AAAI 2020 |
Algorithmic game theory and mechanism design
congestion games |
0.1 | 1 | 2020 | A Simple, Fast, and Safe Mediator for Congestion Management · AAAI 2020 |
Methods — techniques the papers use, named apart from their topics
transferable utility model · 1.7counterfactual simulation · 1.7ex-post nash equilibrium · 0.4best response dynamics · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Evaluating the Efficiency of Regulation in Matching Markets with Distributional DisparitiesabstractCap-and-quota regulations are a commonly employed policy tool to address distributional disparities in matching markets. This paper develops a theoretical and empirical framework to evaluate the effectiveness of such regulations by integrating regional constraints into a transferable utility matching model. Using novel data from the Japan Residency Matching Program, we estimate participants' preferences and simulate counterfactual matching outcomes under various policy interventions. Simulation results reveal that cap-based regulations lead to significant efficiency losses, whereas a modest subsidy for each match in underserved regions achieves distributional constraints while improving social welfare. Kei Ikegami, Atsushi Iwasaki, Akira Matsushita, Kyohei Okumura |
EC | 1 |
| 2020 | A Simple, Fast, and Safe Mediator for Congestion ManagementabstractCongestion is a severe problem in cities. A large population with little information about each other's preferences hardly reaches equilibrium and causes unexpected congestion. Controlling such congestion requires us to collect information dispersed in the market and to coordinate actions among agents. We aim to design a mediator that a) induces a game with high social welfare in equilibrium, b) computes an equilibrium efficiently, c) works without common prior, and d) performs well even when only some of the agents in the market use the mediator. We propose a mediator based on a version of best response dynamics (BRD). We prove that, in a simple setting with two resources, “good behavior” (reporting truthfully and following the recommendation) forms an (approximate) ex-post Nash equilibrium in the mediated game; in the equilibrium, the welfare is close to the first-best when preferences diverge enough. Furthermore, under a certain behavioral assumption, those who are not using the mediator can always enjoy non-negative payoff gain by joining it even without the full participation of others. Additionally, our experimental results suggest that such results remain valid for more general settings. Kei Ikegami, Kyohei Okumura, Takumi Yoshikawa |
AAAI | 1 |