Optimizing the cost of preference manipulation in the graph model for conflict resolution
作者：
Highlights：
• We formalize the problem of optimal preference manipulation in the GMCR.
• We propose a cost function and aggregation criteria to preference changes.
• We establish an upper bound on the preference change cost.
• We show that optimal preference manipulation problem is NP-hard.
• The Cuban missile con ict is used to illustrate the problem.
摘要
•We formalize the problem of optimal preference manipulation in the GMCR.•We propose a cost function and aggregation criteria to preference changes.•We establish an upper bound on the preference change cost.•We show that optimal preference manipulation problem is NP-hard.•The Cuban missile con ict is used to illustrate the problem.
论文关键词：Conflict intervention,Inverse GMCR,Minimum cost,Computational complexity,Optimal incentives
论文评审过程：Received 9 September 2020, Revised 30 September 2020, Accepted 3 October 2020, Available online 20 October 2020, Version of Record 20 October 2020.
论文官网地址：https://doi.org/10.1016/j.amc.2020.125729
