Game-Theoretic Approach for Solving Multiobjective Flow Problems on Networks
Authors: Fonoberova Maria, Lozovanu Dmitrii
Mathematics Subject Classification 2000: 90B10, 90C35, 90C27, 90C47.
– 0.15 Mb
Abstract
The game-theoretic formulation of the multiobjective multicommodity flow problem is considered. The dynamic version of this problem is studied and an algorithm for its solving, based on the concept of multiobjective games, is proposed.Mathematics Subject Classification 2000: 90B10, 90C35, 90C27, 90C47.
Fulltext
– 0.15 Mb
Contents
- Polynomial Time Algorithm for Determining Max-Min Paths in Networks and Solving Zero Value Cyclic Games
- Note about the upper chromatic number of mixed hypertrees
- Nash equilibria sets in mixed extended 2x3 games
- Involving d-Convex Simple and Quasi-simple Planar Graphs in R3
- Game-Theoretic Approach for Solving Multiobjective Flow Problems on Networks
- Measure of stability of a Pareto optimal solution to a vector integer programming problem with fixed surcharges in the l1 and l∞ metrics
- Approaches to Software Based Fault Tolerance -- A Review
- Interfaces to symbolic computation systems: reconsidering experience of Bergman
