Nat Sothanaphan

dblp:176/9986 · DBLP profile ↗
← Back
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 · 50% Distributed computing theory · 25% Graph algorithms and graph theory · 25%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational social science and digital humanities · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design › social choice
belief aggregation
0.312018
Naive Bayesian Learning in Social Networks · EC 2018
Graph algorithms and graph theory
centrality
0.312018
Naive Bayesian Learning in Social Networks · EC 2018
Distributed computing theory
consensus
0.312018
Naive Bayesian Learning in Social Networks · EC 2018
Algorithmic game theory and mechanism design › multi-agent systems › multi-agent learning
social learning
0.312018
Naive Bayesian Learning in Social Networks · EC 2018
Computational social science and digital humanities › socio-technical systems
technology adoption
0.112018
Naive Bayesian Learning in Social Networks · EC 2018

Methods — techniques the papers use, named apart from their topics

degroot model · 0.7bayesian updating · 0.7
YearPublicationVenuePosition
2018 Naive Bayesian Learning in Social Networks
abstract
The DeGroot model of naive social learning assumes that agents only communicate scalar opinions. In practice, agents communicate not only their opinions, but their confidence in such opinions. We propose a model that captures this aspect of communication by incorporating signal informativeness into the naive social learning scenario. Our proposed model captures aspects of both Bayesian and naive learning. Agents in our model combine their neighbors' beliefs using Bayes' rule, but the agents naively assume that their neighbors' beliefs are independent. Depending on the initial beliefs, agents in our model may not reach a consensus, but we show that the agents will reach a consensus under mild continuity and boundedness assumptions on initial beliefs. This eventual consensus can be explicitly computed in terms of each agent's centrality and signal informativeness, allowing joint effects to be precisely understood. We apply our theory to adoption of new technology. In contrast to Banerjee et al. [2018], we show that information about a new technology can be seeded initially in a tightly clustered group without information loss, but only if agents can expressively communicate their beliefs.
Jerry Anunrojwong, Nat Sothanaphan
EC2