Optimal paths in network games with p players
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3503127 (Why is no real title available?)
- scientific article; zbMATH DE number 203962 (Why is no real title available?)
- An algorithm and a program for finding the minimax path tree in weighted digraphs
- Cyclic games and an algorithm to find minimax cycle means in directed graphs
- Non-cooperative games
- On the minimax path in a network
- Strongly polynomial algorithms for finding minimax paths in networks and solution of cyclic games
Cited in
(11)- Optimal route selection decision-making based on intelligent network
- Discrete control and algorithms for solving antagonistic dynamic 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
- On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
- Hitting a path: a generalization of weighted connectivity via game theory
- A constructive algorithm for max-min paths problems on energy networks
- Algorithms for solving multiobjective discrete control problems and dynamic \(c\)-games on networks
- An approach for an algorithmic solution of discrete optimal control problems and their game-theoretical extension
- scientific article; zbMATH DE number 5121085 (Why is no real title available?)
- scientific article; zbMATH DE number 2230247 (Why is no real title available?)
- Nash Equilibria Conditions for Cyclic Games with p Players
This page was built for publication: Optimal paths in network games with \(p\) players
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1962055)
