Algorithm for searching an equilibrium in a routing game with piecewise constant cost functions
Andrey Parfenov
Year of publication: |
2018
|
---|---|
Authors: | Parfenov, Andrey |
Published in: |
International game theory review. - [River Edge], NJ [u.a.] : World Scientific, ISSN 0219-1989, ZDB-ID 1500913-0. - Vol. 20.2018, 4, p. 1-13
|
Subject: | Nonatomic routing games | user equilibrium | piecewise linear functions | min-cost network flow | Tourenplanung | Vehicle routing problem | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Spieltheorie | Game theory | Kostenfunktion | Cost function | Nash-Gleichgewicht | Nash equilibrium |
Saved in:
Online Resource
Saved in favorites
Similar items by subject
-
Achieving target equilibria in network routing games without knowing the latency functions
Bhaskar, Umang, (2019)
-
Technical note: characterizing and computing the set of nash equilibria via vector optimization
Feinstein, Zachary, (2024)
-
A modified gradient projection algorithm for solving the elastic demand traffic assignment problem
Ryu, Seungkyu, (2014)
- More ...