社交网络中的意见操纵

摘要：

在这项工作中，我们感兴趣的是找到最有效的使用预算，以促进一个意见，支付代理人在一个组内取代他们的真实意见。我们将意见建模为从0到1的连续标量，1（0）代表非常积极（消极）的意见。我们专注于代理之间的不对称信任。代理的迭代更新对应于对其他代理的动作的最佳响应。由此产生的置信矩阵可以看作是一个等价的马尔可夫链。我们提供了简单而有效的算法来解决这个问题，我们通过一个例子来说明如何在实践中解决所述的问题。

英文摘要：

In this work, we are interested in finding the most efficient use of a budget to promote an opinion by paying agents within a group to supplant their true opinions. We model opinions as continuous scalars ranging from 0 to 1 with 1 (0) representing extremely positive (negative) opinion. We focus on asymmetric confidence between agents. The iterative update of an agent corresponds to the best response to other agents' actions. The resulting confidence matrix can be seen as an equivalent Markov chain. We provide simple and efficient algorithms to solve this problem and we show through an example how to solve the stated problem in practice.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。