Global Information Lookup Global Information

Congestion game information


Congestion games (CG) are a class of games in game theory. They represent situations which commonly occur in roads, communication networks, oligopoly markets and natural habitats. There is a set of resources (e.g. roads or communication links); there are several players who need resources (e.g. drivers or network users); each player chooses a subset of these resources (e.g. a path in the network); the delay in each resource is determined by the number of players choosing a subset that contains this resource. The cost of each player is the sum of delays among all resources he chooses. Naturally, each player wants to minimize his own delay; however, each player's choices impose a negative externality on the other players, which may lead to inefficient outcomes.

The research of congestion games was initiated by the American economist Robert W. Rosenthal in 1973.[1] He proved that every congestion game has a Nash equilibrium in pure strategies (aka pure Nash equilibrium, PNE). During the proof, he in fact proved that every congestion game is an exact potential game. Later, Monderer and Shapley[2] proved a converse result: any game with an exact potential function is equivalent to some congestion game. Later research focused on questions such as:

  • Does the existence of equilibrium, as well as the existence of a potential function, extend to more general models of congestion games?
  • What is the quantitative inefficiency of congestion games?
  • What is the computational complexity of finding an equilibrium?
  1. ^ Rosenthal, Robert W. (1973), "A class of games possessing pure-strategy Nash equilibria", International Journal of Game Theory, 2: 65–67, doi:10.1007/BF01737559, MR 0319584, S2CID 121904640.
  2. ^ Monderer, Dov; Shapley, Lloyd S. (1996-05-01). "Potential Games". Games and Economic Behavior. 14 (1): 124–143. doi:10.1006/game.1996.0044. ISSN 0899-8256.

and 19 Related for: Congestion game information

Request time (Page generated in 0.8264 seconds.)

Congestion game

Last Update:

Congestion games (CG) are a class of games in game theory. They represent situations which commonly occur in roads, communication networks, oligopoly markets...

Word Count : 7421

Game theory

Last Update:

Game theory is the study of mathematical models of strategic interactions among rational agents. It has applications in many fields of social science,...

Word Count : 15903

TCP congestion control

Last Update:

start and congestion window (CWND), to achieve congestion avoidance. The TCP congestion-avoidance algorithm is the primary basis for congestion control...

Word Count : 5734

Price of anarchy in congestion games

Last Update:

in congestion games (CG). The inefficiency of congestion games was first illustrated by Pigou in 1920, using the following simple congestion game. Suppose...

Word Count : 3839

Potential game

Last Update:

congestion games: Rosenthal proved that every congestion game has an exact potential; Monderer and Shapley proved the opposite direction: every game with...

Word Count : 1907

Congestion pricing

Last Update:

Congestion pricing or congestion charges is a system of surcharging users of public goods that are subject to congestion through excess demand, such as...

Word Count : 13258

Monty Hall problem

Last Update:

form of a probability puzzle, based nominally on the American television game show Let's Make a Deal and named after its original host, Monty Hall. The...

Word Count : 9895

Coordination game

Last Update:

take 101 if 280 becomes too crowded. A congestion game is a crowding game in networks. The minority game is a game where the only objective for all players...

Word Count : 2242

Solving chess

Last Update:

the game of chess; that is, one by which one of the players (White or Black) can always force a victory, or either can force a draw (see solved game). It...

Word Count : 1574

Network theory

Last Update:

available and the largest degree nodes are unknown. Complex network Congestion game Quantum complex network Dual-phase evolution Network partition Network...

Word Count : 3410

Game Description Language

Last Update:

general game playing. It is part of the General Game Playing Project at Stanford University. GDL is a tool for expressing the intricacies of game rules...

Word Count : 1608

Determinacy

Last Update:

mathematics, that examines the conditions under which one or the other player of a game has a winning strategy, and the consequences of the existence of such strategies...

Word Count : 4090

Succinct game

Last Update:

types of succinct game exist (many having to do with allocation of resources). Examples include congestion games, network congestion games, scheduling...

Word Count : 1887

Blockchain game

Last Update:

significant congestion on the Ethereum network shortly after its launch, with approximately 30% of all Ethereum transactions at the time being for the game, and...

Word Count : 2951

Suicide of Fat Cat

Last Update:

from ordering takeout to the bridge, concerned about the growing traffic congestion brought about by the memorial. The Beijing News stated that using food...

Word Count : 2174

Multiplicative weight update method

Last Update:

commonly used model in evolutionary game theory. It converges to Nash equilibrium when applied to a congestion game. Operations research and online statistical...

Word Count : 3684

Cloud gaming

Last Update:

connections available, traffic congestion and other issues affecting network latency can affect the performance of cloud gaming, and the ability to use a service...

Word Count : 3446

CE

Last Update:

property of some sets in computability theory Congestion Experienced, a protocol element of the Explicit Congestion Notification data networking protocol Customer...

Word Count : 592

Sildenafil

Last Update:

effects of sildenafil use included headache, flushing, indigestion, nasal congestion, and impaired vision, including photophobia and blurred vision. Some sildenafil...

Word Count : 6742

PDF Search Engine © AllGlobal.net