On sabotage games

Dmitriy Kvasov

doi:10.1016/j.orl.2016.02.002

On sabotage games

Dmitriy Kvasov^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

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 language	English
Pages (from-to)	250-254
Number of pages	5
Journal	Operations Research Letters
Volume	44
Issue number	2
DOIs	https://doi.org/10.1016/j.orl.2016.02.002
Publication status	Published - 2016 Mar
Externally published	Yes

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

Access to Document

10.1016/j.orl.2016.02.002

Cite this

@article{493539572ace436ba1e5fde2bdd7effd,

title = "On sabotage games",

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.",

keywords = "Dynamic graph reliability, Games on graphs, Network interdiction, Sabotage games",

author = "Dmitriy Kvasov",

year = "2016",

month = mar,

doi = "10.1016/j.orl.2016.02.002",

language = "English",

volume = "44",

pages = "250--254",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - On sabotage games

AU - Kvasov, Dmitriy

PY - 2016/3

Y1 - 2016/3

N2 - 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.

AB - 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.

KW - Dynamic graph reliability

KW - Games on graphs

KW - Network interdiction

KW - Sabotage games

UR - http://www.scopus.com/inward/record.url?scp=84958985663&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84958985663&partnerID=8YFLogxK

U2 - 10.1016/j.orl.2016.02.002

DO - 10.1016/j.orl.2016.02.002

M3 - Article

AN - SCOPUS:84958985663

SN - 0167-6377

VL - 44

SP - 250

EP - 254

JO - Operations Research Letters

JF - Operations Research Letters

IS - 2

ER -

On sabotage games

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this