@inproceedings{f39f9753984646e5b6361786514fd584,
title = "Coverage and vacuity in network formation games",
abstract = "The frameworks of coverage and vacuity in formal verification analyze the effect of mutations applied to systems or their specifications. We adopt these notions to network formation games, analyzing the effect of a change in the cost of a resource. We consider two measures to be affected: the cost of the Social Optimum and extremums of costs of Nash Equilibria. Our results offer a formal framework to the effect of mutations in network formation games and include a complexity analysis of related decision problems. They also tighten the relation between algorithmic game theory and formal verification, suggesting refined definitions of coverage and vacuity for the latter.",
keywords = "Coverage, Network formation games, Vacuity",
author = "Gili Bielous and Orna Kupferman",
note = "Publisher Copyright: {\textcopyright} Gili Bielous and Orna Kupferman.; 28th EACSL Annual Conference on Computer Science Logic, CSL 2020 ; Conference date: 13-01-2020 Through 16-01-2020",
year = "2020",
month = jan,
doi = "10.4230/LIPIcs.CSL.2020.10",
language = "الإنجليزيّة",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Maribel Fernandez and Anca Muscholl",
booktitle = "28th EACSL Annual Conference on Computer Science Logic, CSL 2020",
address = "ألمانيا",
}