EDBT 2026 Demo / reviewers in the wild / expert
Qi Ju 0001
dblp:34/1080-1
· DBLP profile ↗
3ranked-venue papers
3as first author
3since 2021 · last 2025
0009-0000-3759-3696ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 3 first-author · 3 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 |
Reinforcement learning · 74% Multi-agent systems · 20% Planning, search and constraint satisfaction · 6% | |
| Theoretical computer science
1 paper |
Algorithmic game theory and mechanism design · 100% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning
multi-agent reinforcement learning |
1.6 | 2 | 2025 | Preference-CFR: Beyond Nash Equilibrium for Better Game Strategies · ICML 2025 Accelerating Nash Equilibrium Convergence in Monte Carlo Settings Through Counterfactual Value Based Fictitious Play · NeurIPS 2024 |
Knowledge, reasoning and agents › Multi-agent systems
imperfect information games |
0.9 | 1 | 2025 | Preference-CFR: Beyond Nash Equilibrium for Better Game Strategies · ICML 2025 |
Algorithmic game theory and mechanism design › equilibrium computation
counterfactual regret minimization |
0.9 | 1 | 2025 | Preference-CFR: Beyond Nash Equilibrium for Better Game Strategies · ICML 2025 |
Algorithmic game theory and mechanism design › solution concepts in games › equilibrium concepts
nash equilibrium |
0.9 | 1 | 2025 | Preference-CFR: Beyond Nash Equilibrium for Better Game Strategies · ICML 2025 |
Machine learning › Reinforcement learning › regret minimization
counterfactual regret minimization |
0.8 | 1 | 2024 | Accelerating Nash Equilibrium Convergence in Monte Carlo Settings Through Counterfactual Value Based Fictitious Play · NeurIPS 2024 |
Machine learning › Reinforcement learning › multi-agent reinforcement learning › equilibrium learning
fictitious play |
0.8 | 1 | 2024 | Accelerating Nash Equilibrium Convergence in Monte Carlo Settings Through Counterfactual Value Based Fictitious Play · NeurIPS 2024 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
game playing |
0.3 | 1 | 2025 | Preference-CFR: Beyond Nash Equilibrium for Better Game Strategies · ICML 2025 |
Methods — techniques the papers use, named apart from their topics
vulnerability degree · 1.7strategic distribution adjustment · 1.7preference degree · 1.7monte carlo counterfactual value · 0.8fictitious play · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Preference-CFR: Beyond Nash Equilibrium for Better Game StrategiesabstractArtificial intelligence (AI) has surpassed top human players in a variety of games. In imperfect information games, these achievements have primarily been driven by Counterfactual Regret Minimization (CFR) and its variants for computing Nash equilibrium. However, most existing research has focused on maximizing payoff, while largely neglecting the importance of strategic diversity and the need for varied play styles, thereby limiting AI’s adaptability to different user preferences. To address this gap, we propose Preference-CFR (Pref-CFR), a novel method that incorporates two key parameters: preference degree and vulnerability degree. These parameters enable the AI to adjust its strategic distribution within an acceptable performance loss threshold, thereby enhancing its adaptability to a wider range of strategic demands. In our experiments with Texas Hold’em, Pref-CFR successfully trained Aggressive and Loose Passive styles that not only match original CFR-based strategies in performance but also display clearly distinct behavioral patterns. Notably, for certain hand scenarios, Pref-CFR produces strategies that diverge significantly from both conventional expert heuristics and original CFR outputs, potentially offering novel insights for professional players. Qi Ju 0001, Thomas Tellier, Zhemei Fang, Yunfeng Luo |
ICML | 1 |
| 2024 | Accelerating Nash Equilibrium Convergence in Monte Carlo Settings Through Counterfactual Value Based Fictitious PlayabstractCounterfactual Regret Minimization (CFR) and its variants are widely recognized as effective algorithms for solving extensive-form imperfect information games. Recently, many improvements have been focused on enhancing the convergence speed of the CFR algorithm. However, most of these variants are not applicable under Monte Carlo (MC) conditions, making them unsuitable for training in large-scale games. We introduce a new MC-based algorithm for solving extensive-form imperfect information games, called MCCFVFP (Monte Carlo Counterfactual Value-Based Fictitious Play). MCCFVFP combines CFR’s counterfactual value calculations with fictitious play’s best response strategy, leveraging the strengths of fictitious play to gain significant advantages in games with a high proportion of dominated strategies. Experimental results show that MCCFVFP achieved convergence speeds approximately 20\%$\sim$50\% faster than the most advanced MCCFR variants in games like poker and other test games. Qi Ju 0001, Falin Hei, Dengbing Yi, Zhemei Fang, Yunfeng Luo |
NeurIPS | 1 |
| 2024 | From First-Order to Second-Order Rationality: Advancing Game Convergence with Dynamic Weighted Fictitious Play
Qi Ju 0001, Falin Hei, Zhemei Fang, Yunfeng Luo |
PRICAI (5) | 1 |