@inproceedings{66c98475718447ef996142dd4be0b63b,
title = "Dynamic conflict on a network",
abstract = "Players are endowed with resources. A player can engage in conflict with others to enlarge his resources. The set of potential conflicts is defined by a contiguity network. Players are farsighted and aim to maximize their resources. They decide on whether to wage war or remain peaceful. The winner of a war takes control of the loser's node and resources; he then decides on whether to wage war against other neighbours, or to stay peaceful. The game ends when either all players choose to be peaceful or when only one player is left. We study the influence of the technology of conflict and the structure of the network on war and peace. Our first result identifies a threshold property in the technology of conflict: above this threshold, every ruler wishes to wage war and, eventually, there is a hegemon. Below the threshold, resources and networks determine the prospects for peace and the number of kingdoms. We develop sufficient conditions for war and provide examples with lasting peace.",
keywords = "Conflict, Dynamics, Networks, Tullock contest",
author = "Marcin Dziubinski and Sanjeev Goyal and Minarsch, {David E.N.}",
year = "2016",
month = jul,
day = "21",
doi = "10.1145/2940716.2940776",
language = "English (US)",
series = "EC 2016 - Proceedings of the 2016 ACM Conference on Economics and Computation",
publisher = "Association for Computing Machinery, Inc",
pages = "655--656",
booktitle = "EC 2016 - Proceedings of the 2016 ACM Conference on Economics and Computation",
note = "17th ACM Conference on Economics and Computation, EC 2016 ; Conference date: 24-07-2016 Through 28-07-2016",
}