Towards Large-Scale Deliberative Decision-Making: Small Groups and the Importance of Triads

@article{Goel2016TowardsLD,
  title={Towards Large-Scale Deliberative Decision-Making: Small Groups and the Importance of Triads},
  author={Ashish Goel and David T. Lee},
  journal={Proceedings of the 2016 ACM Conference on Economics and Computation},
  year={2016}
}
  • Ashish Goel, David T. Lee
  • Published 26 May 2016
  • Mathematics
  • Proceedings of the 2016 ACM Conference on Economics and Computation
Though deliberation is a critical component of democratic decision-making, existing deliberative processes do not scale to large groups of people. Motivated by this, we propose a model in which large-scale decision-making takes place through a sequence of small group interactions. Our model considers a group of participants, each having an opinion which together form a graph. We show that for median graphs, a class of graphs including grids and trees, it is possible to use a small number of… 

Figures from this paper

Sequential Deliberation for Social Choice

TLDR
The general method is described and it is shown that for general metric spaces, the second moment of of the distribution of social cost of the outcomes produced by sequential deliberation is also bounded.

2 A Practical Compromise : Sequential Pairwise Deliberation

In large scale collective decision making, social choice is a normative study of how one ought to design a protocol for reaching consensus. However, in instances where the underlying decision space

Deliberation for Social Choice

In large scale collective decision making, social choice is a normative study of how one ought to design a protocol for reaching consensus. However, in instances where the underlying decision space

Egalitarian Deliberative Decision Making

TLDR
This work identifies a class of metric spaces, which includes all Euclidean spaces, for which the deliberation process is guaranteed to result in success, and studies sufficient conditions on the type of deliberation that can again guarantee success.

Complexity of Deliberative Coalition Formation

TLDR
It is proving that in both models it is hard to find a proposal with a high degree of support, and even a 2-compromise transition may be hard to compute, and strengthening the lower bound on the size of the compromise for the d-hypercube model from d to 2^Ω(d).

Deliberative Coalition Formation.

TLDR
Conditions are formulated that guarantee deliberation to succeed, that is, to terminate by identifying a majority-supported proposal with largest possible support, as long as such a proposal exists.

Voting Behavior in One-Shot and Iterative Multiple Referenda

We consider a set of voters making a collective decision via simultaneous vote on two binary issues. Voters' preferences are captured by payoffs assigned to combinations of outcomes for each issue

United for Change: Deliberative Coalition Formation to Change the Status Quo

TLDR
A deliberation process in which agents dynamically form coalitions around proposals that they prefer over the status quo is described, providing theoretical foundations for the analysis of deliberative processes in systems for democratic deliberation support, such as, e.g., LiquidFeedback or Polis.

A PAC Framework for Aggregating Agents' Judgments

TLDR
This work proposes a formal learning-theoretic framework for PAC learning, and gives general results on how to translate classical results from PAC learning into results in this framework.

Scaling Things Up: Large Group Decision Making (LGDM)

TLDR
The present chapter aims at introducing and contextualizing this relatively new area of research, highlighting its main limitations of challenges and discussing some of its newly related disciplines, as witnessed in recent research.

References

SHOWING 1-10 OF 54 REFERENCES

Crowdsourcing for Participatory Democracies: Efficient Elicitation of Social Choice Functions

TLDR
Algorithms are given which efficiently elicit \epsilon-approximations to two prominent voting rules: the Borda rule and the Condorcet winner, which circumvents previous prohibitive lower bounds and is surprisingly strong.

How social influence can undermine the wisdom of crowd effect

TLDR
This work demonstrates by experimental evidence that even mild social influence can undermine the wisdom of crowd effect in simple estimation tasks.

Reaching a Consensus

Abstract Consider a group of individuals who must act together as a team or committee, and suppose that each individual in the group has his own subjective probability distribution for the unknown

Triadic Consensus - A Randomized Algorithm for Voting in a Crowd

TLDR
An urn-based voting rule where each participant acts as a voter and a candidate is studied, and it is proved that when participants lie in a one-dimensional space, this voting protocol finds a approximation of the Condorcet winner with high probability while only requiring an expected $O(\frac{1-\epsilon/sqrt{n})$ comparisons on average per voter.

Committee Decisions under Majority Rule: An Experimental Study

This article reports the findings of a series of experiments on committee decision making under majority rule. The committee members had relatively fixed preferences, so that the process was one of

Problems in decentralized decision making and computation

TLDR
A scheme whereby a set of decision makers (processors) exchange and update tentative decisions which minimize a common cost function, given information they possess is considered; it is shown that they are guaranteed to converge to consensus.

Deliberative Systems: Deliberative Democracy At The Large Scale

'Deliberative democracy' is often dismissed as a set of small-scale, academic experiments. This volume seeks to demonstrate how the deliberative ideal can work as a theory of democracy on a larger

Multiagent Systems - Algorithmic, Game-Theoretic, and Logical Foundations

This exciting and pioneering new overview of multiagent systems, which are online systems composed of multiple interacting intelligent agents, i.e., online trading, offers a newly seen computer

Naïve Learning in Social Networks and the Wisdom of Crowds

TLDR
It is shown that all opinions in a large society converge to the truth if and only if the influence of the most influential agent vanishes as the society grows.
...