On the shortest path game

DOI10.1016/J.DAM.2015.08.003MaRDI QIDQ729795zbMATH OpenOpenAlexWikidataFDO

Authors Andreas Darmann, Ulrich Pferschy, Joachim Schauer

Publication date 22 December 2016

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

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

zbMATH Keywords

cactus graphcomputational complexitygame theoryshortest path problem

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38) Games on graphs (graph-theoretic aspects) (05C57) 2-person games (91A05) Games involving graphs (91A43)

Recommendations

• The shortest path game: complexity and algorithms
• The shortest connection game
• Complexity of path-forming games
• The minimum cost shortest-path tree game
• On shortest path games

Cites work

• Algorithmic Game Theory
• Bounded-width QBF is PSPACE-complete
• Complexity of path-forming games
• Decomposing quantified conjunctive (or disjunctive) formulas
• Geography
• GO Is Polynomial-Space Hard
• scientific article; zbMATH DE number 5301288 (Why is no real title available?)
• scientific article; zbMATH DE number 3560737 (Why is no real title available?)
• Introduction to algorithms.
• On the complexity of some two-person perfect-information games
• PSPACE-Hardness of some combinatorial games
• The shortest path game: complexity and algorithms
• The Subset Sum game
• Undirected edge geography

Cited in

(5)

• Complexity of path-forming games
• Competitive multi-agent scheduling with an iterative selection rule
• The shortest connection game
• The shortest path game: complexity and algorithms
• On the complexity of the bilevel shortest path problem

This page was built for publication: On the shortest path game

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