Achieving Unanimous Consensus in Decision Making Using Multi-Agents

• URL: http://arxiv.org/abs/2504.02128v1
• Date: Wed, 02 Apr 2025 21:02:54 GMT
• Title: Achieving Unanimous Consensus in Decision Making Using Multi-Agents
• Authors: Apurba Pokharel, Ram Dantu, Shakila Zaman, Sirisha Talapuru, Vinh Quach,
• Abstract summary: This paper introduces a novel deliberation-based consensus mechanism where Large Language Models (LLMs) act as rational agents engaging in structured discussions to reach a unanimous consensus.<n>By leveraging graded consensus and a multi-round deliberation process, our approach ensures both unanimous consensus for definitive problems and graded confidence for prioritized decisions and policies.<n>We also address key challenges with this novel approach such as degeneration of thoughts, hallucinations, malicious models and nodes, resource consumption, and scalability.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Blockchain consensus mechanisms have relied on algorithms such as Proof-of-Work (PoW) and Proof-of-Stake (PoS) to ensure network functionality and integrity. However, these approaches struggle with adaptability for decision-making where the opinions of each matter rather than reaching an agreement based on honest majority or weighted consensus. This paper introduces a novel deliberation-based consensus mechanism where Large Language Models (LLMs) act as rational agents engaging in structured discussions to reach a unanimous consensus. By leveraging graded consensus and a multi-round deliberation process, our approach ensures both unanimous consensus for definitive problems and graded confidence for prioritized decisions and policies. We provide a formalization of our system and use it to show that the properties of blockchains: consistency, agreement, liveness, and determinism are maintained. Moreover, experimental results demonstrate our system's feasibility, showcasing how our deliberation method's convergence, block properties, and accuracy enable decision-making on blockchain networks. We also address key challenges with this novel approach such as degeneration of thoughts, hallucinations, malicious models and nodes, resource consumption, and scalability.

Related papers

• Decentralization in PoS Blockchain Consensus: Quantification and Advancement [10.679753825744964]
  This study quantifies the decentralization of consensus mechanisms in proof-of-stake (PoS) blockchains. We introduce two alternative weighting models for PoS consensus: Square Root Stake Weight (SRSW) and Logarithmic Stake Weight (LSW) Results demonstrate that SRSW and LSW models improve decentralization metrics by an average of 51% and 132%, respectively.
  arXiv  Detail & Related papers  (2025-04-19T16:33:30Z)
• A Fair and Lightweight Consensus Algorithm for IoT [0.0]
  This work introduces a fair and lightweight hybrid consensus algorithm tailored for IoT.<n>The proposed approach minimizes resource demands on the nodes while ensuring a secure and fair agreement process.<n>In addition, a reputation-based block voting mechanism is incorporated to enhance trust and establish finality.
  arXiv  Detail & Related papers  (2025-03-11T16:45:51Z)
• Rule-Based Conflict-Free Decision Framework in Swarm Confrontation [6.618327118416159]
  We propose a novel decision-making framework that integrates probabilistic finite state machine, deep convolutional networks, and reinforcement learning.<n>Our framework overcomes state machine instability and JoD problems, ensuring reliable and adaptable decisions in swarm confrontation.
  arXiv  Detail & Related papers  (2025-03-10T09:00:01Z)
• Decision Making in Changing Environments: Robustness, Query-Based Learning, and Differential Privacy [59.64384863882473]
  We study the problem of interactive decision making in which the underlying environment changes over time subject to given constraints.<n>We propose a framework, which provides an complexity between the complexity and adversarial settings of decision making.
  arXiv  Detail & Related papers  (2025-01-24T21:31:50Z)
• A Trust-Centric Approach To Quantifying Maturity and Security in Internet Voting Protocols [0.9831489366502298]
  This paper introduces a trust-centric maturity scoring framework to quantify the security and maturity of internet voting systems.<n>A comprehensive trust model analysis is conducted for selected internet voting protocols.<n>The framework is general enough to be applied to other systems, where the aspects of decentralization, trust, and security are crucial.
  arXiv  Detail & Related papers  (2024-12-13T23:33:38Z)
• Know Where You're Uncertain When Planning with Multimodal Foundation Models: A Formal Framework [54.40508478482667]
  We present a comprehensive framework to disentangle, quantify, and mitigate uncertainty in perception and plan generation. We propose methods tailored to the unique properties of perception and decision-making. We show that our uncertainty disentanglement framework reduces variability by up to 40% and enhances task success rates by 5% compared to baselines.
  arXiv  Detail & Related papers  (2024-11-03T17:32:00Z)
• Private Online Community Detection for Censored Block Models [60.039026645807326]
  We study the private online change detection problem for dynamic communities, using a censored block model (CBM) We propose an algorithm capable of identifying changes in the community structure, while maintaining user privacy.
  arXiv  Detail & Related papers  (2024-05-09T12:35:57Z)
• Unsealing the secrets of blockchain consensus: A systematic comparison of the formal security of proof-of-work and proof-of-stake [0.40964539027092917]
  The choice of consensus mechanism is at the core of many controversial discussions. PoW-based consensus with the longest chain rule provides the strongest formal security guarantees. PoS can achieve similar guarantees when addressing its more pronounced tradeoff between safety and liveness.
  arXiv  Detail & Related papers  (2024-01-25T21:40:22Z)
• On the Complexity of Adversarial Decision Making [101.14158787665252]
  We show that the Decision-Estimation Coefficient is necessary and sufficient to obtain low regret for adversarial decision making. We provide new structural results that connect the Decision-Estimation Coefficient to variants of other well-known complexity measures.
  arXiv  Detail & Related papers  (2022-06-27T06:20:37Z)
• Towards automated verification of multi-party consensus protocols [0.0]
  Hyperledger Fabric framework exposes a multi-party consensus, based on endorsement policy protocol, to reach a consensus on a transaction. We propose a verification technique of endorsement policies using statistical model checking and hypothesis testing. One can use our technique to design enterprise applications with the Hyperledger Fabric framework.
  arXiv  Detail & Related papers  (2021-12-04T18:28:59Z)
• Uncertainty as a Form of Transparency: Measuring, Communicating, and Using Uncertainty [66.17147341354577]
  We argue for considering a complementary form of transparency by estimating and communicating the uncertainty associated with model predictions. We describe how uncertainty can be used to mitigate model unfairness, augment decision-making, and build trustworthy systems. This work constitutes an interdisciplinary review drawn from literature spanning machine learning, visualization/HCI, design, decision-making, and fairness.
  arXiv  Detail & Related papers  (2020-11-15T17:26:14Z)
• Inverse Active Sensing: Modeling and Understanding Timely Decision-Making [111.07204912245841]
  We develop a framework for the general setting of evidence-based decision-making under endogenous, context-dependent time pressure. We demonstrate how it enables modeling intuitive notions of surprise, suspense, and optimality in decision strategies.
  arXiv  Detail & Related papers  (2020-06-25T02:30:45Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.