Optimal paths in network games with p players

DOI10.1016/S0166-218X(99)00144-4MaRDI QIDQ1962055zbMATH OpenFDO

Authors R. Boliac, D. Solomon, Dmitrii Lozovanu

Publication date 30 January 2000

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

Full work available at URL https://doi.org/10.1016/S0166-218X(99)00144-4

zbMATH Keywords

optimal paths in networks

Mathematics Subject Classification ID

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

Review text

The authors develop optimal paths in networks which generalize the well known combinatorial problem on the shortest path in a network. The problem formulation and the theorems are presented without numerical illustration.

Recommendations

• Algorithms for finding optimal paths in network games with p players
• Network models of discrete optimal control and dynamic games with p players
• scientific article; zbMATH DE number 2170590
• On the minimax path in a network
• Path player games. Analysis and applications

Cites work

• 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
• scientific article; zbMATH DE number 3503127 (Why is no real title available?)
• scientific article; zbMATH DE number 203962 (Why is no real title available?)
• 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

(12)

• Algorithms for finding optimal paths in network games with p players
• On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
• Algorithms for solving multiobjective discrete control problems and dynamic \(c\)-games on networks
• Hitting a path: a generalization of weighted connectivity via game theory
• A constructive algorithm for max-min paths problems on energy networks
• Optimal route selection decision-making based on intelligent network
• Discrete control and algorithms for solving antagonistic dynamic games on networks
• scientific article; zbMATH DE number 5121085 (Why is no real title available?)
• Nash Equilibria Conditions for Cyclic Games with p Players
• scientific article; zbMATH DE number 2230247 (Why is no real title available?)
• 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

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)