Game-theoretic approach for modeling of selfish and group routing

MaRDI QIDQ4556110zbMATH OpenFDO

Authors Viktor V. Zakharov, Aleksandr Yu. Krylatov

Publication date 23 November 2018

zbMATH Keywords

group routingNash equilibriumselfish routingsystem optimum of Wardroptraffic assignment problemuser equilibrium of Wardrop

Mathematics Subject Classification ID

Traffic problems in operations research (90B20) Games involving graphs (91A43)

Recommendations

• Competitive routing of traffic flows by navigation providers
• Traffic flow systems equilibria in megapolises and navigators' strategies: a game-theoretic approach
• A traffic congestion analysis by user equilibrium and system optimum with incomplete information
• Navigation system-based routing strategies in traffic flows on networks
• A network pricing game for selfish traffic

Cited in

(3)

• Some solutions for generalized games with restricted cooperation
• Towards a game theoretic understanding of ad-hoc routing
• A Game-Theoretic Approach to Routing under Adversarial Conditions

This page was built for publication: Game-theoretic approach for modeling of selfish and group routing

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