Equilibrium Programming Using Proximal-Like AlgorithmsS.D.FlamauthorWe 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.1995-06WP-95-055Monograph