On sabotage games

Research output: Contribution to journalArticle

Abstract

Sabotage games on a graph involve Runner who wants to travel between two given vertices and Blocker who aims to prevent Runner from arriving at his destination by destroying edges. This paper completely characterizes games with multiple destinations on weighted trees for both local and global cutting rules of arbitrary capacity. The games on weighted graphs are characterized using the tree unraveling of the graph.

Original languageEnglish
Pages (from-to)250-254
Number of pages5
JournalOperations Research Letters
Volume44
Issue number2
DOIs
Publication statusPublished - 2016 Mar 1
Externally publishedYes

Keywords

  • Dynamic graph reliability
  • Games on graphs
  • Network interdiction
  • Sabotage games

ASJC Scopus subject areas

  • Software
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'On sabotage games'. Together they form a unique fingerprint.

  • Cite this