Nowadays, congestion management is one of the major tasks accomplished by system operators to warrant the operation of transmission system within operating limits. This has resulted in unanticipated congestion interfaces in regional transmission systems. The system is, however, unable to evolve at a rate which is required to meet the quickly changing demand of competitive markets. To make the m...

We study the existence of pure Nash equilibria in congestion games with player-specific costs. Specifically, we provide a thorough characterization of the maximal sets of cost functions that guarantee the existence of a pure Nash equilibrium. For the case that the players are unweighted, we show that it is necessary and sufficient that for every resource and for every pair of players the corres...

One of the most challenging issues of transmission grids in restructured power networks is determining the real transmission service cost. In this paper, a method for calculating the transmission service in different grids is presented. In the proposed method, the cost of power loss and congestion of transmission services are considered. Using this integrated model, the strengths and weaknesses...

Congestion management is one of the technical challenges in a Deregulated power system environment. Two types of Methodologies used in congestion Management are non-cost free methods and cost free methods. In this research work congestion is relieved by using cost-free methods considering FACTS Devices such as TCSC(Thyristor controlled series Compensator) and UPFC (Unified Power Flow Controller...

This paper investigates the existence and uniqueness of equilibrium in the Vickrey bottleneck model when each user controls a positive fraction of total traffic. Users simultaneously choose departure schedules for their vehicle fleets. Each user internalizes the congestion cost that each of its vehicles imposes on other vehicles in its fleet. We establish three results. First, a pure strategy N...

Network routing games, and more generally congestion games play a central role in algorithmic game theory, comparable to the role of the traveling salesman problem in combinatorial optimization. It is known that the price of anarchy is independent of the network topology for non-atomic congestion games. In other words, it is independent of the structure of the strategy spaces of the players, an...

We consider congestion games in wireless sensor networks that offer quantitatively distinct classes of routing paths. Each routing class is characterized by a service cost. Within a routing class, the maximum link congestion is also an important metric for measuring the quality of the paths. Here, we study routing games where each player i selfishly selects a path with a respective routing clas...

Rosenthal’s congestion games constitute one of the few known classes of noncooperative games possessing purestrategy Nash equilibria. In the network version, each player wants to route one unit of flow on a single path from her origin to her destination at minimum cost, and the cost of using an arc depends only on the total number of players using that arc. A natural extension is to allow for p...

Rosenthal’s congestion games constitute one of the few known classes of noncooperative games possessing pure-strategy Nash equilibria. In the network version, each player wants to route one unit of flow on a single path from her origin to her destination at minimum cost, and the cost of using an arc depends only on the total number of players using that arc. A natural extension is to allow for ...

In a deregulated power systems environment, congestion management is one of the technical problem needs to maintain a system as stable condition. One of the objective functions in congestion management is N-1 contingency analysis. Using N-1 contingency analysis find out the worst line outage and analysis that line, maintain the whole system as stable after the line outage. Two types of Methodol...