title: About Construction of Realizability Arias of Salesman Strategies in Dynamic Salesmen Problem
metadata.name: dc.contributor.author
metadata.value: Gavrilova, Anastasiya V.
metadata.lang: -
metadata.name: dc.contributor.author
metadata.value: Pankratova, Yaroslavna B.
metadata.lang: -
metadata.name: dc.date.accessioned
metadata.value: 2021-11-26T18:47:40Z
metadata.lang: -
metadata.name: dc.date.available
metadata.value: 2021-11-26T18:47:40Z
metadata.lang: -
metadata.name: dc.date.issued
metadata.value: 2021-10
metadata.lang: -
metadata.name: dc.identifier.citation
metadata.value: Gavrilova A. V., Pankratova Ya V. About Construction of Realizability Arias of Salesman Strategies in Dynamic Salesmen Problem. Contributions to Game Theory and Management, XIV, 113-121.
metadata.lang: en_GB
metadata.name: dc.identifier.other
metadata.value: https://doi.org/10.21638/11701/spbu31.2021.10
metadata.lang: -
metadata.name: dc.identifier.uri
metadata.value: http://hdl.handle.net/11701/33692
metadata.lang: -
metadata.name: dc.description.abstract
metadata.value: The dynamic travelling salesman problem, where we assume that
  all objects can move with constant velocity, is considered. To solve this NPhard
  problem we use a game-theoretic approach and well-known solution
  concepts of pursuit games. We identify the realizability areas of salesman
  strategies depending on the initial positions of customers and their velocities.
  We present different cases of realizability areas of salesman strategies
  constructing in Python program with several numbers of customers.
metadata.lang: en_GB
metadata.name: dc.language.iso
metadata.value: en
metadata.lang: en_GB
metadata.name: dc.publisher
metadata.value: St Petersburg State University
metadata.lang: en_GB
metadata.name: dc.relation.ispartofseries
metadata.value: Contributions to Game Theory and Management;Volume 14
metadata.lang: -
metadata.name: dc.subject
metadata.value: dynamic travelling salesman problem
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: non-zero sum game
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: Nash equilibrium
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: realizability areas
metadata.lang: en_GB
metadata.name: dc.title
metadata.value: About Construction of Realizability Arias of Salesman Strategies in Dynamic Salesmen Problem
metadata.lang: en_GB
metadata.name: dc.type
metadata.value: Article
metadata.lang: en_GB
resources.filename: 113-121.pdf
resources.url: https://dspace.spbu.ru/bitstream/11701/33692/1/113-121.pdf
resources.format: Adobe PDF
resources.size: 1,13 MB