Learning to agree over large state spaces
From MaRDI portal
Publication:2138382
DOI10.1016/J.JMATECO.2022.102654zbMATH Open1490.91025arXiv2105.06313OpenAlexW4211147351MaRDI QIDQ2138382FDOQ2138382
Authors: Michele Crescenzi
Publication date: 11 May 2022
Published in: Journal of Mathematical Economics (Search for Journal in Brave)
Abstract: We study how a consensus emerges in a finite population of like-minded individuals who are asymmetrically informed about the realization of the true state of the world. Agents observe a private signal about the state and then start exchanging messages. Generalizing the classical model of rational dialogues of Geanakoplos and Polemarchakis (1982) and its subsequent extensions, we dispense with the standard assumption that the state space is a probability space and we do not put any bound on the cardinality of the state space itself or the information partitions. We show that a class of rational dialogues can be found that always lead to consensus provided that three main conditions are met. First, everybody must be able to send messages to everybody else, either directly or indirectly. Second, communication must be reciprocal. Finally, agents need to have the opportunity to engage in dialogues of transfinite length.
Full work available at URL: https://arxiv.org/abs/2105.06313
Recommendations
- Learning heuristic functions for large state spaces
- Cooperative learning with joint state value approximation for multi-agent systems
- Learning with policy prediction in continuous state-action multi-agent decision processes
- Towards building agreement spaces using consensus networks
- On State Aggregation to Approximate Complex Value Functions in Large-Scale Markov Decision Processes
- Distributed consensus-based multi-agent temporal-difference learning
Cites Work
- Title not available (Why is that?)
- Long Cheap Talk
- Agreeing to disagree
- Some extensions of a claim of Aumann in an axiomatic model of knowledge
- We can't disagree forever
- A note on the implications of common knowledge of rationality
- Communication, consensus, and knowledge
- Learning to agree
- Communication and learning
- Title not available (Why is that?)
- Information aggregation in dynamic markets with strategic traders
- A general framework for rational learning in social networks
- Counterfactuals in ``agreeing to disagree type results
- Agreeing to disagree: the non-probabilistic case
- Knowledge spaces with arbitrarily high rank
- Comment of consensus without common knowledge
- Common knowledge and consensus with noisy communication
- Protocols forcing consensus
- On consensus through communication without a commonly known protocol
- Common knowledge, communication, and convergence of beliefs
- Asymptotic agreement among communicating decisionmakers
- We eventually agree
- Chains, antichains, and complements in infinite partition lattices
- Consensus, communication and knowledge: an extension with Bayesian agents
- Title not available (Why is that?)
This page was built for publication: Learning to agree over large state spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2138382)