2019
DOI: 10.3934/jimo.2018048
|View full text |Cite
|
Sign up to set email alerts
|

A class of two-stage distributionally robust games

Abstract: An N-person noncooperative game under uncertainty is analyzed, in which each player solves a two-stage distributionally robust optimization problem that depends on a random vector as well as on other players' decisions. Particularly, a special case is considered, where the players' optimization problems are linear at both stages, and it is shown that the Nash equilibrium of this game can be obtained by solving a conic linear variational inequality problem.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
17
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 19 publications
(17 citation statements)
references
References 41 publications
(61 reference statements)
0
17
0
Order By: Relevance
“…The case when k > 1 can be used to combine different risk measures, for instance, if k = 2, we can define ρ(Z) = E(Z) + [E|Z − τ | p ] 1/p , where p ≥ 2. In order to solve (4) with ρ having the form like (19), the first problem is to solve the subproblem (10). We have the next result.…”
Section: Proof Denotementioning
confidence: 99%
See 2 more Smart Citations
“…The case when k > 1 can be used to combine different risk measures, for instance, if k = 2, we can define ρ(Z) = E(Z) + [E|Z − τ | p ] 1/p , where p ≥ 2. In order to solve (4) with ρ having the form like (19), the first problem is to solve the subproblem (10). We have the next result.…”
Section: Proof Denotementioning
confidence: 99%
“…Suppose that P is a probability measure on a measurable space (Ω, F), and that every finite subset of Ω is F-measurable. Let s = k+p+q+1, where k, p, q are defined in (19), (16) and Theorem 2.2 respectively. If the risk measure ρ P has the form of (19), then for any x ∈ X, the inner maximum problem (10) is equivalent to the following problem…”
Section: Proof Denotementioning
confidence: 99%
See 1 more Smart Citation
“…Remark 3: For the inequality constraints (16) of Theorem 1 and (31) of Theorem 2, the Matlab LMI toolbox can be used to obtain the results. For the equation constraint conditions of Equations (15) and (30), they can be transformed into the corresponding LMI conditions [25]- [27] as follows:…”
Section: Remarkmentioning
confidence: 99%
“…[24] converted the risk-averse two-stage stochastic programming model into a semidefinite programming problem. [22] and [23] considered consider distributionally robust two-stage stochastic convex programming problems with ambiguity sets proposed by [50], and converted this class of problems to a conic optimization problems. [26] proposed a data-driven two-stage distributionally optimization framework with φ− divergences constrained and presented a decomposition-based solution algorithm to solve the resulting models.…”
mentioning
confidence: 99%