Please use this identifier to cite or link to this item: https://dspace.ncfu.ru/handle/123456789/31985
Title: Game-Theoretic Modeling of Agents for Supply Chain
Authors: Martynovskaya, A. S.
Мартыновская, А. С.
Bondar, V. V.
Бондарь, В. В.
Skvortsova, O. I.
Скворцова, О. И.
Keywords: Warehouses;Supplier strategies;Complete information;Game-theoretic model;On demands;Optimization variables;Product shortages;Supply
Issue Date: 2024
Publisher: Institute of Electrical and Electronics Engineers Inc.
Citation: Poddubnaya, N., Shlaev, D. V., Martynovskaya, A., Bondar, V. V., Skvortsova, O. I., Novozhilova, L. M. Game-Theoretic Modeling of Agents for Supply Chain // Proceedings 2024 6th International Conference on Control Systems Mathematical Modeling Automation and Energy Efficiency Summa. - 2024. - pp. 108 - 111. - DOI: 10.1109/SUMMA64428.2024.10803784
Series/Report no.: Proceedings 2024 6th International Conference on Control Systems Mathematical Modeling Automation and Energy Efficiency Summa
Abstract: In this paper, we model a game with complete information with two agents in a supply chain: one supplier - one retailer. The supplier strategy is batches of goods. The retailer provides the supplier with information on demand for goods, the supplier makes a decision on purchasing and delivering batches to the retailer. The supplier manages the inventory, the proposed model is subject to the VMI concept and is a model of cooperation between the supplier and the retailer. The problem is to minimize the cost of a supply chain, in which the optimization variable is the maximum level of product shortages. The problem takes into account product shortages, monetary penalties for shortages, limitations on the supplier's warehouse space, and the number of orders.
URI: https://dspace.ncfu.ru/handle/123456789/31985
Appears in Collections:Статьи, проиндексированные в SCOPUS, WOS

Files in This Item:
File SizeFormat 
scopusresults 3672.pdf
  Restricted Access
127.49 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.