Geodesic
Random search methods for the solution of a Stackelberg game of resource allocation
Contributions to game theory and management, Tome 12 (2019), pp. 37-48 
Grigory I. Belyavsky; Natalya V. Danilova. Random search methods for the solution of a Stackelberg game of resource allocation. Contributions to game theory and management, Tome 12 (2019), pp. 37-48. http://geodesic.mathdoc.fr/item/CGTM_2019_12_a1/
@article{CGTM_2019_12_a1,
     author = {Grigory I. Belyavsky and Natalya V. Danilova},
     title = {Random search methods for the solution of {a~Stackelberg} game of resource allocation},
     journal = {Contributions to game theory and management},
     pages = {37--48},
     year = {2019},
     volume = {12},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/CGTM_2019_12_a1/}
}
TY  - JOUR
AU  - Grigory I. Belyavsky
AU  - Natalya V. Danilova
TI  - Random search methods for the solution of a Stackelberg game of resource allocation
JO  - Contributions to game theory and management
PY  - 2019
SP  - 37
EP  - 48
VL  - 12
UR  - http://geodesic.mathdoc.fr/item/CGTM_2019_12_a1/
LA  - en
ID  - CGTM_2019_12_a1
ER  - 
%0 Journal Article
%A Grigory I. Belyavsky
%A Natalya V. Danilova
%T Random search methods for the solution of a Stackelberg game of resource allocation
%J Contributions to game theory and management
%D 2019
%P 37-48
%V 12
%U http://geodesic.mathdoc.fr/item/CGTM_2019_12_a1/
%G en
%F CGTM_2019_12_a1

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

We consider a dynamic Stackelberg game on a finite time interval. The game is reduced to a problem of infinite-dimensional optimization with two additional constraints. Two finite-dimensional approximations of the problem are defined. They are solved by two numerical algorithms which do not require calculation of the gradient of the payoff function. The first algorithm is an algorithm of simulated annealing with a uniform partition of the interval. The second algorithm uses a piecewise-constant approximation of the solution with a choice of the interval partition. Two illustrative examples connected with a resource allocation problem are considered. The numerical results are given and compared.

[1] Basar T., Olsder G. Y., Dynamic Non-Cooperative Game Theory, SIAM, 1999 | MR

[2] Belyavsky G.I., Danilova N.V., Ougolnitsky G.A., “Evolutionary modeling in sustainable management of active systems”, Math. Game Theory Appl., 8:4 (2016), 14–29 (In Russian) | Zbl

[3] Belyavsky G. I., Danilova N. V., Ougolnitsky G. A., “Evolutionary methods for solving dynamic resource allocation problems”, Math. Game Theory Appl., 10:1 (2018), 5–22 (In Russian) | MR

[4] Belyavsky G., Danilova N., Ougolnitsky G., “A Markovian Mechanism of Proportional Resource Allocation in the Incentive Model as a Dynamic Stochastic Inverse Stackelberg Game”, Mathematics, 6:8 (2018), 131 | DOI | Zbl

[5] Christodoulou G., Sqouritza A., Tang B., “On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources”, SAGT 2015, LNCS, 9347, ed. M. Hoefer, 2015, 165–177 | MR | Zbl

[6] Germeier Yu. B., Non-antagonistic Games, Reidel Publishing Co., Dordrecht–Boston, 1986 | MR | Zbl

[7] Gorelov M. A., Kononenko A. F., “Dynamic models of conflicts. III. Hierarchical games”, Automation and Remote Control, 76:2 (2015), 264–277 | DOI | MR | Zbl

[8] Hazan E., “Introduction to Online Convex Optimization”, Foundations and Trends in Optimization, 2:3–4 (2015), 157–325

[9] Jones M. T., Artificial Intelligence: A Systems Approach, Infinity Science Press, Hingham, MA, 2008

[10] Kononenko A. F., “On multi-step conflicts with information exchange”, USSR Comp. Math. and Math. Phys., 17 (1977), 104–113 | DOI | MR

[11] Kononenko A. F., “The structure of the optimal strategy in controlled dynamic systems”, USSR Comp. Math. and Math. Phys., 1980, 13–24 | DOI | MR | Zbl

[12] Novikov D., Theory of Control in Organizations, Nova Science Publishers, New York, 2013 | MR

[13] Sutton R. S., Barto A., Reinforcement Learning: An Introduction, MIT Press, Cambridge, MA, 1998 | MR