scientific article; zbMATH DE number 6829368

DOI10.4230/LIPICS.STACS.2016.27MaRDI QIDQ4601879zbMATH OpenFDO

Authors Shiri Chechik, Haim Kaplan, Mikkel Thorup, Or Zamir, Uri Zwick

Publication date 24 January 2018

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2016.27

zbMATH Keywords

bottleneck pathscomparison modeldeterministic graphical games

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Signed and weighted graphs (05C22) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Programming involving graphs or networks (90C35) Games involving graphs (91A43)

Recommendations

• Stackelberg shortest path tree game, revisited
• A Dynamic Algorithm for Reachability Games Played on Trees
• Deterministic Graph Games and a Probabilistic Intuition
• scientific article; zbMATH DE number 1047712
• Graphs and Path Equilibria
• Complexity of path-forming games
• Deterministic graphical games revisited
• Deterministic Graphical Games Revisited
• Structure theorems for game trees

Cited in

(9)

• Complexity of path discovery game problems
• Stretch in Bottleneck Games
• A Dynamic Algorithm for Reachability Games Played on Trees
• Single-source bottleneck path algorithm faster than sorting for sparse graphs
• Resource Reachability Games on Pushdown Graphs
• On efficient algorithms for bottleneck path problems with many sources
• Bi-objective minimization of energy consumption and cycle time for the robotic assembly line balancing problem: pseudo-polynomial case and reduced search space metaheuristic
• Computation of lower tolerances of combinatorial bottleneck problems
• Self enforceable paths in extensive form games

This page was built for publication:

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