scientific article; zbMATH DE number 1149752

zbMATH Open1048.90501MaRDI QIDQ4387130

Author name not available (Why is that?)

Publication date: 1997

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18)

Related Items (2)

On the complexity of greedy routing in ring-based peer-to-peer networks ⋮ Balancing Load via Small Coalitions in Selfish Ring Routing Games

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• The structure and complexity of Nash equilibria for a selfish routing game 👍 👎
• Nash equilibria in discrete routing games with convex latency functions 👍 👎
• The consistency of the Pareto and Nash optimality principles as applied to the problem of routing in a ring network 👍 👎
• Equilibrium routing of ring networks 👍 👎
• The non-complementarity of equilibrium routings of ring networks 👍 👎
• On approximate Nash equilibria in network design 👍 👎
• The Inefficiency of Nash and Subgame Perfect Equilibria for Network Routing 👍 👎

This page was built for publication:

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