Multiplicateurs de Kuhn-Tucker pour des jeux non coopératifs contraints
This paper deals with a multistage stochastic programming portfolio selection problem with a new type of risk premium constraints. These risk premiums are constructed on the multistage scenario tree. Two ways of the construction are introduced and compared. The risk premiums are incorporated in the multistage stochastic programming portfolio selection problem. The problem maximizes the multivariate (multiperiod) utility function under condition that the multistage risk premiums are smaller than...
This paper is devoted to the introduction and study of a new family of multivariate elicitable risk measures. We call the obtained vector-valued measures multivariate expectiles. We present the different approaches used to construct our measures. We discuss the coherence properties of these multivariate expectiles. Furthermore, we propose a stochastic approximation tool of these risk measures.
Stochastic dominance is widely used in comparing two risks represented by random variables or random vectors. There are general approaches, based on knowledge of distributions, which are dedicated to identify stochastic dominance. These methods can be often simplified for specific distribution. This is the case of univariate normal distribution, for which the stochastic dominance rules have a very simple form. It is however not straightforward if these rules are also valid for multivariate normal...
Traffic flow is modeled by a conservation law describing the density of cars. It is assumed that each driver chooses his own departure time in order to minimize the sum of a departure and an arrival cost. There are N groups of drivers, The i-th group consists of κi drivers, sharing the same departure and arrival costs ϕi(t),ψi(t). For any given population sizes κ1,...,κn, we prove the existence of a Nash equilibrium solution, where no driver can lower his own total cost by choosing a different departure...
This work concerns a class of discrete-time, zero-sum games with two players and Markov transitions on a denumerable space. At each decision time player II can stop the system paying a terminal reward to player I and, if the system is no halted, player I selects an action to drive the system and receives a running reward from player II. Measuring the performance of a pair of decision strategies by the total expected discounted reward, under standard continuity-compactness conditions it is shown...
This paper deals with the problem of designing Nash equilibrium points in noncooperative games in which agents anticipate values of Lagrange multipliers coordinating their payoff functions. The addressed model of agents' interactions, referred to as the price-anticipation game, is studied within the framework of coordination and mechanism design theory for hierarchical systems. Sufficient conditions are formulated for Nash implementation of a regular and isolated solution to a coordination problem....
This paper is concerned with mathematical modelling in the management of a wastewater treatment system. The problem is formulated as looking for a Nash equilibrium of a multiobjective pointwise control problem of a parabolic equation. Existence of solution is proved and a first order optimality system is obtained. Moreover, a numerical method to solve this system is detailed and numerical results are shown in a realistic situation posed in the estuary of Vigo (Spain).
In this paper, we investigate Nash equilibrium payoffs for nonzero-sum stochastic differential games with reflection. We obtain an existence theorem and a characterization theorem of Nash equilibrium payoffs for nonzero-sum stochastic differential games with nonlinear cost functionals defined by doubly controlled reflected backward stochastic differential equations.
The main objective of this paper is to find structural conditions under which a stochastic game between two players with total reward functions has an -equilibrium. To reach this goal, the results of Markov decision processes are used to find -optimal strategies for each player and then the correspondence of a better answer as well as a more general version of Kakutani’s Fixed Point Theorem to obtain the -equilibrium mentioned. Moreover, two examples to illustrate the theory developed are presented....
Nowadays, nature–inspired metaheuristic algorithms are most powerful optimizing algorithms for solving the NP–complete problems. This paper proposes three approaches to find near–optimal Golomb ruler sequences based on nature–inspired algorithms in a reasonable time. The optimal Golomb ruler (OGR) sequences found their application in channel–allocation method that allows suppression of the crosstalk due to four–wave mixing in optical wavelength division multiplexing systems. The simulation results...
We present necessary conditions for linear noncooperative N-player delta dynamic games on an arbitrary time scale. Necessary conditions for an open-loop Nash-equilibrium and for a memoryless perfect state Nash-equilibrium are proved.