Geodesic
Computation problems for envy stable solutions of allocation problems with public resources
Contributions to game theory and management, Tome 14 (2021), pp. 302-311.

Voir la notice de l'article provenant de la source Math-Net.Ru

We consider generalizations of TU games with restricted cooperation in partition function form and propose their interpretation as allocation problems with several public resources. Either all resources are goods or all resources are bads. Each resource is distributed between points of its set and permissible coalitions are subsets of the union of these sets. Each permissible coalition estimates each allocation of resources by its gain/loss function, that depends only on the restriction of the allocation on that coalition. A solution concept of "fair" allocation (envy stable solution) was proposed by the author in (Naumova, 2019). This solution is a simplification of the generalized kernel of cooperative games and it generalizes the equal sacrifice solution for claim problems. An allocation belongs to this solution if there do not exist special objections at this allocation between permissible coalitions. For several classes of such problems we describe methods for computation selectors of envy stable solutions.
Keywords: Wardrop equilibrium, envy stable solution, games with restricted cooperation, equal sacrifice solution. 
@article{CGTM_2021_14_a22,
     author = {Natalia I. Naumova},
     title = {Computation problems for envy stable solutions of allocation problems with public resources},
     journal = {Contributions to game theory and management},
     pages = {302--311},
     publisher = {mathdoc},
     volume = {14},
     year = {2021},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/CGTM_2021_14_a22/}
}
TY  - JOUR
AU  - Natalia I. Naumova
TI  - Computation problems for envy stable solutions of allocation problems with public resources
JO  - Contributions to game theory and management
PY  - 2021
SP  - 302
EP  - 311
VL  - 14
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/CGTM_2021_14_a22/
LA  - en
ID  - CGTM_2021_14_a22
ER  - 
%0 Journal Article
%A Natalia I. Naumova
%T Computation problems for envy stable solutions of allocation problems with public resources
%J Contributions to game theory and management
%D 2021
%P 302-311
%V 14
%I mathdoc
%U http://geodesic.mathdoc.fr/item/CGTM_2021_14_a22/
%G en
%F CGTM_2021_14_a22
Natalia I. Naumova. Computation problems for envy stable solutions of allocation problems with public resources. Contributions to game theory and management, Tome 14 (2021), pp. 302-311. http://geodesic.mathdoc.fr/item/CGTM_2021_14_a22/

[1] USSR Comput. Math. and Math. Phys., 7 | MR | Zbl

[2] Justman M., “Iterative processes with "nucleolar" restrictons”, International Journal of Game Theory, 6 (1977), 189–212 | MR | Zbl

[3] Krylatov A. Y., Zakharov V. V., “Game-Theoretic Approach for Modeling of Selfish and Group Routing”, Contributions to Game Theory and Management, 10 (2017), 162–174 | MR

[4] Mazalov V. V., Mathematical Game Theory and Applications, Lan, Saint Petersburg, 2010, 448 pp. (Russian)

[5] Moulin H., “Axiomatic cost and surplus sharing”, Handbook on Social Choice and Welfare, Ch. 6, v. 1, eds. Arrow K.J., Sen A.K., Suzumura K., 2002, 289–357

[6] Naumova N., “Claim problems with coalition demands”, Contributions to Game Theory and Management, 4 (2011), 311–326 | MR | Zbl

[7] Naumova N., “Generalized proportional solutions to games with restricted cooperation”, Contributions to Game Theory and Management, 5 (2012), 230–242 | MR | Zbl

[8] Naumova N., “Envy stable solutions for allocation problems with public resources”, Contributions to Game Theory and Managemen, 12 (2019), 261–272 | MR

[9] Sudholter P., Peleg B., Introduction to the Theory of Cooperative Games, 2nd edn., Springer, Berlin–Heidelberg, 2007 | MR | Zbl

[10] Wardrop J. G., “Some theoretical aspects of road traffic research”, Proc. Institution of Civil Engineers, 2 (1952), 325–378