Multilevel Stackelberg strategies in linear-quadratic systems

Open-loop multilevel Stackelberg strategies in deterministic, sequential decision-making problems for continuous linear systems and quadratic criteria are developed. Characterization of the Stackelberg controls via the solution of a higher-order square-matrix-Riccati differential equation is established; also, the basic structural properties of the coefficient matrices of this differential equation are established, and the basic structural properties of its solution are inferred.This work was supported in part by the Energy Research and Development Administration, Contract No. ERDA E(49-18)-2088.on leave from the Mihailo Pupin Institute, Belgrade, Yugoslavia.     

Closed-loop Stackelberg solution to a multistage linear-quadratic game

A new solution of a two-person, nonzero-sum Stackelberg game, with linear dynamics, quadratic performance criteion, and closed-loop information available to both players, is presented. This solution is applicable to all problems where the leader is able to influence the objective function of the follower, and this function is strictly convex with respect to the control variable handled by the follower. The resulting equilibrium strategies adapt to the possible nonoptimal behavior of players at some stages of the game. The strategy of the leader has a simple interpretation of a threat formulated by the leader toward the follower and, if necessary, carried out one stage after the follower has played inconsistently with the leader's wishes.     

Closed-form solution for discrete-time linear-quadratic Stackelberg games

A method is proposed for solving the two-point boundary-value problem occurring in discrete-time linear-quadratic Stackelberg games. It is shown that, for open-loop information structure, the necessary conditions can be ordered to form a symplectic matrix. The solution is then obtained by exploiting the properties of such a matrix.     

Stackelberg strategies in linear-quadratic stochastic differential games

This paper obtains the Stackelberg solution to a class of two-player stochastic differential games described by linear state dynamics and quadratic objective functionals. The information structure of the problem is such that the players make independent noisy measurements of the initial state and are permitted to utilize only this information in constructing their controls. Furthermore, by the very nature of the Stackelberg solution concept, one of the players is assumed to know, in advance, the strategy of the other player (the leader). For this class of problems, we first establish existence and uniqueness of the Stackelberg solution and then relate the derivation of the leader's Stackelberg solution to the optimal solution of a nonstandard stochastic control problem. This stochastic control problem is solved in a more general context, and its solution is utilized in constructing the Stackelberg strategy of the leader. For the special case Gaussian statistics, it is shown that this optimal strategy is affine in observation of the leader. The paper also discusses numerical aspects of the Stackelberg solution under general statistics and develops algorithms which converge to the unique Stackelberg solution.This work was performed while the second author was on sabbatical leave at the Department of Applied Mathematics, Twente University of Technology, Enschede, Holland.     

Sufficient conditions for Stackelberg and Nash strategies with memory

Sufficiency conditions for Stackelberg strategies for a class of deterministic differential games are derived when the players have recall of the previous trajectory. Sufficient conditions for Nash strategies when the players have recall of the trajectory are also derived. The state equation is linear, and the cost functional is quadratic. The admissible strategies are restricted to be affine in the information available.This work was supported in part by the Joint Services Electronics Program under Contract No. N00014-79-C-0424, in part by the National Science Foundation under Grant No. ECS-79-19396, and in part by Department of Energy under Contract No. EX-76-C-01-2088.     

基于Stackelberg博弈的闭环供应链回收模式选择及其优化研究

从闭环供应链视角,分别构建了包含制造商、零售商、线上回收商和线下回收商等不同主体参与的四种闭环供应链回收模式,并通过Stackelberg博弈分析,求解了各模式中回收主体的均衡利润以及供应链总利润,得出了闭环供应链的最佳回收模式。在此基础上,进一步引入碳交易机制对最佳回收模式进行了优化分析,最后,运用Matlab 2017a软件仿真验证了模型分析的合理性和优化作用的有效性。研究结果表明:由线上和线下回收商、零售商、制造商组成的多回收主体模式(即O/U/R/M-M模式)能够使得包括各回收主体在内的供应链整体利润最大化,因而是现实中应该优先选择的回收模式;回收再制造比例值的变化与各模式下供应链各成员的利润值高低直接相关;而碳交易机制的引入能有效提升最佳回收模式中的制造商利润及供应链总利润。     

网约车新政下平台和乘客的Stackelberg博弈模型及策略研究

近年来,滴滴和优步等网约车平台的出现给城市居民出行带来了新的选择,然而随着新政的实施以及垄断巨头的酝酿诞生,网约车平台是否会降补贴提车价成为消费者最为关心的问题。文章构建网约车平台和乘客之间的Stackelberg博弈模型,分析了网约车平台的补贴和抽成策略对乘客是否选择网约车出行的决策行为以及网约车市场均衡的影响。理论研究和仿真结果表明：网约车平台合理的补贴力度和抽成力度可以有效规避行政监管成本增加和乘客资源流失的风险,提高双方的收益,实现社会的帕累托最优。     

