Cœur et nucléolus des jeux de recouvrement
RAIRO - Operations Research - Recherche Opérationnelle, Tome 34 (2000) no. 3, pp. 363-383. 
@article{RO_2000__34_3_363_0,
     author = {Preux, Nicolas and Bendali, Fatiha and Mailfert, Jean and Quilliot, Alain},
     title = {C{\oe}ur et nucl\'eolus des jeux de recouvrement},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {363--383},
     publisher = {EDP-Sciences},
     volume = {34},
     number = {3},
     year = {2000},
     mrnumber = {1786468},
     zbl = {1006.91007},
     language = {fr},
     url = {http://archive.numdam.org/item/RO_2000__34_3_363_0/}
}
TY  - JOUR
AU  - Preux, Nicolas
AU  - Bendali, Fatiha
AU  - Mailfert, Jean
AU  - Quilliot, Alain
TI  - Cœur et nucléolus des jeux de recouvrement
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 2000
SP  - 363
EP  - 383
VL  - 34
IS  - 3
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/RO_2000__34_3_363_0/
LA  - fr
ID  - RO_2000__34_3_363_0
ER  - 
%0 Journal Article
%A Preux, Nicolas
%A Bendali, Fatiha
%A Mailfert, Jean
%A Quilliot, Alain
%T Cœur et nucléolus des jeux de recouvrement
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 2000
%P 363-383
%V 34
%N 3
%I EDP-Sciences
%U http://archive.numdam.org/item/RO_2000__34_3_363_0/
%G fr
%F RO_2000__34_3_363_0
Preux, Nicolas; Bendali, Fatiha; Mailfert, Jean; Quilliot, Alain. Cœur et nucléolus des jeux de recouvrement. RAIRO - Operations Research - Recherche Opérationnelle, Tome 34 (2000) no. 3, pp. 363-383. http://archive.numdam.org/item/RO_2000__34_3_363_0/

1. P. Chardaire, The core and nucleolus of simple plant location, Technical Report SYS-C95-08. University of East Anglia (1996).

2. J. Edmonds, Optimum branchings. National Bureau of Standards Journal of Research 69 B (1967) 125-130. | MR | Zbl

3. M. Göthe-Lundgren, K. Jörnsten et P. Värbrand, On the nucleolus of the basics vehicule routing game Math. Programming 27 (1996) 83-100. | MR | Zbl

4. D. Granot, A generalized linear production model: A unifying model. Math. Programming 34 (1986) 212-222. | MR | Zbl

5. M. Grotschel, L. Lovasz et A. Schrijver, The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1 (1981) 169-197. | MR | Zbl

6. A. Kopelowttz, Computation of the kernels of simple games and the nucleolus of n-person games, Technical Report RM-31. The Hebrew University of Jerusalem (1967).

7. M. Maschler, M. Peleg et L.S. Shapley, Geometric properties of the kernel, nucleolus and related solution concepts. Math. Oper. Res. 4 (1979) 303-338. | MR | Zbl

8. G. Owen, On the core of linear production games. Math. Programming 9 (1975) 358-370. | MR | Zbl

9. N. Preux, Tarification, coopération et compétition dans les réseaux de télécommunications, Ph. D. Thesis. Université Blaise Pascal (1999).

10. N. Preux, La théorie des jeux coopératifs : un outil pour l'allocation des coûts dans un réseau, Technical Report NT/DAC/ORI/5026 (1997).

11. D. Schmeidler, The nucleolus of a characteristic function game. SIAM J. Appl. Math. 17 (1969) 1163-1170. | MR | Zbl

12. A. Tamir, On the core of network synthesis games. Math. Programming 50 (1991) 123-135. | MR | Zbl

13. A. Tamir, On the core of cost allocation games defined on location problems. Transportation Science 27 (1992) 81-86. | MR | Zbl