Algorithms for finding optimal paths in network games with \(p\) players
From MaRDI portal
Publication:1388074
zbMATH Open0896.90189MaRDI QIDQ1388074
Publication date: 8 June 1998
Published in: Computer Science Journal of Moldova (Search for Journal in Brave)
Related Items (3)
Network search games, with arbitrary searcher starting point ⋮ Algorithm for Searching an Equilibrium in a Routing Game with Piecewise Constant Cost Functions ⋮ An algorithm for finding Nash equilibria in dynamic network games
This page was built for publication: Algorithms for finding 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 Q1388074)