Game of Trust: How Trustworthy Does Your Blockchain Think You Are?

• URL: http://arxiv.org/abs/2505.14551v2
• Date: Thu, 09 Oct 2025 18:50:19 GMT
• Title: Game of Trust: How Trustworthy Does Your Blockchain Think You Are?
• Abstract summary: We investigate how a blockchain can distill the collective belief of its nodes regarding the trustworthiness of a (sub)set of nodes into a em reputation system that reflects the probability of correctly performing a task.<n>We propose a new class of games, called Trustworthy Reputation games (TRep games), which aim to extract the collective beliefs on trust from the actions of rational participants.
• Score: 13.895485424939329
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We investigate how a blockchain can distill the collective belief of its nodes regarding the trustworthiness of a (sub)set of nodes into a {\em reputation system} that reflects the probability of correctly performing a task. To address this question, we introduce a framework that breaks it down into two sub-problems: 1. (Information Extraction): How can the system distill trust information from a function of the nodes' true beliefs? 2. (Incentive Design): How can we incentivize nodes to truthfully report such information? To tackle the first sub-problem, we adapt, in a non-trivial manner, the well-known PageRank algorithm to our problem. For the second, we define a new class of games, called Trustworthy Reputation games (TRep games), which aim to extract the collective beliefs on trust from the actions of rational participants. We then propose a concrete TRep game whose utility function leverages Personalized PageRank and can be instantiated through a straightforward blockchain rewards mechanism. Building on this, we show how the TRep game enables the design of a reputation system. Such systems can enhance the robustness, scalability, and efficiency of blockchain and DeFi solutions. For instance, we demonstrate how such a system can be used within a Proof-of-Reputation blockchain.

Related papers

• SEDULity: A Proof-of-Learning Framework for Distributed and Secure Blockchains with Efficient Useful Work [41.41842611951311]
  We name the framework SEDULity, which stands for a Secure, Efficient, Distributed, and Useful Learning-based blockchain system.<n>We show that our framework is distributed, secure, and efficiently trains ML models.<n>We further demonstrate that the proposed PoL framework can be extended to other types of useful work and design an incentive mechanism to incentivize task verification.
  arXiv  Detail & Related papers  (2025-12-15T18:55:20Z)
• Critical or Compliant? The Double-Edged Sword of Reasoning in Chain-of-Thought Explanations [60.27156500679296]
  We study the role of Chain-of-Thought (CoT) explanations in moral scenarios by systematically perturbing reasoning chains and manipulating delivery tones.<n>Our findings reveal two key effects: (1) users often trust with outcome agreement, sustaining reliance even when reasoning is flawed.<n>These results highlight how CoT explanations can simultaneously clarify and mislead, underscoring the need for NLP systems to provide explanations that encourage scrutiny and critical thinking rather than blind trust.
  arXiv  Detail & Related papers  (2025-11-15T02:38:49Z)
• Deceptive Sequential Decision-Making via Regularized Policy Optimization [54.38738815697299]
  Two regularization strategies for policy synthesis problems that actively deceive an adversary about a system's underlying rewards are presented.<n>We show how each form of deception can be implemented in policy optimization problems.<n>We show that diversionary deception can cause the adversary to believe that the most important agent is the least important, while attaining a total accumulated reward that is $98.83%$ of its optimal, non-deceptive value.
  arXiv  Detail & Related papers  (2025-01-30T23:41:40Z)
• A Game-Theoretic Approach to the Study of Blockchain's Robustness [0.0]
  This thesis investigates the robustness of blockchain protocols, specifically focusing on Proof-of-Stake.<n>We define robustness in terms of two critical properties: Safety, which ensures that the blockchain will not have permanent conflicting blocks, and Liveness, which guarantees the continuous addition of new reliable blocks.<n>Our research addresses the gap between traditional distributed systems approaches, which classify agents as either honest or Byzantine (i.e. malicious or faulty), and game-theoretic models that consider rational agents driven by incentives.
  arXiv  Detail & Related papers  (2024-11-28T14:29:14Z)
• GRATR: Zero-Shot Evidence Graph Retrieval-Augmented Trustworthiness Reasoning [7.3795957796342195]
  Trustworthiness reasoning aims to enable agents in multiplayer games with incomplete information to identify potential allies and adversaries.<n>We introduce the graph retrieval-augmented trustworthiness reasoning (GRATR) framework, which retrieves observable evidence from the game environment.
  arXiv  Detail & Related papers  (2024-08-22T12:21:22Z)
• HSVI-based Online Minimax Strategies for Partially Observable Stochastic Games with Neural Perception Mechanisms [31.51588071503617]
  We consider a variant of continuous-state partially-observable games with neural perception mechanisms and an asymmetric information structure. One agent has partial information, while the other agent is assumed to have full knowledge of the state. We present an efficient online method to compute an $varepsilon$-minimax strategy profile for each agent.
  arXiv  Detail & Related papers  (2024-04-16T15:58:20Z)
• Tie-Breaking Rule Based on Partial Proof of Work in a Blockchain [2.9281463284266973]
  We propose another countermeasure that can be easily applied to existing proof of work blockchain systems. By using the characteristic of partial proof of work, the proposed method enables miners to choose the last-generated block in a chain tie. Only weak synchrony, which is already met by existing systems such as Bitcoin, is required for effective functioning.
  arXiv  Detail & Related papers  (2024-03-22T08:24:12Z)
