2019
DOI: 10.1137/17m1142971
|View full text |Cite
|
Sign up to set email alerts
|

Game-Theoretic Learning and Allocations in Robust Dynamic Coalitional Games

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 42 publications
0
3
0
Order By: Relevance
“…The control variable 𝐮(𝑡) is the vector of control values such that at every time 𝑡, before knowing the real demand, we can adjust the forecast values of the coalitions by subtracting the control value. From (18) we can rewrite the aggregate coalitional excess as follows:…”
Section: Dynamic Allocation Mechanismmentioning
confidence: 99%
See 1 more Smart Citation
“…The control variable 𝐮(𝑡) is the vector of control values such that at every time 𝑡, before knowing the real demand, we can adjust the forecast values of the coalitions by subtracting the control value. From (18) we can rewrite the aggregate coalitional excess as follows:…”
Section: Dynamic Allocation Mechanismmentioning
confidence: 99%
“…Due to this uncertainty, it is necessary to design an allocation mechanism that is robust and stable in the long term. Other works related to the design of robust and stable allocation mechanism are [17,18].…”
Section: Introductionmentioning
confidence: 99%
“…In this direction, Lehrer (2003) presented an allocation process which converges to the CORE (or if this is empty, to a least-CORE). Smyrnakis et al (2019) also consider an allocation process but under noisy observations and dynamic environment. Bauso et al (2014) provide conditions for an averaging process, with dynamics subject to controls and adversarial disturbances, under which the allocations converge to consensus in the desired set.…”
Section: Introductionmentioning
confidence: 99%