Demo Data from EDBT 2026 / reviewers in the wild / expert
Matthew O. Jackson
dblp:36/5034
· DBLP profile ↗
4ranked-venue papers
2as first author
0since 2021 · last 2020
0000-0001-9846-4249ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 4 · 2 first-authorArtificial intelligence and machine learning · 3 · 2 first-author
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
3 papers |
Graph algorithms and graph theory · 41% Algorithmic game theory and mechanism design · 30% Distributed computing theory · 29% | |
| Interdisciplinary, comprehensive, and emerging computing
2 papers |
Computational social science and digital humanities · 100% |
Topics — the 11 heaviest of 11, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed computing theory
information dissemination |
0.5 | 2 | 2017 | Diffusion in Networks and the Unexpected Virtue of Burstiness · EC 2017 Centrality, gossip, and diffusion of information in networks · EC 2014 |
Computational social science and digital humanities › social network analysis
information diffusion |
0.4 | 1 | 2020 | Learning through the Grapevine: The Impact of Message Mutation, Transmission Failure, and Deliberate Bias · EC 2020 |
Algorithmic game theory and mechanism design › mechanism design
information design |
0.4 | 1 | 2020 | Learning through the Grapevine: The Impact of Message Mutation, Transmission Failure, and Deliberate Bias · EC 2020 |
Graph algorithms and graph theory › network analysis
network diffusion |
0.3 | 1 | 2017 | Diffusion in Networks and the Unexpected Virtue of Burstiness · EC 2017 |
Graph algorithms and graph theory › network analysis
network dynamics |
0.3 | 1 | 2017 | Diffusion in Networks and the Unexpected Virtue of Burstiness · EC 2017 |
Graph algorithms and graph theory
centrality |
0.2 | 1 | 2014 | Centrality, gossip, and diffusion of information in networks · EC 2014 |
Distributed computing theory › information dissemination
gossip protocols |
0.2 | 1 | 2014 | Centrality, gossip, and diffusion of information in networks · EC 2014 |
Graph algorithms and graph theory
network analysis |
0.2 | 1 | 2014 | Centrality, gossip, and diffusion of information in networks · EC 2014 |
Algorithmic game theory and mechanism design
network games |
0.2 | 1 | 2014 | Centrality, gossip, and diffusion of information in networks · EC 2014 |
Computational social science and digital humanities
social network analysis |
0.1 | 1 | 2017 | Diffusion in Networks and the Unexpected Virtue of Burstiness · EC 2017 |
Algorithmic game theory and mechanism design › network economics
network formation |
0.1 | 1 | 2014 | Centrality, gossip, and diffusion of information in networks · EC 2014 |
Methods — techniques the papers use, named apart from their topics
threshold analysis · 0.9bayesian learning · 0.9stochastic process modeling · 0.6burstiness analysis · 0.6network theory · 0.2centrality measure · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Learning through the Grapevine: The Impact of Message Mutation, Transmission Failure, and Deliberate BiasabstractWe examine how well people learn when information is noisily relayed from person to person, subject to: dropping, mutation, and deliberate manipulation. This allows us to explore how communication platforms can improve learning without censoring or even examining messages, but purely by limiting the number of times a message can be relayed or the number of people to whom someone can forward a message. In particular, we analyze learning as a function of the network depth (length of relay chains) and breadth (how many chains a person has access to). Noise builds up as depth increases and so learning requires greater breadth, which we show to be characterized via a sharp threshold above which the receiver learns fully and below which the receiver learns nothing. Moreover, we show that small uncertainty about the rates of mis- and dis-information make learning from long chains of messages impossible. Optimizing learning requires either limiting depth (by controlling how many times a message can be forwarded), or if that is not possible then limiting breadth (by capping the number of people to whom someone can forward a message). Although limiting breadth decreases the overall amount of information a learner has access to, it increases the relative fraction of messages that are coming from nearby compared to far away in the network, and thus increases the signal to noise ratio. Such policies do not require the ability to fact-check, respect privacy, increase the fraction of true to false messages, and have been implemented by communication platforms. Finally, we extend our model to study learning from dropping rates (e.g., people are more likely to pass messages with one conclusion than another). We find that as the distance to primary sources grows, all learning comes from either the total number of messages received or from the content of received messages, but the learner does not need to pay attention to both. Matthew O. Jackson, Suraj Malladi, David McAdams |
EC | 1 |
| 2017 | Diffusion in Networks and the Unexpected Virtue of BurstinessabstractWhether an idea, information, disease, or innovation diffuses throughout a society depends not only on the structure of the network of interactions, but also on the timing of those interactions. Recent studies have shown that diffusion can fail on a network in which people are only active in "bursts," active for a while and then silent for a while, but diffusion could succeed on the same network if people were active in a more random Poisson manner. Those studies generally consider models in which nodes are active according to the same random timing process and then ask which timing is optimal. In reality, people differ widely in their activity patterns -- some are bursty and others are not. We model diffusion on networks in which agents differ in their activity patterns. We show that bursty behavior does not always hurt the diffusion, and in fact having some (but not all) of the population be bursty significantly helps diffusion. We prove that maximizing diffusion requires heterogeneous activity patterns across agents, and the overall maximizing pattern of agents' activity times does not involve any Poisson behavior. Mohammad Akbarpour, Matthew O. Jackson |
EC | 2 |
| 2014 | Centrality, gossip, and diffusion of information in networksabstractHow can we identify the most influential nodes in a network for initiating diffusion? Are people able to easily identify those people in their communities who are best at spreading information, and if so How? Using theory and recent data, we will examine these questions and see how the structure of social networks affects information transmission ranging from gossip to the diffusion of new products. In particular, the concept of diffusion centrality from Banerjee, Chandrasekhar, Duflo, and Jackson (2013) will be considered and shown to nest degree centrality, eigenvector centrality, and other measures of centrality as extreme special cases. Then it will be shown that by tracking gossip within a network, nodes can easily learn to rank the centrality of other nodes without knowing anything about the network itself. Finally, the theoretical predictions will be tested with data. The results are presented in Banerjee, Chandrasekhar, Duflo, and Jackson (2014). Matthew O. Jackson |
EC | 1 |
| 2003 | Categorical cognition: a psychological model of categories and identification in decision making: extended abstractabstractArticle Categorical cognition: a psychological model of categories and identification in decision making: extended abstract Share on Authors: Roland G. Fryer University of Chicago, Chicago, Illinois University of Chicago, Chicago, IllinoisView Profile , Matthew O. Jackson Institute of Technology, Pasadena, California Institute of Technology, Pasadena, CaliforniaView Profile Authors Info & Claims TARK '03: Proceedings of the 9th conference on Theoretical aspects of rationality and knowledgeJune 2003 Pages 29–34https://doi.org/10.1145/846241.846245Online:20 June 2003Publication History 1citation593DownloadsMetricsTotal Citations1Total Downloads593Last 12 Months37Last 6 weeks3 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access Roland G. Fryer, Matthew O. Jackson |
TARK | 2 |