Campuses:

Nash functions

Tuesday, October 24, 2006 - 10:50am - 11:40am
Theodore Turocy (Texas A & M University)
An intriguing fact about the celebrated Nash equilibrium concept in
finite
games is that it can be expressed mathematically in a variety of ways:
as a fixed point, a solution to a complementarity program, a (global)
minimizer, or a solution to a system of polynomial equations and
inequalities.
As a result, there are general-purpose algorithms to compute Nash
equilibria
on finite games. Many of these algorithms relate specifically to
well-studied areas of numerical programming, including linear
programming,
Subscribe to RSS - Nash functions