Optimal paths in network games with p players
From MaRDI portal
DOI10.1016/S0166-218X(99)00144-4zbMATH Open0972.91025MaRDI QIDQ1962055FDOQ1962055
Authors: R. Boliac, D. Solomon, Dmitrii Lozovanu 
Publication date: 30 January 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
- Non-cooperative games
- Title not available (Why is that?)
- Cyclic games and an algorithm to find minimax cycle means in directed graphs
- Title not available (Why is that?)
- Strongly polynomial algorithms for finding minimax paths in networks and solution of cyclic games
- An algorithm and a program for finding the minimax path tree in weighted digraphs
- On the minimax path in a network
Cited In (11)
- Nash Equilibria Conditions for Cyclic Games with p Players
- Algorithms for solving multiobjective discrete control problems and dynamic \(c\)-games on networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
- Discrete control and algorithms for solving antagonistic dynamic games on networks
- Optimal route selection decision-making based on intelligent network
- 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
- A constructive algorithm for max-min paths problems on energy networks
- An approach for an algorithmic solution of discrete optimal control problems and their game-theoretical extension
- Hitting a path: a generalization of weighted connectivity via game theory
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)
