The Power Allocation Game on A Network: Computation Issue
Computer Science and Game Theory
2018-05-08 v1 Multiagent Systems
Social and Information Networks
Abstract
In this paper two algorithms with the goal of generating the equilibrium set of the power allocation game first developed in \cite{allocation} are proposed. Based on the first algorithm, the geometric property of the pure strategy Nash equilibrium set will be proven to be a collection of convex polytopes. The second, simulation-based, algorithm is developed to overcome the shortcoming of the first algorithm in terms of generating the equilibrium set efficiently and then making policy-relevant predictions based on the set. The second algorithm will be usefully applied to a real-world case study, which draws on the current crisis between North Korea and certain key players including the US and China.
Keywords
Cite
@article{arxiv.1805.02138,
title = {The Power Allocation Game on A Network: Computation Issue},
author = {Yuke Li and Jiahua Yue and Fengjiao Liu and A. Stephen Morse},
journal= {arXiv preprint arXiv:1805.02138},
year = {2018}
}