• Graph Attention Network-based Block Propagation with Optimal AoI and Reputation in Web 3.0 [59.94605620983965]
  We design a Graph Attention Network (GAT)-based reliable block propagation optimization framework for blockchain-enabled Web 3.0. To achieve the reliability of block propagation, we introduce a reputation mechanism based on the subjective logic model. Considering that the GAT possesses the excellent ability to process graph-structured data, we utilize the GAT with reinforcement learning to obtain the optimal block propagation trajectory.
  arXiv  Detail & Related papers  (2024-03-20T01:58:38Z)
• User Strategization and Trustworthy Algorithms [81.82279667028423]
  We show that user strategization can actually help platforms in the short term. We then show that it corrupts platforms' data and ultimately hurts their ability to make counterfactual decisions.
  arXiv  Detail & Related papers  (2023-12-29T16:09:42Z)
• MRL-PoS: A Multi-agent Reinforcement Learning based Proof of Stake Consensus Algorithm for Blockchain [0.18641315013048293]
  This paper introduces MRL-PoS, a Proof-of-Stake consensus algorithm based on multi-agent reinforcement learning. It incorporates a system of rewards and penalties to eliminate malicious nodes and incentivize honest ones.
  arXiv  Detail & Related papers  (2023-12-14T16:58:18Z)
• A Diachronic Perspective on User Trust in AI under Uncertainty [52.44939679369428]
  Modern NLP systems are often uncalibrated, resulting in confidently incorrect predictions that undermine user trust. We study the evolution of user trust in response to trust-eroding events using a betting game.
  arXiv  Detail & Related papers  (2023-10-20T14:41:46Z)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)
• SoK: Blockchain Governance [13.95507600720467]
  The topic of blockchain governance is a fertile domain for a thorough systematization. We start by distilling a comprehensive array of properties for sound governance systems. While all properties are satisfied, even partially, by at least one system, no system that most of them.
  arXiv  Detail & Related papers  (2022-01-18T18:38:26Z)
• Personalized multi-faceted trust modeling to determine trust links in social media and its potential for misinformation management [61.88858330222619]
  We present an approach for predicting trust links between peers in social media. We propose a data-driven multi-faceted trust modeling which incorporates many distinct features for a comprehensive analysis. Illustrated in a trust-aware item recommendation task, we evaluate the proposed framework in the context of a large Yelp dataset.
  arXiv  Detail & Related papers  (2021-11-11T19:40:51Z)
• A Double-Linked Blockchain Approach Based on Proof-of-Refundable-Tax Consensus Algorithm [0.0]
  We propose a double-linked blockchain data structure that greatly improves blockchain performance and guarantees single chain with no forks. With the proposed proof-of-refundable-tax (PoRT) consensus algorithm, our approach can construct highly reliable, efficient, fair and stable blockchain operations.
  arXiv  Detail & Related papers  (2021-09-14T08:30:32Z)
• Learning to Give Checkable Answers with Prover-Verifier Games [23.93694563816463]
  We introduce Prover-Verifier Games (PVGs), a game-theoretic framework to encourage learning agents to solve decision problems in a verifiable manner. We analyze variants of the framework, including simultaneous and sequential games, and narrow the space down to a subset of games which provably have the desired equilibria. We develop instantiations of the PVG for two algorithmic tasks, and show that in practice, the verifier learns a robust decision rule that is able to receive useful and reliable information from an untrusted prover.
  arXiv  Detail & Related papers  (2021-08-27T02:56:06Z)
• Robust Blockchained Federated Learning with Model Validation and Proof-of-Stake Inspired Consensus [43.12040317316018]
  Federated learning (FL) is a promising distributed learning solution that only exchanges model parameters without revealing raw data. We propose a blockchain-based decentralized FL framework, termed VBFL, by exploiting two mechanisms in a blockchained architecture. With 15% of malicious devices, VBFL achieves 87% accuracy, which is 7.4x higher than Vanilla FL.
  arXiv  Detail & Related papers  (2021-01-09T06:30:38Z)
• Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's Post-Quantum Security [67.06003361150228]
  A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task. In this work, we examine the hardness of finding such chain of PoWs against quantum strategies. We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
  arXiv  Detail & Related papers  (2020-12-30T18:03:56Z)
• How Much Can We Really Trust You? Towards Simple, Interpretable Trust Quantification Metrics for Deep Neural Networks [94.65749466106664]
  We conduct a thought experiment and explore two key questions about trust in relation to confidence. We introduce a suite of metrics for assessing the overall trustworthiness of deep neural networks based on their behaviour when answering a set of questions. The proposed metrics are by no means perfect, but the hope is to push the conversation towards better metrics.
  arXiv  Detail & Related papers  (2020-09-12T17:37:36Z)
• When to (or not to) trust intelligent machines: Insights from an evolutionary game theory analysis of trust in repeated games [0.8701566919381222]
  We study the viability of trust-based strategies in repeated games. These are reciprocal strategies that cooperate as long as the other player is observed to be cooperating. By doing so, they reduce the opportunity cost of verifying whether the action of their co-player was actually cooperative.
  arXiv  Detail & Related papers  (2020-07-22T10:53:49Z)
• Byzantine-resilient Decentralized Stochastic Gradient Descent [85.15773446094576]
  We present an in-depth study towards the Byzantine resilience of decentralized learning systems. We propose UBAR, a novel algorithm to enhance decentralized learning with Byzantine Fault Tolerance.
  arXiv  Detail & Related papers  (2020-02-20T05:11:04Z)
• Signaling in Bayesian Network Congestion Games: the Subtle Power of Symmetry [66.82463322411614]
  The paper focuses on the problem of optimal ex ante persuasive signaling schemes, showing that symmetry is a crucial property for its solution. We show that an optimal ex ante persuasive scheme can be computed in time when players are symmetric and have affine cost functions.
  arXiv  Detail & Related papers  (2020-02-12T19:38:15Z)

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.