%A S.D. Flam
%T Equilibrium Programming Using Proximal-Like Algorithms
%X We consider problems where solutions -- called equilibria -- emerge as fixed points of an extremal mapping. Examples include convex programming, convex -- concave saddle problems, many noncooperative games, and quasi -- monotone variational inequalities. Using Bregman functions we develop proximal -- like algorithms for finding equilibria. At each iteration we allow numerical errors or approximate solutions.
%C IIASA, Laxenburg, Austria
%D 1995
%I WP-95-055
%L iiasa4538