Approximate Convex Optimization by Online Game Playing

Lagrangian relaxation and approximate optimization algorithms have received much attention in the last two decades. Typically, the running time of these methods to obtain a $\epsilon$ approximate solution is proportional to $\frac{1}{\epsilon^2}$. Recently, Bienstock and Iyengar, following Nesterov, gave an algorithm for fractional packing linear programs which runs in $\frac{1}{\epsilon}$ iterations. The latter algorithm requires to solve a convex quadratic program every iteration - an optimization subroutine which dominates the theoretical running time. We give an algorithm for convex programs with strictly convex constraints which runs in time proportional to $\frac{1}{\epsilon}$. The algorithm does NOT require to solve any quadratic program, but uses gradient steps and elementary operations only. Problems which have strictly convex constraints include maximum entropy frequency estimation, portfolio optimization with loss risk constraints, and various computational problems in signal processing. As a side product, we also obtain a simpler version of Bienstock and Iyengar's result for general linear programming, with similar running time. We derive these algorithms using a new framework for deriving convex optimization algorithms from online game playing algorithms, which may be of independent interest

Multigrid methods for two-player zero-sum stochastic games

We present a fast numerical algorithm for large scale zero-sum stochastic games with perfect information, which combines policy iteration and algebraic multigrid methods. This algorithm can be applied either to a true finite state space zero-sum two player game or to the discretization of an Isaacs equation. We present numerical tests on discretizations of Isaacs equations or variational inequalities. We also present a full multi-level policy iteration, similar to FMG, which allows to improve substantially the computation time for solving some variational inequalities.Comment: 31 page

Towards an understanding of tradeoffs between regional wealth, tightness of a common environmental constraint and the sharing rules

Consider a country with two regions that have developed differently so that their current levels of energy efficiency differ. Each region's production involves the emission of pollutants, on which a regulator might impose restrictions. The restrictions can be related to pollution standards that the regulator perceives as binding the whole country (e.g., enforced by international agreements like the Kyoto Protocol). We observe that the pollution standards define a common constraint upon the joint strategy space of the regions. We propose a game theoretic model with a coupled constraints equilibrium as a solution to the regulator's problem of avoiding excessive pollution. The regulator can direct the regions to implement the solution by using a political pressure, or compel them to employ it by using the coupled constraints' Lagrange multipliers as taxation coefficients. We specify a stylised model that possesses those characteristics, of the Belgian regions of Flanders and Wallonia. We analytically and numerically analyse the equilibrium regional production levels as a function of the pollution standards and of the sharing rules for the satisfaction of the constraint. For the computational results, we use NIRA, which is a piece of software designed to min-maximise the associated Nikaido-Isoda function.coupled constraints, generalised Nash equilibrium, Nikaido-Isoda function, regional economics, environmental regulations.

An evolutionary game model for behavioral gambit of loyalists: Global awareness and risk-aversion

We study the phase diagram of a minority game where three classes of agents are present. Two types of agents play a risk-loving game that we model by the standard Snowdrift Game. The behaviour of the third type of agents is coded by {\em indifference} w.r.t. the game at all: their dynamics is designed to account for risk-aversion as an innovative behavioral gambit. From this point of view, the choice of this solitary strategy is enhanced when innovation starts, while is depressed when it becomes the majority option. This implies that the payoff matrix of the game becomes dependent on the global awareness of the agents measured by the relevance of the population of the indifferent players. The resulting dynamics is non-trivial with different kinds of phase transition depending on a few model parameters. The phase diagram is studied on regular as well as complex networks