Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1507.07950

Impact of Preference and Equivocators on Opinion Dynamics with Evolutionary Game Framework

Xinyang Deng·Zhen Wang·Qi Liu·Yong Deng·Yu Shyr
View original source ↗Read source document ↗Export metadata ↓

Abstract

Opinion dynamics, aiming to understand the evolution of collective behavior through various interaction mechanisms of opinions, represents one of the most challenges in natural and social science. To elucidate this issue clearly, binary opinion model becomes a useful framework, where agents can take an independent opinion. Inspired by the realistic observations, here we propose two basic interaction mechanisms of binary opinion model: one is the so-called BSO model in which players benefit from holding the same opinion; the other is called BDO model in which players benefit from taking different opinions. In terms of these two basic models, the synthetical effect of opinion preference and equivocators on the evolution of binary opinion is studied under the framework of evolutionary game theory (EGT), where the replicator equation (RE) is employed to mimick the evolution of opinions. By means of numerous simulations, we show the theoretical equilibrium states of binary opinion dynamics, and mathematically analyze the stability of each equilibrium state as well.

Explore related subjects

cs.GTcs.SIphysics.soc-ph

Keep this discovery

BibTeXRIS

Xinyang Deng, Zhen Wang, Qi Liu, Yong Deng, Yu Shyr. 2015-07-28. Impact of Preference and Equivocators on Opinion Dynamics with Evolutionary Game Framework. https://arxiv.org/abs/1507.07950

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

KEEP EXPLORING

Related papers

arXiv2026

MMS Allocation for Chores with Online Agent Arrivals

We study the fair allocation of $m$ indivisible chores to $n$ agents with subadditive cost functions arriving online in an arbitrary order. Upon an agent's arrival, we are informed of her cost function and must irrevocably assign her a set of chores. We focus on the Maximin Share (MMS) fairness notion and aim to compute an allocation in which all items are assigned, and no agent incurs a cost more than $\alpha$ times her MMS. Without any prior information about the instance (other than $n$ and $m$), we design an algorithm with a competitive ratio of $O(\min\{n, k\log^{1+\epsilon}k, \log m\})$ for any constant $\epsilon > 0$, where $k$ denotes the number of cost function types. Our bound matches the best known offline approximation guarantees for MMS under subadditive costs and is nearly optimal with respect to all three parameters: we show that even for binary additive cost functions, no online algorithm can achieve a competitive ratio of $o(\min\{n, k\log k, \log m\})$. We then consider the setting in which the $k$ cost function types are known in advance (though the realized types of arriving agents are not). For additive cost functions, we provide an algorithm with a competitive ratio of $O(\min\{\log k, \log(kn)/\log\log(kn)\})$, and show that constant-competitive algorithms do not exist for general $k$, even for the binary additive setting. For binary additive functions when $k \le n$, we propose a $3$-competitive algorithm and establish a lower bound of $2$.

cs.GT↗
arXiv2026

Truncated Noisy Best-Response Algorithms: Toward Game Theoretic Learning with Safety Guarantees

We consider a game theoretic approach to solve multi-agent coordination problems with submodular maximization objectives. It is known for such problems that the Nash equilibria for the corresponding game are always within 50% of the optimal, but that the equilibria which achieve this worst-case bound are not stable. To exploit this instability, we propose a family of algorithms which we call Truncated Noisy Best-Response (TNBR) Algorithms. These algorithms are flexibly characterized by agents asynchronously and stochastically selecting actions from a neighbourhood of their best response payoffs. We compute bounds on the recurrent classes of TNBR algorithms' associated Markov chains. Our bounds fall into two categories: first, "Performance" bounds ensure that TNBR algorithms always have a high-value recurrent state; second, "Safety" bounds ensure that TNBR algorithms never have arbitrarily-bad recurrent states. Furthermore, these two types of bounds are linked by a waterbed-like effect: every game with a poor Safety guarantee necessarily has a favorable Performance guarantee.

cs.GT↗
arXiv2026

Existence of the Core in Approval-Based Committee Elections

We settle the main open question in the theory of approval-based multi-winner elections: we show that there always exists a committee in the core. The core is a stability and group fairness concept. The proof introduces a new voting rule that optimizes an entropy-like objective function over committees and payment systems. All local optima of this objective function lie in the core, which implies that a core committee can be found in polynomial time.

cs.GT↗