基于差价补偿策略的斯塔克尔伯格博弈协调优化

以智能产品为研究对象,建立了差价补偿策略下制造商与销售商的博弈模型,分别通过纳什均衡博弈和斯塔克尔伯格博弈协调优化对制造商和销售商的决策行为进行探讨,得到了Nash均衡下制造商与销售商之间交易策略,讨论了斯塔克尔伯格博弈下制造商的最优订购、最优补偿系数和销售商的订购量之间关系,提出了求解在给定补偿系数下斯塔克尔伯格博弈协调优化的近似最优批发价与最优订购量的算法。通过数值实验表明,制造商占优势地位时,差价补偿策略能实现整体供应链的协调优化,提高销售商的订购量以及制造商和销售商的利润,说明差价补偿策略可以有效地改善零供关系。     

A Stackelberg equilibrium for a missile procurement problem

This paper deals with a procurement problem of missiles involving the efficient assignment of the missiles to some targets. Within a fixed amount of budget, a leader purchases several types of missiles, by which he aims to damage as much value as possible a follower hides into some facilities later. The effectiveness of the missile depends on the type of missile and facility. A payoff of the game is the expected amount of destroyed value. The problem is generalized as a two-person zero-sum game of distributing discrete resources with a leader and a follower. Our problem is to derive a Stackelberg equilibrium for the game. This type of game has an abundance of applications. The problem is first formulated into an integer programming problem with a non-separable objective function of variables and it is further equivalently transformed into a maximin integer knapsack problem. We propose three exacts methods and an approximation method for an optimal solution.     

非方广义系统带最坏干扰抑制的奇异LQ问题

研究了非方广义系统带最坏干扰抑制的奇异线性二次指标最优控制问题(即LQ问题).在给定的条件下,最坏干扰和最优控制—状态对均存在且惟一,最优控制可被综合为状态反馈.在最坏干扰和最优控制作用下,所得闭环系统的任意有限特征值均在开左半复平面,且闭环系统的状态有最少自由元.     

Proxy-Users通信系统的Stackelberg模型及解的存在性

用博奕论的S tackelberg策略理论研究了P roxy-U sers通信系统.对P roxy和U sers的地位不平等的情况,建立了该系统的S tackelberg策略模型.得到了一个双层规划模型.并证明了模型的解的存在性.     

Stackelberg solutions for fuzzy random two-level linear programming through probability maximization with possibility

This paper considers Stackelberg solutions for decision making problems in hierarchical organizations under fuzzy random environments. Taking into account vagueness of judgments of decision makers, fuzzy goals are introduced into the formulated fuzzy random two-level linear programming problems. On the basis of the possibility and necessity measures that each objective function fulfills the corresponding fuzzy goal, together with the introduction of probability maximization criterion in stochastic programming, we propose new two-level fuzzy random decision making models which maximize the probabilities that the degrees of possibility and necessity are greater than or equal to certain values. Through the proposed models, it is shown that the original two-level linear programming problems with fuzzy random variables can be transformed into deterministic two-level linear fractional programming problems. For the transformed problems, extended concepts of Stackelberg solutions are defined and computational methods are also presented. A numerical example is provided to illustrate the proposed methods.     

Backward induction algorithm for a class of closed-loop Stackelberg games

In the paper a new deterministic continuum-strategy two-player discrete-time dynamic Stackelberg game is proposed with fixed finite time duration and closed-loop information structure. The considered payoff functions can be widely used in different applications (mainly in conflicts of consuming a limited resource, where one player, called leader, is a superior authority choosing strategy first, and another player, called follower, chooses after).     

Optimal strategies for equal-sum dice games

In this paper, we consider a non-cooperative two-person zero-sum matrix game, called dice game. In an (n,σ) dice game, two players can independently choose a dice from a collection of hypothetical dice having n faces and with a total of σ eyes distributed over these faces. They independently roll their dice and the player showing the highest number of eyes wins (in case of a tie, none of the players wins). The problem at hand in this paper is the characterization of all optimal strategies for these games. More precisely, we determine the (n,σ) dice games for which optimal strategies exist and derive for these games the number of optimal strategies as well as their explicit form.     

An algorithm of evolutionarily stable strategies for the single-population evolutionary game

In this paper, we study the single-population evolutionary game and construct an algorithm to find evolutionarily stable strategies. Finally, by an example, we illuminate the computing process of algorithm.