Coverage and vacuity in network formation games

Gili Bielous, Orna Kupferman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations


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.

Original languageAmerican English
Title of host publication28th EACSL Annual Conference on Computer Science Logic, CSL 2020
EditorsMaribel Fernandez, Anca Muscholl
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959771320
StatePublished - Jan 2020
Event28th EACSL Annual Conference on Computer Science Logic, CSL 2020 - Barcelona, Spain
Duration: 13 Jan 202016 Jan 2020

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
ISSN (Print)1868-8969


Conference28th EACSL Annual Conference on Computer Science Logic, CSL 2020

Bibliographical note

Publisher Copyright:
© Gili Bielous and Orna Kupferman.


  • Coverage
  • Network formation games
  • Vacuity


Dive into the research topics of 'Coverage and vacuity in network formation games'. Together they form a unique fingerprint.

Cite this