Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Algorithms for finding optimal paths in network games with \(p\) players

From MaRDI portal
Publication:1388074
Jump to:navigation, search

zbMATH Open0896.90189MaRDI QIDQ1388074

R. Boliac, Dmitrii Lozovanu

Publication date: 8 June 1998

Published in: Computer Science Journal of Moldova (Search for Journal in Brave)




zbMATH Keywords

network gamesoptimal paths


Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43)



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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1388074&oldid=13543210"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 31 January 2024, at 16:56.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki