Demo Data from EDBT 2026 / reviewers in the wild / expert
Wolfram Barfuss
dblp:176/5239
· DBLP profile ↗
3ranked-venue papers
1as first author
3since 2021 · last 2026
0000-0002-9077-5242ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging 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
1 paper |
Reinforcement learning · 70% Learning theory · 30% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Learning theory
learning dynamics |
1.0 | 1 | 2026 | Emergent Fast-Slow Dynamics in Multi-Agent Q-Learning for Networked Stochastic Games · AAAI 2026 |
Machine learning › Reinforcement learning › multi-agent reinforcement learning › value-based multi-agent reinforcement learning
multi-agent q-learning |
1.0 | 1 | 2026 | Emergent Fast-Slow Dynamics in Multi-Agent Q-Learning for Networked Stochastic Games · AAAI 2026 |
Machine learning › Reinforcement learning
multi-agent reinforcement learning |
1.0 | 1 | 2026 | Emergent Fast-Slow Dynamics in Multi-Agent Q-Learning for Networked Stochastic Games · AAAI 2026 |
Machine learning › Reinforcement learning › multi-agent reinforcement learning
cooperative multi-agent reinforcement learning |
0.3 | 1 | 2026 | Emergent Fast-Slow Dynamics in Multi-Agent Q-Learning for Networked Stochastic Games · AAAI 2026 |
Methods — techniques the papers use, named apart from their topics
statistical physics · 1.0pair-approximation · 1.0agent-based simulation · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Emergent Fast-Slow Dynamics in Multi-Agent Q-Learning for Networked Stochastic GamesabstractUnderstanding the emergence of collective behaviors of multi-agent systems requires investigating the learning dynamics. However, the theoretical analysis of large-scale graph-structured multi-agent reinforcement learning (MARL) systems remains challenging due to agent heterogeneity and the intrinsic coupling between state transitions and individual Q-value updates. In this work, we develop a unified theoretical framework that captures the evolution of agent behaviors at both individual and population levels. By leveraging the pair approximation technique from statistical physics, we derive a closed set of evolution equations that accurately describe the temporal dynamics of the system. Our analysis also reveals a separation of time scales. For small learning rates, state transitions equilibrate rapidly, while Q-value updates evolve slowly with stationary state distributions. Through extensive agent-based simulations, we validate the robustness of our theoretical results and explain the mechanisms that lead to the emergence of cooperation in social dilemmas. Our framework offers new perspectives for bridging complex systems science and MARL, providing insights for the design of cooperative and resilient AI. Yuxin Geng, Wolfram Barfuss, Xingru Chen |
AAAI | 2 |
| 2024 | Moderate confirmation bias enhances decision-making in groups of reinforcement-learning agentsabstractHumans tend to give more weight to information confirming their beliefs than to information that disconfirms them. Nevertheless, this apparent irrationality has been shown to improve individual decision-making under uncertainty. However, little is known about this bias' impact on decision-making in a social context. Here, we investigate the conditions under which confirmation bias is beneficial or detrimental to decision-making under social influence. To do so, we develop a Collective Asymmetric Reinforcement Learning (CARL) model in which artificial agents observe others' actions and rewards, and update this information asymmetrically. We use agent-based simulations to study how confirmation bias affects collective performance on a two-armed bandit task, and how resource scarcity, group size and bias strength modulate this effect. We find that a confirmation bias benefits group learning across a wide range of resource-scarcity conditions. Moreover, we discover that, past a critical bias strength, resource abundance favors the emergence of two different performance regimes, one of which is suboptimal. In addition, we find that this regime bifurcation comes with polarization in small groups of agents. Overall, our results suggest the existence of an optimal, moderate level of confirmation bias for decision-making in a social context. Clémence Bergerot, Wolfram Barfuss, Pawel Romanczuk |
PLoS Comput. Biol. | 2 |
| 2022 | Dynamical systems as a level of cognitive analysis of multi-agent learningabstractA dynamical systems perspective on multi-agent learning, based on the link between evolutionary game theory and reinforcement learning, provides an improved, qualitative understanding of the emerging collective learning dynamics. However, confusion exists with respect to how this dynamical systems account of multi-agent learning should be interpreted. In this article, I propose to embed the dynamical systems description of multi-agent learning into different abstraction levels of cognitive analysis. The purpose of this work is to make the connections between these levels explicit in order to gain improved insight into multi-agent learning. I demonstrate the usefulness of this framework with the general and widespread class of temporal-difference reinforcement learning. I find that its deterministic dynamical systems description follows a minimum free-energy principle and unifies a boundedly rational account of game theory with decision-making under uncertainty. I then propose an on-line sample-batch temporal-difference algorithm which is characterized by the combination of applying a memory-batch and separated state-action value estimation. I find that this algorithm serves as a micro-foundation of the deterministic learning equations by showing that its learning trajectories approach the ones of the deterministic learning equations under large batch sizes. Ultimately, this framework of embedding a dynamical systems description into different abstraction levels gives guidance on how to unleash the full potential of the dynamical systems approach to multi-agent learning. Wolfram Barfuss |
Neural Comput. Appl. | 1 |