Zobrazeno 1 - 10 of 217 pro vyhledávání: '"Agnieszka Rusinowska"'
2
On the Design of Public Debate in Social Networks
Autor: Michel Grabisch, Antoine Mandel, Agnieszka Rusinowska
Publikováno v: Operations Research. 71:626-648
How to Avoid Polarization in Social Networks In order to facilitate social interactions and the design of deliberative and efficient institutions, a social planner should ensure that diverse opinions can be sustained and debated and ensuring social c
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::f380ca150e1706563643fac193d12c00
https://doi.org/10.1287/opre.2022.2356
Zobrazit plný text záznamu
3
Akademický článek
Determining Models of Influence
Autor: Michel Grabisch, Agnieszka Rusinowska
Publikováno v: Operations Research and Decisions, Vol vol. 26, Iss no. 2, Pp 69-85 (2016)
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
Externí odkaz: https://doaj.org/article/e146b8279e6d46bea841cd271123571a
Zobrazit plný text záznamu
5
Akademický článek
A Survey on Nonstrategic Models of Opinion Dynamics
Autor: Michel Grabisch, Agnieszka Rusinowska
Publikováno v: Games, Vol 11, Iss 4, p 65 (2020)
The paper presents a survey on selected models of opinion dynamics. Both discrete (more precisely, binary) opinion models as well as continuous opinion models are discussed. We focus on frameworks that assume non-Bayesian updating of opinions. In the
Externí odkaz: https://doaj.org/article/c6f8c695b2c94c69a0afb5c447a6ea17
Zobrazit plný text záznamu
6
k-additive upper approximation of TU-games
Autor: Agnieszka Rusinowska, Michel Grabisch
Publikováno v: Operations Research Letters
Operations Research Letters, Elsevier, 2020, 48 (4), pp.487-492. ⟨10.1016/j.orl.2020.06.001⟩
International audience; We study the problem of an upper approximation of a TU-game by a-additive game under the constraint that both games yield the same Shapley value. The best approximation is obtained by minimizing the sum of excesses with respec
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::762761b2c366abc4d18b14f8eb06ebbb
https://doi.org/10.1016/j.orl.2020.06.001
Zobrazit plný text záznamu
7
The degree measure as utility function over positions in graphs and digraphs
Autor: René van den Brink, Agnieszka Rusinowska
Publikováno v: European Journal of Operational Research
European Journal of Operational Research, Elsevier, In press
van den Brink, R & Rusinowska, A 2022, ' The degree measure as utility function over positions in graphs and digraphs ', European Journal of Operational Research, vol. 299, no. 3, pp. 1033-1044 . https://doi.org/10.1016/j.ejor.2021.10.017
European Journal of Operational Research, 299(3), 1033-1044. Elsevier
We explore the possibility to compare positions in different directed and undirected graphs. We assume an agent to have a preference relation over positions in different weighted (directed and undirected) graphs, stating pairwise comparisons between
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::38fd15281cb1dde83f8b550766c8302d
https://hal.archives-ouvertes.fr/hal-03513560
Zobrazit plný text záznamu
8
Winning coalitions in plurality voting democracies
Autor: René van den Brink, Agnieszka Rusinowska, Dinko Dimitrov
Publikováno v: Social Choice and Welfare
Social Choice and Welfare, Springer Verlag, 2021, 56, pp.509-530. ⟨10.1007/s00355-020-01290-y⟩
van den Brink, R, Dimitrov, D & Rusinowska, A 2020, ' Winning coalitions in plurality voting democracies ', Social Choice and Welfare, vol. 56, no. 3, pp. 509-530 . https://doi.org/10.1007/s00355-020-01290-y
Social Choice and Welfare, 56(3), 509-530. Springer New York
Open Access funding enabled and organized by Projekt DEAL.; International audience; We consider plurality voting games being simple games in partition function form such that in every partition there is at least one winning coalition. Such a game is
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::87e424535d724349ffb814112fcd9279
https://hal.archives-ouvertes.fr/hal-03153465
Zobrazit plný text záznamu
10
The degree ratio ranking method for directed graphs
Autor: Agnieszka Rusinowska, René van den Brink
Publikováno v: European Journal of Operational Research
European Journal of Operational Research, Elsevier, 2021, 288 (2), pp.563-575
European Journal of Operational Research, 288(2), 563-575. Elsevier
European Journal of Operational Research, Elsevier, 2021, 288 (2), pp.563-575. ⟨10.1016/j.ejor.2020.06.013⟩
Brink, R V D & Rusinowska, A 2021, ' The degree ratio ranking method for directed graphs ', European Journal of Operational Research, vol. 288, no. 2, pp. 563-575 . https://doi.org/10.1016/j.ejor.2020.06.013
One of the most famous ranking methods for digraphs is the ranking by Copeland score. The Copeland score of a node in a digraph is the difference between its outdegree (i.e. its number of outgoing arcs) and its indegree (i.e. its number of ingoing ar
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::afdf913d4aeddd14b1a34be789a101ec
https://hal.archives-ouvertes.fr/hal-03153475
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje