相关论文: Variational Inequality Approach to Stochastic Nash…
We investigate stochastic differential games of optimal trading comprising a finite population. There are market frictions in the present framework, which take the form of stochastic permanent and temporary price impacts. Moreover,…
We solve the stochastic generalized Nash equilibrium (SGNE) problem in merely monotone games with expected value cost functions. Specifically, we present the first distributed SGNE seeking algorithm for monotone games that requires one…
We study the Cauchy problem in $n$-dimensional space for the system of Navier-Stokes equations in critical mixed-norm Lebesgue spaces. Local well-posedness and global well-posedness of solutions are established in the class of critical…
In this paper, we study the problem of the distributed Nash equilibrium seeking of N-player games over jointly strongly connected switching networks. The action of each player is governed by a class of uncertain nonlinear systems. Our…
The global dynamics is investigated for a duopoly game where the perfect foresight hypothesis is relaxed and firms are worst-case maximizers. Overlooking the degree of product substitutability as well as the sensitivity of price to…
The equilibrium problem defined by the Nikaid\^o-Isoda-Fan inequality contains a number of problems such as optimization, variational inequality, Kakutani fixed point, Nash equilibria, and others as special cases. This paper presents a…
The problem of the distributed Nash equilibrium seeking for aggregative games has been studied over strongly connected and weight-balanced static networks and every time strongly connected and weight-balanced switching networks. In this…
This paper presents a new Bayesian framework for quantifying discretization errors in numerical solutions of ordinary differential equations. By modelling the errors as random variables, we impose a monotonicity constraint on the variances,…
We consider the computation of an equilibrium of a stochastic Nash equilibrium problem, where the player objectives are assumed to be $L_0$-Lipschitz continuous and convex given rival decisions with convex and closed player-specific…
This paper introduces a new method to achieve stable convergence to Nash equilibrium in duopoly noncooperative games. Inspired by the recent fixed-time Nash Equilibrium seeking (NES) as well as prescribed-time extremum seeking (ES) and…
We consider multi-agent decision making where each agent's cost function depends on all agents' strategies. We propose a distributed algorithm to learn a Nash equilibrium, whereby each agent uses only obtained values of her cost function at…
Within a common arbitrage-free semimartingale financial market we consider the problem of determining all Nash equilibrium investment strategies for $n$ agents who try to maximize the expected utility of their relative wealth. The utility…
While convergence of polynomial chaos approximation for linear equations is relatively well understood, a lot less is known for non-linear equations. The paper investigates this convergence for a particular equation with quadratic…
The distributed computation of Nash equilibria is assuming growing relevance in engineering where such problems emerge in the context of distributed control. Accordingly, we present schemes for computing equilibria of two classes of static…
The long time behaviour of solutions to stochastic porous media equations on smooth bounded domains with Dirichlet boundary data is studied. Based on weighted $L^{1}$-estimates the existence and uniqueness of invariant measures with optimal…
We show that the Navier-Stokes as well as a random perturbation of this equation can be derived from a stochastic variational principle where the pressure is introduced as a Lagrange multiplier. Moreover we describe how to obtain…
This paper considers a class of reinforcement-learning that belongs to the family of Learning Automata and provides a stochastic-stability analysis in strategic-form games. For this class of dynamics, convergence to pure Nash equilibria has…
We suggest a novel stochastic-approximation algorithm to compute a symmetric Nash-equilibrium strategy in a general queueing game with a finite action space. The algorithm involves a single simulation of the queueing process with dynamic…
The purpose of this paper is to develop a numerical method for finding an equilibrium point in a model, in which the loss function of each object (subject) is described by a convex function with respect to one of its variables. Such models…
We study the polyhedral structure of the static probabilistic lot-sizing problem and propose valid inequalities that integrate information from the chance constraint and the binary setup variables. We prove that the proposed inequalities…