The Stackelberg Model in Territorial Planning

The Stackelberg Model in Territorial Planning Full article

Journal

Automation and Remote Control
ISSN: 0005-1179 , E-ISSN: 1608-3032

Output data

Year: 2019, Volume: 80, Number: 2, Pages: 286-296 Pages count : 11 DOI: 10.1134/S0005117919020073

Tags

bilevel mathematical programming problems; computational complexity; Stackelberg game; stochastic local search

Authors

Lavlinskii S.M. ^1,2,3 , Panin A.A. ^1,2 , Plyasunov A.V. ^1,2

Affiliations

1	Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Novosibirsk, Russian Federation
2	Novosibirsk State University, Novosibirsk, Russian Federation
3	Trans-Baikal State University, Chita, Russian Federation

We propose a new model for the formation of a public-private partnership mechanism, formulated as a bilevel Boolean programming problem. We show that this task is ∑2P-hard in both optimistic and pessimistic forms. We develop a stochastic iterative algorithm for solving this problem. We also present computational experiments on real information that demonstrate the capabilities of the proposed approach. © 2019, Pleiades Publishing, Ltd.

Lavlinskii S.M. , Panin A.A. , Plyasunov A.V.
The Stackelberg Model in Territorial Planning
Automation and Remote Control. 2019. V.80. N2. P.286-296. DOI: 10.1134/S0005117919020073 WOS Scopus OpenAlex

Web of science:	WOS:000465860600007
Scopus:	2-s2.0-85064907337
OpenAlex:	W2941705762

DB	Citing
Scopus	8
OpenAlex	8