Nash equilibria in all-optical networks

Authors:
George F. Georgakopoulos;Dimitris J. Kavvadias;Leonidas G. Sioutis
Affiliations:
Computer Science Department, University of Crete, Greece;Mathematics Department, University of Patras, Greece;Mathematics Department and Computer Engineering and Informatics Department, University of Patras, Greece
Venue:
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Year:
2005

Citing 12
Cited 2

Introduction to algorithms

Introduction to algorithms
An optimal greedy heuristic to color interval graphs

Information Processing Letters
Efficient routing in all-optical networks

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The complexity of path coloring and call scheduling

Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On-Line Routing in All-Optical Networks

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Approximating Multicast Congestion

ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
The complexity of pure Nash equilibria

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Computing correlated equilibria in multi-player games

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Computing equilibria in multi-player games

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient convergence to pure nash equilibria in weighted network congestion games

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms

Selfishness, collusion and power of local search for the ADMs minimization problem

Computer Networks: The International Journal of Computer and Telecommunications Networking
Selfish routing and path coloring in all-optical networks

CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of routing a number of communication requests in WDM (wavelength division multiplexing) all-optical networks from the standpoint of game theory. If we view each routing request (pair of source-target nodes) as a player, then a strategy consists of a path from the source to the target and a frequency (color). To reflect the restriction that two requests must not use the same frequency on the same edge, conflicting strategies are assigned a prohibitively high cost. Under this formulation, we consider several natural cost functions focusing on the existence of Nash equilibria and on the complexity of recognizing and computing them.