Learning to agree over large state spaces

DOI10.1016/J.JMATECO.2022.102654MaRDI QIDQ2138382zbMATH OpenOpenAlexFDO

Authors Michele Crescenzi

Publication date 11 May 2022

Published in Journal of Mathematical Economics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2105.06313

zbMATH Keywords

learningconsensuscommon knowledgeagreement theoremrational dialogue

Mathematics Subject Classification ID

Signaling and communication in game theory (91A28) Rationality and learning in game theory (91A26)

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.

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

• scientific article; zbMATH DE number 5367214 (Why is no real title available?)
• scientific article; zbMATH DE number 65756 (Why is no real title available?)
• scientific article; zbMATH DE number 1234441 (Why is no real title available?)
• A general framework for rational learning in social networks
• A note on the implications of common knowledge of rationality
• Agreeing to disagree
• Agreeing to disagree: the non-probabilistic case
• Asymptotic agreement among communicating decisionmakers
• Chains, antichains, and complements in infinite partition lattices
• Comment of consensus without common knowledge
• Common knowledge and consensus with noisy communication
• Common knowledge, communication, and convergence of beliefs
• Communication and learning
• Communication, consensus, and knowledge
• Consensus, communication and knowledge: an extension with Bayesian agents
• Counterfactuals in ``agreeing to disagree type results
• Information aggregation in dynamic markets with strategic traders
• Knowledge spaces with arbitrarily high rank
• Learning to agree
• Long Cheap Talk
• On consensus through communication without a commonly known protocol
• Protocols forcing consensus
• Some extensions of a claim of Aumann in an axiomatic model of knowledge
• We can't disagree forever
• We eventually agree

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)