A Lemke-like algorithm for the multiclass network equilibrium problem

DOI10.1007/978-3-642-45046-4_30MaRDI QIDQ2937771zbMATH OpenOpenAlexFDO

Authors Frédéric Meunier, Thomas Pradeau

Publication date 12 January 2015

Published in Web and Internet Economics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-45046-4_30

zbMATH Keywords

affine cost functionscongestion externalitiesconstructive proofLemke algorithmnonatomic gamestransportation network

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04) Games with infinitely many players (91A07) Games involving graphs (91A43)

Recommendations

• Computing solutions of the multiclass network equilibrium problem with affine cost functions
• Equilibria in Multiclass and Multidimensional Atomic Congestion Games
• Algorithm for Searching an Equilibrium in a Routing Game with Piecewise Constant Cost Functions
• Computation of tolls in infinitely multiclass network equilibrium problems
• A game-theoretic approach to network equilibrium

Cited in

(3)

• Computing solutions of the multiclass network equilibrium problem with affine cost functions
• Equilibrium computation in resource allocation games
• Computation of tolls in infinitely multiclass network equilibrium problems

This page was built for publication: A Lemke-like algorithm for the multiclass network equilibrium problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2937771)