Related papers: Making Consensus Tractable
We consider continuous-time consensus seeking systems whose time-dependent interactions are cut-balanced, in the following sense: if a group of agents influences the remaining ones, the former group is also influenced by the remaining ones…
A discourse strategy is a strategy for communicating with another agent. Designing effective dialogue systems requires designing agents that can choose among discourse strategies. We claim that the design of effective strategies must take…
In this paper, we reconsider the spin model suggested recently to understand some features of collective decision making among higher organisms [A.T. Hartnett et al., Phys. Rev. Lett. 116 (2016) 038701]. Within the model, the state of an…
Important decisions are likely made by groups of agents. Thus group decision making is very common in practice. Very transparent group aggregating rules are given by weighted voting, where each agent is assigned a weight. Here a proposal is…
A group of privately informed agents chooses between two alternatives. How should the decision rule be designed if agents are known to be biased in favor of one of the options? We address this question by considering the Condorcet Jury…
In this paper, we investigate deliberation procedures that invite citizens with contextual opinions to explore alternative thinking frames. Contextuality is captured in a simple quantum cognitive model. We show how disagreeing citizens…
This paper investigates the asymptotic behavior of some common opinion dynamic models in a continuum of agents. We show that as long as the interactions among the agents are symmetric, the distribution of the agents' opinion converges. We…
In bipartite matching problems, agents on two sides of a graph want to be paired according to their preferences. The stability of a matching depends on these preferences, which in uncertain environments also reflect agents' beliefs about…
We study opinion evolution in networks of stubborn agents discussing a sequence of issues, modeled through the so called concatenated Friedkin-Johnsen (FJ) model. It is concatenated in the sense that agents' opinions evolve for each issue,…
For a binary choice problem, the spatial coordination of decisions in an agent community is investigated both analytically and by means of stochastic computer simulations. The individual decisions are based on different local information…
Collaboration requires agents to coordinate their behavior on the fly, sometimes cooperating to solve a single task together and other times dividing it up into sub-tasks to work on in parallel. Underlying the human ability to collaborate…
In this paper, we model a decision-making process involving a set of interacting agents. We use Markovian opinion dynamics, where each agent switches between decisions according to a continuous time Markov chain. Existing opinion dynamics…
Consensus planning is a method for coordinating decision making across complex systems and organizations, including complex supply chain optimization pipelines. It arises when large interdependent distributed agents (systems) share common…
Unlike many complex networks studied in the literature, social networks rarely exhibit unanimous behavior, or consensus. This requires a development of mathematical models that are sufficiently simple to be examined and capture, at the same…
The original Hegselmann-Krause (HK) model comprises a set of $n$ agents characterized by their opinion, a number in $[0,1]$. Agent $i$ updates its opinion $x_i$ via taking the average opinion of its neighbors whose opinion differs by at…
Decision making can be difficult when there are many actors (or agents) who may be coordinating or competing to achieve their various ideas of the optimum outcome. Here I present a simple decision making model with an explicitly…
Opinion diffusion is a crucial phenomenon in social networks, often underlying the way in which a collective of agents develops a consensus on relevant decisions. The voter model is a well-known theoretical model to study opinion spreading…
We propose a probabilistic model to aggregate the answers of respondents answering multiple-choice questions. The model does not assume that everyone has access to the same information, and so does not assume that the consensus answer is…
We present a new and efficient algorithm for determining a consensus value for a network of agents. Different from existing algorithms, our algorithm evaluates the consensus value for very large networks using heat kernel pagerank. We…
The original Deffuant model consists of a finite number of agents whose opinion is a number in $[0,1]$. Two socially connected agents are uniformly randomly selected at each time step and approach each other at a rate $\mu\in [0,1/2]$ if…