Search arXivSearch

arXiv · 2603.28705

Belief-Aware Pivotal Mechanism for DAO Committees

Abstract

Decentralized Autonomous Organizations (DAOs) increasingly delegate decisions to small committees whose members hold two independent kinds of private information: idiosyncratic preferences over alternatives (what they want) and beliefs about which alternative best serves the organization (what they know). Members have no reason to reveal what they know unless they are incentivized to do so. Standard voting rules are designed to extract only what members want. If these two pieces of information are not aligned, the organization can end up making a suboptimal decision. Existing mechanisms for eliciting (extracting) beliefs from experts, such as Decision Scoring Rules and Decision Markets, face well-known impossibility results in multi-agent settings under deterministic decision rules, and ignore the fact that agents can have idiosyncratic preferences over alternatives. This paper proposes a mechanism for binary committee decisions that augments the pivotal mechanism, an instance of the Groves mechanism, with a reward that depends on the outcome distributed after a boolean signal, indicating success or failure of the outcome, is observed. The mechanism aggregates the experts' private information to maximize the probability that its decision agrees with a weighted linear pooling of the experts' beliefs, framing the designer's problem as classification rather than welfare maximization. An affine family of reward rules is proposed, and the region of parameters that simultaneously satisfy dominant-strategy incentive compatibility, interim individual rationality, and budget feasibility is derived. In informative-belief environments, the mechanism outperforms majority voting, including majority voting augmented with the same outcome-contingent rewards, especially when the committee's average preferences are biased against the superior alternative.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nuno Braz, Miguel Correia, Diogo Poças. 2026-08-25. Belief-Aware Pivotal Mechanism for DAO Committees. https://arxiv.org/abs/2603.28705

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Learning in Structured Stackelberg Games

We initiate the study of structured Stackelberg games, a novel form of strategic interaction between a leader and a follower where contextual information can be predictive of the follower's (unknown) type. Motivated by applications such as security games and AI safety, we show how this additional structure can help the leader learn a utility-maximizing policy in both the online and distributional settings. In the online setting, we first prove that standard learning-theoretic measures of complexity do not characterize the difficulty of the leader's learning task. Notably, we find that there exists a learning-theoretic measure of complexity, analogous to the Littlestone dimension in online classification, that tightly characterizes the leader's instance-optimal regret. We term this the Stackelberg-Littlestone dimension, and leverage it to provide a provably optimal online learning algorithm. In the distributional setting, we provide analogous results by showing that two new dimensions control the sample complexity upper- and lower-bound.

cs.GT

Equilibrium and Infeasibility: A new solution concept for games

Addressing infeasibility in non-cooperative games has become an important topic, as many problems across different applications face this issue. In this paper, we propose a new solution concept for generalized games with possibly infeasible individual constraints. A solution is defined as the limit of a sequence of generalized Nash equilibria induced by games with penalty terms relaxing the individual constraints. Existence is established for a broad range of games and we provide conditions allowing to characterize a $ψ$-penalized solution as a strategy profile maximizing every player's utility over all her penalty minimizing strategies. A variation of Divide-the-Dollar serves as an illustrative example. We further establish the compatibility with the GNE and the solution to the Nash bargaining.

cs.GT

Subgame-Perfect Nash Equilibria of Plurality Voting with Abstention: a PSPACE-Completeness Result for Restricted Ballots

We consider sequential Plurality elections in which each voter may abstain or vote for a single candidate. Each voter assigns utilities to all candidates; for each voter, this induces a (weak) order over the candidates. Ties are resolved uniformly at random, and voting has a small positive cost, so that a voter prefers to abstain when their vote cannot change the election outcome. We consider a variant of this model where, for each voter, we additionally specify a prefix of her ranking, so that she is only allowed to vote for a candidate from that prefix (or abstain). We prove that for this variant of the model, deciding whether a designated candidate is among the election winners in a subgame-perfect equilibrium of the associated extensive-form game is PSPACE-complete. This partially resolves an open problem from the work of Desmedt and Elkind [2010].

cs.GT