Diferenças

Aqui você vê as diferenças entre duas revisões dessa página.

--- geopro:pedro:games [2008/08/11 17:17] – pedro
+++ geopro:pedro:games [2012/02/16 20:00] (atual) – pedro
@@ Linha 1: / Linha 1: @@
 ====== Games ======
+==== Braess's paradox ====
+Braess's paradox, credited to the mathematician Dietrich Braess, states that **adding extra capacity to a network when the moving entities selfishly choose their route, can in some cases reduce overall performance**. This is because the Nash equilibrium of such a system is not necessarily optimal.
+The paradox is stated as follows: "For each point of a road network, let there be given the number of cars starting from it, and the destination of the cars. Under these conditions one wishes to estimate the distribution of traffic flow. Whether one street is preferable to another depends not only on the quality of the road, but also on the density of the flow. If every driver takes the path that looks most favorable to him, the resultant running times need not be minimal. Furthermore, it is indicated by an example that an extension of the road network may cause a redistribution of the traffic that results in longer individual running times."
 ====Schelling point====
@@ Linha 7: / Linha 13: @@
 ====Game Theory: Dominance, Nash Equilibrium, Symmetry====
-|B. L. Slantchev, 2007| [[http://www.leg.ufpr.br/~pedro/slantchev-game-theory.pdf|pdf]]|
+|B. L. Slantchev, 2007| {{http://www.leg.ufpr.br/~pedro/slantchev-game-theory.pdf|pdf}}|
 That is, we must be able to assume not only that all players are rational, but also
@@ Linha 269: / Linha 275: @@
 Associated with these resources is an NxN payoff matrix M = (M(i, j)). The game is played in N stages and each player is allowed to use each resource once and only once during these N stages.