Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 2

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  opinion formation
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available Opinion formation in social networks
EN
A number of selected works on the dynamics of opinions and beliefs in social networks has been discussed. Both Bayesian and non-Bayesian approaches to social learning have been considered, but the analysis has been focused on a simple, tractable and widely used model of updating beliefs – the DeGroot model. The author studied the dynamics of opinions based on the DeGroot model from different points of view. First, its attractive features and shortcomings were discussed and then some of its extensions have been presented. These models are based on the DeGroot updating rule, but additionally incorporate the possibility of improvements and enrichments of the framework.
2
Content available Determining models of influence
EN
We consider a model of opinion formation based on aggregation functions. Each player modifies his opinion by arbitrarily aggregating the current opinion of all players. A player is influential on another player if the opinion of the first one matters to the latter. Generalization of an influential player to a coalition whose opinion matters to a player is called an influential coalition. Influential players (coalitions) can be graphically represented by the graph (hypergraph) of influence, and convergence analysis is based on properties of the hypergraphs of influence. In the paper, we focus on the practical issues of applicability of the model w.r.t. a standard framework for opinion formation driven by Markov chain theory. For a qualitative analysis of convergence, knowing the aggregation functions of the players is not required, one only needs to know the set of influential coalitions for each player. We propose simple algorithms that permit us to fully determine the influential coalitions. We distinguish three cases: a symmetric decomposable model, an anonymous model, and a general model.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.