Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Manuel Mueller-Frank

dblp:157/0077 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
2since 2021 · last 2023
0000-0001-5186-8094ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 2 since 2021Theory of computation · 3 · 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
3 papers
Algorithmic game theory and mechanism design · 100%
Artificial intelligence
2 papers
Probabilistic and Bayesian machine learning · 64% Knowledge representation and reasoning · 36%

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

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design › prediction markets
information aggregation
1.022023
The Wisdom of the Crowd and Higher-Order Beliefs · EC 2023
Social Learning Equilibria · EC 2018
Algorithmic game theory and mechanism design
mechanism design
0.712023
The Wisdom of the Crowd and Higher-Order Beliefs · EC 2023
Algorithmic game theory and mechanism design › prediction markets › information aggregation
wisdom of the crowds
0.712023
The Wisdom of the Crowd and Higher-Order Beliefs · EC 2023
Algorithmic game theory and mechanism design › multi-agent systems › multi-agent learning
social learning
0.512021
Sequential Naive Learning · EC 2021
Algorithmic game theory and mechanism design › solution concepts in games
equilibrium concepts
0.312018
Social Learning Equilibria · EC 2018
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
bayesian inference
0.212023
The Wisdom of the Crowd and Higher-Order Beliefs · EC 2023
Knowledge, reasoning and agents › Knowledge representation and reasoning › belief change
belief merging
0.212023
The Wisdom of the Crowd and Higher-Order Beliefs · EC 2023
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference › bayesian computation
bayesian updating
0.112021
Sequential Naive Learning · EC 2021

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

econometric identification · 1.3bayesian inference · 1.3probability matching · 1.0degroot rule · 1.0asymptotic analysis · 0.3
YearPublicationVenuePosition
2023 The Wisdom of the Crowd and Higher-Order Beliefs
abstract
The classic wisdom-of-the-crowd problem asks how a principal can "aggregate" information about an unknown state of the world from agents without understanding the information structure among them. Such aggregation obviously has large social and private value, especially when it concerns important social or economic events. Therefore, it is important to understand the limits of such an exercise: without specific assumptions on the information agents have, how can we aggregate it? Classic results by Prelec et al. [2017] (henceforth PSM) and Arieli et al. [2017] show that that even when agents' signals are i.i.d. conditional on the state, knowing the first-order beliefs of even an infinite set of agents is generally not sufficient to learn the state. In the terminology of econometrics, there is an "identification problem."
Manuel Mueller-Frank, Mallesh M. Pai
EC2
2021 Sequential Naive Learning
abstract
We analyze boundedly rational updating from aggregate statistics in a model with binary actions and binary states. Agents each take an irreversible action in sequence after observing the unordered set of previous actions. Each agent first forms her prior based on the aggregate statistic, then incorporates her signal with the prior based on Bayes rule, and finally applies a decision rule that assigns a (mixed) action to each belief. If priors are formed according to a discretized DeGroot rule, then actions converge to the state (in probability), i.e., asymptotic learning, in any informative information structure if and only if the decision rule satisfies probability matching. This result generalizes to unspecified information settings where information structures differ across agents and agents know only the information structure generating their own signal. Also, the main result extends to the case of n states and n actions.
Itai Arieli, Yakov Babichenko, Manuel Mueller-Frank
EC3
2018 Social Learning Equilibria
abstract
We consider social learning settings in which a group of agents face uncertainty regarding a state of the world, observe private signals, share the same utility function, and act in a general dynamic setting. We introduce Social Learning Equilibria, a static equilibrium concept that abstracts away from the details of the given dynamics, but nevertheless captures the corresponding asymptotic equilibrium behavior. We establish strong equilibrium properties on agreement, herding, and information aggregation.
Elchanan Mossel, Manuel Mueller-Frank, Allan Sly, Omer Tamuz
EC2