Optimal paths in network games with p players

Optimal paths in network games with p players

0.00 Avg rating—0 Votes
Article ID: iaor20012894
Country: Netherlands
Volume: 99
Issue: 1/3
Start Page Number: 339
End Page Number: 348
Publication Date: Feb 2000
Journal: Discrete Applied Mathematics
Authors: , ,
Abstract:

The problem of finding the optimal paths in network games with p players, which generalizes the well-known combinatorial problem on the shortest path in a network and which arose as an auxiliary one when studying cyclic games, is studied. Polynomial-time algorithms for finding the optimal paths as well as the optimal by Nash strategies of the players in network games are proposed.

Reviews

Required fields are marked *. Your email address will not be published.