Cost of Stability and Least Core in Path-Disruption Games

摘要

Path-disruption games are a class of cooperative games in which agents try to block any path from an intruder's source vertex to a target vertex. We study algorithmic properties and characterizations of the least core and the cost of stability for these games.