Robust allocation rules in dynamical cooperative TU Games

被引:2
|
作者
Bauso, D. [1 ]
Reddy, P. V. [2 ]
机构
[1] Univ Palermo, Dip Ingn Informat, Viale Sci, I-90128 Palermo, Italy
[2] Tilburg Univ, Dept Econometr & Operat Res, NL-5000 LE Tilburg, Netherlands
关键词
CORE;
D O I
10.1109/CDC.2010.5718036
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Robust dynamic coalitional TU games are repeated TU games where the values of the coalitions are unknown but bounded variables. We set up the game supposing that the Game Designer uses a vague measure of the extra reward that each coalition has received up to the current time to re-adjust the allocations among the players. As main result, we provide a constructive method for designing allocation rules that converge to the core of the average game. Both the set up and the solution approach also provide an insight on commonalities between coalitional games and stability theory.
引用
收藏
页码:1504 / 1509
页数:6
相关论文
共 50 条