Algorithmic game theory - nonstandard equilibrium concepts? I'm beginning my studies of algorithmic game theory, and it seems that the equilibrium concept usually taken is that of a fixed point in a graph. However, have people looked at alternative equilibrium concepts, such as limit cycles? I can imagine that a "tight" limit cycle - that is, a cycle in the graph of very small length - could be considered something that's "close" to the standard definition of equilibrium.

I've tried digging around Google Scholar, but to little avail.
You may be looking for something like Sink Equilibria (start from e.g. http://arxiv.org/abs/0902.0382 ) -- but the cycle length is not considered.