Optimal paths in network games with \(p\) players
type: Item
instance of: scholarly article
title: Optimal paths in network games with \(p\) players
zbMATH Open document ID: 0972.91025
DOI: 10.1016/S0166-218X(99)00144-4
author: R. Boliac
author: D. Solomon
author: Dmitrii Lozovanu
published in: Discrete Applied Mathematics
publication date: 2000-01-30T00:00:00Z
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.
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 1395022
zbMATH Keywords: optimal paths in networks
reviewed by: Prabhat Kumar Mahanti
MaRDI profile type: Publication
cites work: An algorithm and a program for finding the minimax path tree in weighted digraphs
cites work: Q4083324
cites work: Cyclic games and an algorithm to find minimax cycle means in directed graphs
cites work: Q4695280
cites work: Strongly polynomial algorithms for finding minimax paths in networks and solution of cyclic games
cites work: On the minimax path in a network
cites work: Non-cooperative games
description: scientific article; zbMATH DE number 1395022