Algorithm for Searching an Equilibrium in a Routing Game with Piecewise Constant Cost Functions

DOI10.1142/S0219198918500068zbMath1411.91148OpenAlexW2799750016MaRDI QIDQ4557738

A. P. Parfenov

Publication date: 26 November 2018

Published in: International Game Theory Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219198918500068

zbMATH Keywords

piecewise linear functionsuser equilibriummin-cost network flownonatomic routing games

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Games involving graphs (91A43) Games with infinitely many players (91A07) Traffic problems in operations research (90B20)

Related Items (2)

Unnamed Item ⋮ Atomic routing game with capacity constraints

Cites Work

• Max-min representation of piecewise linear functions
• Some Recent Advances in Network Flows
• Algorithmic Game Theory
• Selfish Routing in Capacitated Networks
• Unnamed Item

This page was built for publication: Algorithm for Searching an Equilibrium in a Routing Game with Piecewise Constant Cost Functions