Graphical Game Theory - Nash Equilibrium

Nash Equilibrium

Finding Nash equilibrium in a game takes exponential time in the size of the representation. If the graphical representation of the game is a tree, we can find the equilibrium in polynomial time. In the general case, where the maximal degree of a node is 3 or more, the problem is NP-complete.

Read more about this topic:  Graphical Game Theory

Famous quotes containing the words nash and/or equilibrium:

    A door is what a dog is perpetually on the wrong side of.
    —Ogden Nash (1902–1971)

    There is a relation between the hours of our life and the centuries of time. As the air I breathe is drawn from the great repositories of nature, as the light on my book is yielded by a star a hundred millions of miles distant, as the poise of my body depends on the equilibrium of centrifugal and centripetal forces, so the hours should be instructed by the ages and the ages explained by the hours.
    Ralph Waldo Emerson (1803–1882)