Optimal paths in network games with \(p\) players

DOI10.1016/S0166-218X(99)00144-4zbMath0972.91025MaRDI QIDQ1962055

R. Boliac, D. Solomon, Dmitrii D. Lozovanu

Publication date: 30 January 2000

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

zbMATH Keywords

optimal paths in networks

Mathematics Subject Classification ID

Games involving graphs (91A43) Deterministic network models in operations research (90B10)

Related Items (8)

Algorithms for solving multiobjective discrete control problems and dynamic \(c\)-games on networks ⋮ Algorithms and the calculation of Nash equilibria for multi-objective control of time-discrete systems and polynomial-time algorithms for dynamic \(c\)-games on networks ⋮ An approach for an algorithmic solution of discrete optimal control problems and their game-theoretical extension ⋮ On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles. ⋮ A constructive algorithm for max-min paths problems on energy networks ⋮ Discrete control and algorithms for solving antagonistic dynamic games on networks ⋮ Unnamed Item ⋮ Nash Equilibria Conditions for Cyclic Games with p Players

Cites Work

• Unnamed Item
• Unnamed Item
• An algorithm and a program for finding the minimax path tree in weighted digraphs
• Strongly polynomial algorithms for finding minimax paths in networks and solution of cyclic games
• Non-cooperative games
• Cyclic games and an algorithm to find minimax cycle means in directed graphs
• On the minimax path in a network

This page was built for publication: Optimal paths in network games with \(p\) players