π€ AI Summary
Traditional voting mechanisms struggle to support fine-grained preference expression across heterogeneous domainsβsuch as proposals, participants, and hybrid sets. To address this, we propose a score-based proxy voting mechanism that enables voters to dynamically allocate vote weights over multidimensional objects according to expected utility, formalized via a preference-weighted voting matrix. Crucially, we introduce an absorbing Markov chain model to quantify node influence and capture cross-domain preference propagation. Our multidimensional preference allocation algorithm was evaluated in a budget-allocation experiment involving 69 participants. Results demonstrate significantly improved interpretability of consensus outcomes and accurate identification of pivotal influence nodes. This work establishes a novel paradigm for aggregating complex, heterogeneous preferences in decentralized governance systems.
π Abstract
This paper proposes a voting process in which voters allocate fractional votes to their expected utility in different domains: over proposals, other participants, and sets containing proposals and participants. This approach allows for a more nuanced expression of preferences by calculating the result and relevance within each node. We modeled this by creating a voting matrix that reflects their preference. We use absorbing Markov chains to gain the consensus, and also calculate the influence within the participating nodes. We illustrate this method in action through an experiment with 69 students using a budget allocation topic.