Structural Information and Communication Complexity

DOI10.1007/B98251MaRDI QIDQ5315228zbMATH OpenOpenAlexFDO

Authors Vittorio Bilò, Luca Moscardelli

Publication date 7 September 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b98251

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Recommendations

• Nash equilibria in all-optical networks
• STACS 2005
• Selfish resource allocation in optical networks
• Price of Anarchy in Networks with Heterogeneous Latency Functions
• Profit maximization in flex-grid all-optical networks
• Profit maximization in flex-grid all-optical networks
• Selfish Routing and Path Coloring in All-Optical Networks
• Design of price mechanisms for network resource allocation via price of anarchy
• scientific article; zbMATH DE number 1421019
• The Price of Anarchy in Selfish Multicast Routing

Cited in

(8)

• STACS 2005
• A Noncooperative Game Approach to OSNR Optimization in Optical Networks
• Selfish resource allocation in optical networks
• On the convergence of multicast games in directed networks
• Designing fast converging cost sharing methods for multicast transmissions
• Nash equilibria in all-optical networks
• Selfish Routing and Path Coloring in All-Optical Networks
• On a Non-cooperative Model for Wavelength Assignment in Multifiber Optical Networks

This page was built for publication: Structural Information and Communication Complexity

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