Foundations of network optimization and games

DOI10.1007/978-1-4899-7594-2zbMATH Open1344.90062OpenAlexW2335515313MaRDI QIDQ889409FDOQ889409

David Bernstein, Terry L. Friesz

Publication date: 6 November 2015

Published in: Complex Networks and Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4899-7594-2

zbMATH Keywords

Nash equilibriumvariational inequalityStackelberg gamenetwork flow optimizationnonlinear objective

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Noncooperative games (91A10) Integer programming (90C10)

Cited In (4)

• A variational inequality framework for network games: existence, uniqueness, convergence and sensitivity analysis
• Breakdown minimization principle versus Wardrop's equilibria for dynamic traffic assignment and control in traffic and transportation networks: a critical mini-review
• Congestion control for a system with parallel stations and homogeneous customers using priority passes
• Strategy-based transit stochastic user equilibrium model with capacity and number-of-transfers constraints

This page was built for publication: Foundations of network optimization and games

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