本文的目标是利用随机逼近（SA）方案来近似随机纳什博弈中的稳定价格（PoS）。PoS 是博弈论中最常用的指标之一，为估计纳什博弈的效率提供了一种途径。特别是，了解 PoS 的值有助于设计高效的网络化系统，包括交通网络和电力市场机制。由于缺乏计算 PoS 的有效方法，我们首先考虑具有非光滑且仅凸的目标函数以及仅单调的随机变分不等式（SVI）约束的随机优化问题。该问题出现在 PoS 比值的分子中。我们开发了一种随机块坐标随机额外（次）梯度方法，其中采用了一种新颖的迭代惩罚方案，以在算法的两次梯度更新中分别考虑 SVI 的映射。我们获得了阶为 $ε^{-4}$ 的迭代复杂度，这似乎是这类带约束随机优化问题中已知最好的结果，其中 $ε$ 表示对适当定义的不可行性和次优性度量的任意界限。其次，我们开发了一种基于 SA 的方案来近似 PoS，并推导出近似误差的下界和上界。为了验证理论发现，我们提供了网络化随机纳什古诺竞争上的初步仿真结果。
英文摘要：
The goal in this paper is to approximate the Price of Stability (PoS) in stochastic Nash games using stochastic approximation (SA) schemes. PoS is amongst the most popular metrics in game theory and provides an avenue for estimating the efficiency of Nash games. In particular, knowing the value of PoS can help with designing efficient networked systems, including transportation networks and power market mechanisms. Motivated by the lack of efficient methods for computing the PoS, first we consider stochastic optimization problems with a nonsmooth and merely convex objective function and a merely monotone stochastic variational inequality (SVI) constraint. This problem appears in the numerator of the PoS ratio. We develop a randomized block-coordinate stochastic extra-(sub)gradient method where we employ a novel iterative penalization scheme to account for the mapping of the SVI in each of the two gradient updates of the algorithm. We obtain an iteration complexity of the order $ε^{-4}$ that appears to be best known result for this class of constrained stochastic optimization problems, where $ε$ denotes an arbitrary bound on suitably defined infeasibility and suboptimality metrics. Second, we develop an SA-based scheme for approximating the PoS and derive lower and upper bounds on the approximation error. To validate the theoretical findings, we provide preliminary simulation results on a networked stochastic Nash Cournot competition.
We study a mean field game problem arising from the production control for multiple firms with price stickiness in the commodity market. The price dynamics for each firm is described as a (controlled) jump-diffusion process with mean-field interaction. Each firm aims to maximize her expectation of cumulative net profit coupled with each other through price processes. By solving the limiting control problem and a fixed-point problem, we construct an explicit approximating Nash equilibrium when the number of firms grows large.
This paper presents an application of mean field control to dynamic production optimization. Both noncooperative and cooperative solutions are considered. We first introduce a market of a large number of agents (firms) with sticky prices and adjustment costs. By solving auxiliary limiting optimal control problems subject to consistent mean field approximations, two sets of decentralized strategies are obtained and further shown to asymptotically attain Nash equilibria and social optima, respectively. The performance estimate of the social optimum strategies exploits a passivity property of the…
We consider the problem of optimal charging of plug-in electric vehicles (PEVs). We treat this problem as a multi-agent game, where vehicles/agents are heterogeneous since they are subject to possibly different constraints. Under the assumption that electricity price is affine in total demand, we show that, for any finite number of heterogeneous agents, the PEV charging control game admits a unique Nash equilibrium, which is the optimizer of an auxiliary minimization program. We are also able to quantify the asymptotic behaviour of the price of anarchy for this class of games. More precisely, …
Our paper concerns the computation of Nash equilibria of first-price auctions with correlated values. While there exist several equilibrium computation methods for auctions with independent values, the correlation of the bidders' values introduces significant complications that render existing methods unsatisfactory in practice. Our contribution is a step towards filling this gap: inspired by the seminal fictitious play process of Brown and Robinson, we present a learning heuristic-that we call fictitious bidding (FB)-for estimating Bayes-Nash equilibria of first-price auctions with correlated…
We study a static game played by a finite number of agents, in which agents are assigned independent and identically distributed random types and each agent minimizes its objective function by choosing from a set of admissible actions that depends on its type. The game is anonymous in the sense that the objective function of each agent depends on the actions of other agents only through the empirical distribution of their type-action pairs. We study the asymptotic behavior of Nash equilibria, as the number of agents tends to infinity, first by deriving laws of large numbers characterizes almos…
In this paper we introduce the concept of split Nash equilibrium problems associated with two related noncooperative strategic games. Then we apply the Fan-KKM theorem to prove the existence of solutions to split Nash equilibrium problems of related noncooperative strategic games, in which the strategy sets of the players are nonempty closed and convex subsets in Banach spaces. As application of this existence to economics, an example is provided to study the existence of split Nash equilibrium of utilities of two related economies. As applications, we study the existence of split Nash equilib…
Decentralized Multi-product Pricing: Diagonal Dominance, Nash Equilibrium, and Price of Anarchy
Department of Information & Decision Sciences, College of Business Administration, University of Illinois Chicago（伊利诺伊大学芝加哥分校商学院信息与决策科学系）；Department of Industrial Engineering & Decision Analytics, The Hong Kong University of Science and Technology（香港科技大学工业工程与决策分析系）；Department of Technology and Operations, Ross School of Business, University of Michigan（密歇根大学罗斯商学院技术与运营系）
This paper proposes a novel energy sharing mechanism for prosumers who can produce and consume. Different from most existing works, the role of individual prosumer as a seller or buyer in our model is endogenously determined. Several desirable properties of the proposed mechanism are proved based on a generalized game-theoretic model. We show that the Nash equilibrium exists and is the unique solution of an equivalent convex optimization problem. The sharing price at the Nash equilibrium equals to the average marginal disutility of all prosumers. We also prove that every prosumer has the incen…
In this paper, we introduce the concept of infinitely split Nash equilibrium in repeated games in which the profile sets are chain-complete posets. Then by using a fixed point theorem on posets in [8], we prove an existence theorem. As an application, we study the repeated extended Bertrant duopoly model of price competition.
In this paper we study Mean Field Game systems under density constraints as optimality conditions of two optimization problems in duality. A weak solution of the system contains an extra term, an additional price imposed on the saturated zones. We show that this price corresponds to the pressure field from the models of incompressible Euler's equations {à} la Brenier. By this observation we manage to obtain a minimal regularity, which allows to write optimality conditions at the level of single agent trajectories and to define a weak notion of Nash equilibrium for our model.
We consider a large population dynamic game in discrete time where players are characterized by time-evolving types. It is a natural assumption that the players' actions cannot anticipate future values of their types. Such games go under the name of dynamic Cournot-Nash equilibria, and were first studied by Acciaio et al., as a time/information dependent version of the games devised by Blanchet and Carlier for the static situation, under an extra assumption that the game is of potential type. The latter means that the game can be reduced to the resolution of an auxiliary variational problem. I…
This paper investigates Nash equilibrium (NE) seeking problems for noncooperative games over multi-players networks with finite bandwidth communication. A distributed quantized algorithm is presented, which consists of local gradient play, distributed decision estimating, and adaptive quantization. Exponential convergence of the algorithm is established, and a relationship between the convergence rate and the bandwidth is quantitatively analyzed. Finally, a simulation of an energy consumption game is presented to validate the proposed results.
We study one-shot Nash competition between an arbitrary number of identical dealers that compete for the order flow of a client. The client trades either because of proprietary information, exposure to idiosyncratic risk, or a mix of both trading motives. When quoting their price schedules, the dealers do not know the client's type but only its distribution, and in turn choose their price quotes to mitigate between adverse selection and inventory costs. Under essentially minimal conditions, we show that a unique symmetric Nash equilibrium exists and can be characterized by the solution of a no…
The modelling of modern power markets requires the representation of the following main features: (i) a stochastic dynamic decision process, with uncertainties related to renewable production and fuel costs, among others; and (ii) a game-theoretic framework that represents the strategic behavior of multiple agents, for example in daily price bids. These features can be in theory represented as a stochastic dynamic programming recursion, where we have a Nash equilibrium for multiple agents. However, the resulting problem is very challenging to solve. This work presents an iterative process to s…
In this paper, we compute $ε$-approximate Nash equilibria in atomic splittable polymatroid congestion games with convex Lipschitz continuous cost functions. The main approach relies on computing a pure Nash equilibrium for an associated integrally-splittable congestion game, where players can only split their demand in integral multiples of a common packet size. It is known that one can compute pure Nash equilibria for integrally-splittable congestion games within a running time that is pseudo-polynomial in the aggregated demand of the players. As the main contribution of this paper, we decide…
Strategic Index Reconstitution: Differential Games, Closed-Loop Equilibria and Mean-Field Dynamics
Institute for Computational and Mathematical Engineering, Stanford University（斯坦福大学计算与数学工程研究所）；Department of Management Science and Engineering, Stanford University（斯坦福大学管理科学与工程系）
We consider a peer-to-peer electricity market, where agents hold private information that they might not want to share. The problem is modeled as a noncooperative communication game, which takes the form of a Generalized Nash Equilibrium Problem, where the agents determine their randomized reports to share with the other market players, while anticipating the form of the peer-to-peer market equilibrium. In the noncooperative game, each agent decides on the deterministic and random parts of the report, such that (a) the distance between the deterministic part of the report and the truthful priv…
Game contingent claims (GCCs) generalize American contingent claims by allowing the writer to recall the option as long as it is not exercised, at the price of paying some penalty. In incomplete markets, an appealing approach is to analyze GCCs like their European and American counterparts by solving option holder's and writer's optimal investment problems in the underlying securities. By this, partial hedging opportunities are taken into account. We extend results in the literature by solving the stochastic game corresponding to GCCs with both continuous time stopping and trading. Namely, we …
