The decider in each vertex also has to pay the cost of the chosen edge. The two players take turns in deciding in each vertex which edge to traverse next. 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.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |