On generalized Nash games and variational inequalities

We show that for a large class of problems a generalized Nash equilibrium can be calculated by solving a variational inequality. We analyze what solutions are found by this reduction procedure and hint at possible applications.     

Discounted Markov games; successive approximation and stopping times

This paper presents a number of successive approximation algorithms for the repeated two-person zero-sum game called Markov game using the criterion of total expected discounted rewards. AsWessels [1977] did for Markov decision processes stopping times are introduced in order to simplify the proofs. It is shown that each algorithm provides upper and lower bounds for the value of the game and nearly optimal stationary strategies for both players.     

Uniqueness for index-one differential variational inequalities

Uniqueness is shown for a class of index-one differential variational inequalities (DVIs). This result assumes that a certain matrix function is symmetric positive definite everywhere. Examples are given to show that this matrix being merely positive definite is not sufficient for uniqueness, even though this is sufficient for existence.     

Stability for differential mixed variational inequalities

In this paper, an existence theorem of Carathéodory weak solution for a differential mixed variational inequality is presented under suitable conditions. Furthermore, some upper semicontinuity and continuity results concerned with the Carathéodory weak solution set mapping for the differential mixed variational inequality are given when both the mapping and the constraint set are perturbed by two different parameters.     

Regularization of differential variational inequalities with locally prox-regular sets

This paper studies, for a differential variational inequality involving a locally prox-regular set, a regularization process with a family of classical differential equations whose solutions converge to the solution of the differential variational inequality. The concept of local prox-regularity will be termed in a quantified way, as $(r,\alpha )$ -prox-regularity.     

Iterative solution of matrix games using grid variational inequalities

A new approach to the approximate solution of matrix games is proposed. It is based on the reduction of the original problem to a variational inequality of a special form. In particular, this makes it possible to design preconditioned iterative methods, which proved to be effective as a tool for the numerical solution of large and ill-conditioned systems of linear algebraic equations.     

Nonlinear separation approach to inverse variational inequalities

In this paper, we employ the image space analysis to investigate an inverse variational inequality (for short, IVI) with a cone constraint. By virtue of the nonlinear scalarization function commonly known as the Gerstewitz function, three nonlinear weak separation functions, two nonlinear regular weak separation functions and a nonlinear strong separation function are first introduced. Then, by these nonlinear separation functions, theorems of the weak and strong alternative and some optimality conditions for IVI with a cone constraint are derived without any convexity. In particular, a global saddle-point condition for a nonlinear function is investigated. It is shown that the existence of a saddle point is equivalent to a nonlinear separation of two suitable subsets of the image space. Finally, two gap functions and an error bound for IVI with a cone constraint are obtained.     

Optimal stopping and stochastic control differential games for jump diffusions

We study stochastic differential games of jump diffusions driven by Brownian motions and compensated Poisson random measures, where one of the players can choose the stochastic control and the other player can decide when to stop the system. We prove a verification theorem for such games in terms of a Hamilton–Jacobi–Bellman variational inequality. The results are applied to study some specific examples, including optimal resource extraction in a worst-case scenario, and risk minimizing optimal portfolio and stopping.     

Periodic stopping games

Stopping games (without simultaneous stopping) are sequential games in which at every stage one of the players is chosen, who decides whether to continue the interaction or stop it, whereby a terminal payoff vector is obtained. Periodic stopping games are stopping games in which both of the processes that define it, the payoff process as well as the process by which players are chosen, are periodic and do not depend on the past choices. We prove that every periodic stopping game without simultaneous stopping, has either periodic subgame perfect ϵ-equilibrium or a subgame perfect 0-equilibrium in pure strategies. This work is part of the master thesis of the author done under the supervision of Prof. Eilon Solan. I am thankful to Prof. Solan for his inspiring guidance. I also thank two anonymous referees of the International Journal of Game Theory for their comments.     

Randomized stopping games and Markov market games

We study nonzero-sum stopping games with randomized stopping strategies. The existence of Nash equilibrium and ɛ-equilibrium strategies are discussed under various assumptions on players random payoffs and utility functions dependent on the observed discrete time Markov process. Then we will present a model of a market game in which randomized stopping times are involved. The model is a mixture of a stochastic game and stopping game. Research supported by grant PBZ-KBN-016/P03/99.     

Nonlinear variational inequalities and maximal monotone mappings in Banach spaces

Ohne Zusammenfassung     

Zero-sum stochastic games with stopping and control

We study a zero-sum stochastic game where each player uses both control and stopping times. Under certain conditions we establish the existence of a saddle point equilibrium, and show that the value function of the game is the unique solution of certain dynamic programming inequalities with bilateral constraints.     

Solution dependence on initial conditions in differential variational inequalities

In the first part of this paper, we establish several sensitivity results of the solution x(t, ξ) to the ordinary differential equation (ODE) initial-value problem (IVP) dx/dt = f(x), x(0) =  ξ as a function of the initial value ξ for a nondifferentiable f(x). Specifically, we show that for $\Xi_T \equiv \{\,x(t,\xi^0): 0 \leq t \leq T\,\}$ , (a) if f is “B-differentiable” on $\Xi_T$ , then so is the solution operator x(t;·) at ξ⁰; (b) if f is “semismooth” on $\Xi_T$ , then so is x(t;·) at ξ⁰; (c) if f has a “linear Newton approximation” on $\Xi_T$ , then so does x(t;·) at ξ⁰; moreover, the linear Newton approximation of the solution operator can be obtained from the solution of a “linear” differential inclusion. In the second part of the paper, we apply these ODE sensitivity results to a differential variational inequality (DVI) and discuss (a) the existence, uniqueness, and Lipschitz dependence of solutions to subclasses of the DVI subject to boundary conditions, via an implicit function theorem for semismooth equations, and (b) the convergence of a “nonsmooth shooting method” for numerically computing such boundary-value solutions.     

Existence results of semilinear differential variational inequalities without compactness

ABSTRACT

The purpose of this paper is to study a class of semilinear differential variational systems with nonlocal boundary conditions, which are obtained by mixing semilinear evolution equations and generalized variational inequalities. First we prove essential properties of the solution set for generalized variational inequalities. Then without requiring any compactness condition for the evolution operator or for the nonlinear term, two existence results for mild solutions are established by applying a weak topology technique combined with a fixed point theorem.