@inproceedings{10.1007/978-3-662-44602-7_4,
    Abstract = {In this work we address a game theoretic variant of the shortest path problem, in which two decision makers (agents/players) move together along the edges of a graph from a given starting vertex to a given destination. The two players take turns in deciding in each vertex which edge to traverse next. The decider in each vertex also has to pay the cost of the chosen edge. We want to determine the path where each player minimizes its costs taking into account that also the other player acts in a selfish and rational way. Such a solution is a subgame perfect equilibrium and can be determined by backward induction in the game tree of the associated finite game in extensive form.},
    Address = {Berlin, Heidelberg},
    Author = {Darmann, Andreas and Pferschy, Ulrich and Schauer, Joachim},
    BookTitle = {Theoretical Computer Science},
    Editor = {Diaz, Josep and Lanese, Ivan and Sangiorgi, Davide},
    File = {Darmann2014\_Chapter\_TheShortestPathGameComplexityA (0) (0) - a - a - n.pdf},
    ISBN = {978-3-662-44602-7},
    Pages = {39--53},
    Publisher = {Springer Berlin Heidelberg},
    Title = {The Shortest Path Game: Complexity and Algorithms},
    Year = {2014},
    date-added = {2019-03-26 20:35:38 +0100},
    date-modified = {2019-03-26 20:35:38 +0100},
    doi = {10.1007/978-3-662-44602-7_4}
}

@inproceedings{10.1007/978-3-662-44602-7_4, Abstract = {In this work we address a game theoretic variant of the shortest path problem, in which two decision makers (agents/players) move together along the edges of a graph from a given starting vertex to a given destination. The two players take turns in deciding in each vertex which edge to traverse next. The decider in each vertex also has to pay the cost of the chosen edge. We want to determine the path where each player minimizes its costs taking into account that also the other player acts in a selfish and rational way. Such a solution is a subgame perfect equilibrium and can be determined by backward induction in the game tree of the associated finite game in extensive form.}, Address = {Berlin, Heidelberg}, Author = {Darmann, Andreas and Pferschy, Ulrich and Schauer, Joachim}, BookTitle = {Theoretical Computer Science}, Editor = {Diaz, Josep and Lanese, Ivan and Sangiorgi, Davide}, File = {Darmann2014_Chapter_TheShortestPathGameComplexityA (0) (0) - a - a - n.pdf}, ISBN = {978-3-662-44602-7}, Pages = {39--53}, Publisher = {Springer Berlin Heidelberg}, Title = {The Shortest Path Game: Complexity and Algorithms}, Year = {2014}, date-added = {2019-03-26 20:35:38 +0100}, date-modified = {2019-03-26 20:35:38 +0100}, doi = {10.1007/978-3-662-44602-7_4} }