This work studies a new strategic game called delegation game. A delegation game is associated to a basic game with a finite number of players where each player has a finite integer weight and her strategy consists in dividing it into several integer parts and assigning each part to one subset of finitely many facilities. In the associated delegation game, a player divides her weight into several integer parts, commits each part to an independent delegate and collects the sum of their payoffs in the basic game played by these delegates. Delegation equilibrium payoffs, consistent delegation equilibrium payoffs and consistent chains inducing these ones in a delegation game are defined. Several examples are provided.
Mots clés : basic integer-splitting game, delegation game, delegation equilibrium payoffs, consistent delegation equilibrium payoffs, consistent chains
@article{RO_2013__47_1_47_0,
author = {Sorin, Sylvain and Wan, Cheng},
title = {Delegation equilibrium payoffs in integer-splitting games},
journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
pages = {47--58},
publisher = {EDP-Sciences},
volume = {47},
number = {1},
year = {2013},
doi = {10.1051/ro/2013026},
mrnumber = {3143741},
zbl = {1272.91021},
language = {en},
url = {http://www.numdam.org/articles/10.1051/ro/2013026/}
}
TY - JOUR AU - Sorin, Sylvain AU - Wan, Cheng TI - Delegation equilibrium payoffs in integer-splitting games JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 2013 SP - 47 EP - 58 VL - 47 IS - 1 PB - EDP-Sciences UR - http://www.numdam.org/articles/10.1051/ro/2013026/ DO - 10.1051/ro/2013026 LA - en ID - RO_2013__47_1_47_0 ER -
%0 Journal Article %A Sorin, Sylvain %A Wan, Cheng %T Delegation equilibrium payoffs in integer-splitting games %J RAIRO - Operations Research - Recherche Opérationnelle %D 2013 %P 47-58 %V 47 %N 1 %I EDP-Sciences %U http://www.numdam.org/articles/10.1051/ro/2013026/ %R 10.1051/ro/2013026 %G en %F RO_2013__47_1_47_0
Sorin, Sylvain; Wan, Cheng. Delegation equilibrium payoffs in integer-splitting games. RAIRO - Operations Research - Recherche Opérationnelle, Tome 47 (2013) no. 1, pp. 47-58. doi : 10.1051/ro/2013026. http://www.numdam.org/articles/10.1051/ro/2013026/
[1] , and , The price of collusion in series-parallel networks, in Integer Programming and Combinatorial Optimization, edited by F. Eisenbrand and F.B. Shepherd. Springer Berlin Heidelberg. Lecture Notes in Comput. Sci. (2010) 313-326. | Zbl
[2] , and , The impact of oligopolistic competition in networks. Oper. Res. 57 (2009) 1421-1437. | Zbl
[3] , Multiple equilibrium behaviors on networks. Transport. Sci. 22 (1988) 39-46. | Zbl
[4] , and , The effect of collusion in congestion games (extended abstract), edited by J.M. Kleinberg. ACM, New York, Proc. of the 38th Annual ACM Symposium on Theory of Computing (2006) 89-98. | Zbl
[5] , Collusion in atomic splittable routing games, edited by L. Aceto, M. Henzinger and J. Sgall. Springer Berlin Heidelberg, Proc. of the 38th International Conference on Automata, Languages and Programming (2011) 564-575.
[6] , A class of games possessing pure-strategy Nash equilibria. Int. J. Game Theory 2 (1973) 65-67. | Zbl
[7] , A reexamination of the perfectness concept for equilibrium points in extensive games. Int. J. Game Theory 4 (1973) 25-55. | MR | Zbl
[8] , Coalitions in network congestion games. Math. Oper. Res. 37 (2012) 654-669. | MR | Zbl
[9] , Contributions à la théorie des jeux d'évolution et de congestion. Ph.D. thesis, Université Pierre et Marie Curie (Paris 6), France (2012).
[10] , Some theoretical aspects of road traffic research communication networks. Proc. Inst. Civ. Eng. II (1952) 325-378.
Cité par Sources :
