Demo Data from VLDB 2026 / reviewers in the wild / expert
Tobias Galla
dblp:71/9059
· DBLP profile ↗
2ranked-venue papers
0as first author
1since 2021 · last 2025
0000-0003-3402-2163ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1
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 · 100% | |
| Theoretical computer science
1 paper |
Algorithmic game theory and mechanism design · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning
multi-agent reinforcement learning |
0.9 | 1 | 2025 | Asymptotic Extinction in Large Coordination Games · AAAI 2025 |
Machine learning › Reinforcement learning › value-based reinforcement learning
q-learning |
0.9 | 1 | 2025 | Asymptotic Extinction in Large Coordination Games · AAAI 2025 |
Algorithmic game theory and mechanism design › equilibrium analysis
equilibrium selection |
0.9 | 1 | 2025 | Asymptotic Extinction in Large Coordination Games · AAAI 2025 |
Algorithmic game theory and mechanism design › solution concepts in games › equilibrium concepts
quantal response equilibrium |
0.9 | 1 | 2025 | Asymptotic Extinction in Large Coordination Games · AAAI 2025 |
Methods — techniques the papers use, named apart from their topics
q-learning · 1.7generating-functional method · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Asymptotic Extinction in Large Coordination GamesabstractWe study the exploration-exploitation trade-off for large multiplayer coordination games where players strategise via Q-Learning, a common learning framework in multi-agent reinforcement learning. Q-Learning is known to have two shortcomings, namely non-convergence and potential equilibrium selection problems, when there are multiple fixed points, called Quantal Response Equilibria (QRE). Furthermore, whilst QRE have full support for finite games, it is not clear how Q-Learning behaves as the game becomes large. In this paper, we characterise the critical exploration rate that guarantees convergence to a unique fixed point, addressing the two shortcomings above. Using a generating-functional method, we show that this rate increases with the number of players and the alignment of their payoffs. For many-player coordination games with perfectly aligned payoffs, this exploration rate is roughly twice that of p-player zero-sum games. As for large games, we provide a structural result for QRE, which suggests that as the game size increases, Q-Learning converges to a QRE near the boundary of the simplex of the action space, a phenomenon we term asymptotic extinction, where a constant fraction of the actions are played with zero probability at a rate o(1/N) for an N -action game. Desmond Chan, Bart de Keijzer, Tobias Galla, Stefanos Leonardos, Carmine Ventre |
AAAI | 3 |
| 2019 | Motion, fixation probability and the choice of an evolutionary processabstractSeemingly minor details of mathematical and computational models of evolution are known to change the effect of population structure on the outcome of evolutionary processes. For example, birth-death dynamics often result in amplification of selection, while death-birth processes have been associated with suppression. In many biological populations the interaction structure is not static. Instead, members of the population are in motion and can interact with different individuals at different times. In this work we study populations embedded in a flowing medium; the interaction network is then time dependent. We use computer simulations to investigate how this dynamic structure affects the success of invading mutants, and compare these effects for different coupled birth and death processes. Specifically, we show how the speed of the motion impacts the fixation probability of an invading mutant. Flows of different speeds interpolate between evolutionary dynamics on fixed heterogeneous graphs and well-stirred populations; this allows us to systematically compare against known results for static structured populations. We find that motion has an active role in amplifying or suppressing selection by fragmenting and reconnecting the interaction graph. While increasing flow speeds suppress selection for most evolutionary models, we identify characteristic responses to flow for the different update rules we test. In particular we find that selection can be maximally enhanced or suppressed at intermediate flow speeds. Francisco Herrerías-Azcué, Vicente Pérez-Muñuzuri, Tobias Galla |
PLoS Comput. Biol. | 3 |