Demo Data from VLDB 2026 / reviewers in the wild / expert
Alireza Rezaeimoghadam
dblp:399/5456
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2026
0009-0007-2196-2558ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 2 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 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 |
Approximation and online algorithms · 57% Algorithmic game theory and mechanism design · 43% | |
| Network and information security
1 paper |
Privacy and data protection · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Approximation and online algorithms › online learning
bandit |
2.0 | 2 | 2026 | Anonymous Linear Bandits for Multi-User Systems · WWW 2026 Differentially Private Anonymous Bandits for Multi-User Systems · WWW 2026 |
Approximation and online algorithms
online learning |
2.0 | 2 | 2026 | Anonymous Linear Bandits for Multi-User Systems · WWW 2026 Differentially Private Anonymous Bandits for Multi-User Systems · WWW 2026 |
Privacy and data protection
differential privacy |
1.0 | 1 | 2026 | Differentially Private Anonymous Bandits for Multi-User Systems · WWW 2026 |
Algorithmic game theory and mechanism design › multi-armed bandit
linear bandits |
1.0 | 1 | 2026 | Anonymous Linear Bandits for Multi-User Systems · WWW 2026 |
Algorithmic game theory and mechanism design
matching |
1.0 | 1 | 2026 | Anonymous Linear Bandits for Multi-User Systems · WWW 2026 |
Algorithmic game theory and mechanism design
resource allocation |
1.0 | 1 | 2026 | Anonymous Linear Bandits for Multi-User Systems · WWW 2026 |
Methods — techniques the papers use, named apart from their topics
successive elimination · 1.0greedy matching · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Differentially Private Anonymous Bandits for Multi-User Systems
Mohammad Reza Badri, Hossein Esfandiari, Samira Hossein Ghorban, Alireza Rezaeimoghadam |
WWW | 4 |
| 2026 | Anonymous Linear Bandits for Multi-User SystemsabstractWe provide the first anonymity-preserving algorithm for a centralized decision maker in linear bandit-based multi-user systems. Our algorithm employs successive elimination techniques for linear bandits to build an assignment multi-graph (from users to arms) along with a greedy matching algorithm that efficiently allocates the arms to users. We provide lower and upper bounds for this problem, showing that our algorithm is regret optimal up to a √(CK) factor. Mohammad Reza Badri, Hossein Esfandiari, Samira Hossein Ghorban, Alireza Rezaeimoghadam |
WWW | 4 |