Directed elimination games

DOI10.1016/J.DAM.2014.08.030MaRDI QIDQ896668zbMATH OpenOpenAlexFDO

Authors Viktor Engelmann, Sebastian Ordyniak, Stephan Kreutzer

Publication date 10 December 2015

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2014.08.030

zbMATH Keywords

monotonicitycops and robber gamesgraph searchingalgorithmic graph structure theorydirected dominating setdirected width measures

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)

Recommendations

• Directed and weighted majority games
• Strategy elimination in games with interaction structures
• Elimination of dominated strategies and inessential players
• Direct methods for some distributed games
• Directed communication in games with directed graphs
• Circulant games
• Coordination games on directed graphs
• Chip-firing games on directed graphs
• On a game in directed graphs.
• Ellsberg games

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1161563 (Why is no real title available?)
• scientific article; zbMATH DE number 1361465 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• An annotated bibliography on guaranteed graph searching
• Are there any good digraph width measures?
• Digraph decompositions and monotonicity in digraph searching
• Digraph measures: Kelly decompositions, games, and orderings
• Digraphs of bounded elimination width
• Digraphs. Theory, algorithms and applications
• Directed nowhere dense classes of graphs
• Directed path-width and monotonicity in digraph searching
• Directed rank-width and displit decomposition
• Directed tree-width
• Fugitive-search games on graphs and related parameters
• Graph minors XXIII. Nash-Williams' immersion conjecture
• Graph searching games
• Introducing directed tree width
• Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
• Mathematical Foundations of Computer Science 2005
• On complexity of minimum leaf out-branching problem
• On digraph width measures in parameterized algorithmics
• On the algorithmic effectiveness of digraph decompositions and complexity measures
• Parametrized complexity theory.
• The dag-width of directed graphs
• The game of cops and robbers on graphs
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Treewidth: Characterizations, Applications, and Computations

Cited in

(1)

• Elimination of dominated strategies and inessential players

This page was built for publication: Directed elimination games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896668)