Demo Data from EDBT 2026 / reviewers in the wild / expert
Nir Hak
dblp:213/7564
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Theory of computation · 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.
| Theoretical computer science
1 paper |
Algorithmic game theory and mechanism design · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithmic game theory and mechanism design › prediction markets
information aggregation |
0.3 | 1 | 2018 | Bayesian Social Learning in a Dynamic Environment · EC 2018 |
Algorithmic game theory and mechanism design › multi-agent systems › multi-agent learning
social learning |
0.3 | 1 | 2018 | Bayesian Social Learning in a Dynamic Environment · EC 2018 |
Methods — techniques the papers use, named apart from their topics
network model · 0.3bayesian inference · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2018 | Bayesian Social Learning in a Dynamic EnvironmentabstractAgents learn about a changing state using private signals and their neighbors' past estimates of the state. We present a model in which Bayesian agents in equilibrium use neighbors' estimates simply by taking weighted sums with time-invariant weights. The dynamics thus parallel those of the tractable DeGroot model of learning in networks, but arise as an equilibrium outcome rather than a behavioral assumption. We examine whether information aggregation is nearly optimal as neighborhoods grow large. A key condition for this is signal diversity: each individual's neighbors have private signals that not only contain independent information, but also have sufficiently different distributions. Without signal diversity---e.g., if private signals are i.i.d.---learning is suboptimal in all networks and highly inefficient in some. Turning to social influence, we find it is much more sensitive to one's signal quality than to one's number of neighbors, in contrast to standard models with exogenous updating rules. Krishna Dasaratha, Benjamin Golub, Nir Hak |
EC | 3 |