Nash equilibria in all-optical networks

DOI10.1016/j.disc.2009.01.011zbMath1177.91057OpenAlexW2022349278MaRDI QIDQ1043952

George F. Georgakopoulos, Leonidas G. Sioutis, Dimitris J. Kavvadias

Publication date: 10 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.01.011

zbMATH Keywords

game theoryNash equilibriaoptical networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Nash equilibria in all-optical networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An optimal greedy heuristic to color interval graphs
• Nash equilibria in all-optical networks
• Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost
• Efficient routing in all-optical networks
• The complexity of computing a Nash equilibrium
• The complexity of pure Nash equilibria
• On the Complexity of Timetable and Multicommodity Flow Problems
• On-line routing in all-optical networks
• CONGESTION GAMES AND POTENTIALS RECONSIDERED
• Structural Information and Communication Complexity
• Atomic Routing Games on Maximum Congestion
• Experimental and Efficient Algorithms
• STACS 2005
• Equilibrium points in n -person games
• Computing correlated equilibria in multi-player games
• The complexity of path coloring and call scheduling
• On-line competitive algorithms for call admission in optical networks