DeepAI AI Chat
Log In Sign Up

Composite Consensus-Building Process: Permissible Meeting Analysis and Compromise Choice Exploration

by   Yasuhiro Asa, et al.

In solving today's social issues, it is necessary to determine solutions that are acceptable to all stakeholders and collaborate to apply them. The conventional technology of "permissive meeting analysis" derives a consensusable choice that falls within everyone's permissible range through mathematical analyses; however, it tends to be biased toward the majority in a group, making it difficult to reach a consensus when a conflict arises. To support consensus building (defined here as an acceptable compromise that not everyone rejects), we developed a composite consensus-building process. The developed process addresses this issue by combining permissible meeting analysis with a new "compromise choice-exploration" technology, which presents a consensusable choice that emphasizes fairness and equality among everyone when permissible meeting analysis fails to do so. When both permissible meeting analysis and compromise choice exploration do not arrive at a consensus, a facility is provided to create a sublated choice among those provided by them. The trial experimental results confirmed that permissive meeting analysis and compromise choice exploration are sufficiently useful for deriving consensusable choices. Furthermore, we found that compromise choice exploration is characterized by its ability to derive choices that control the balance between compromise and fairness. Our proposed composite consensus-building approach could be applied in a wide range of situations, from local issues in municipalities and communities to international issues such as environmental protection and human rights issues. It could also aid in developing digital democracy and platform cooperativism.


page 1

page 2

page 3

page 4


Positionality-Weighted Aggregation Methods on Cumulative Voting

The issue in solving social problems is how to respect minority opinions...

The Bedrock of BFT: A Unified Platform for BFT Protocol Design and Implementation

Byzantine fault-tolerant protocols cover a broad spectrum of design dime...

Let's Agree to Agree: Targeting Consensus for Incomplete Preferences through Majority Dynamics

We study settings in which agents with incomplete preferences need to ma...

FairFuse: Interactive Visual Support for Fair Consensus Ranking

Fair consensus building combines the preferences of multiple rankers int...

Paving the Way for Consensus: Convergence of Block Gossip Algorithms

Gossip protocols are popular methods for average consensus problems in d...

A Text Analysis of Federal Reserve meeting minutes

Recent developments in monetary policy by the Federal Reserve has create...