Please use this identifier to cite or link to this item: https://dspace.ncfu.ru/handle/20.500.12258/5389
Title: Competitive mechanism for the distribution of labor resources in the transport objective
Authors: Marenchuk, Y. A.
Маренчук, Ю. А.
Keywords: Integer programming;Coalition game;Competitive mechanisms;Economic activities;Economic theories;Labor force;Labor resources;Optimal variants;Transport problems;Economics
Issue Date: 2019
Publisher: Institute of Physics Publishing
Citation: Zaitseva, I., Malafeyev, O., Marenchuk, Y., Kolesov, D., Bogdanova, S. Competitive Mechanism for the Distribution of Labor Resources in the Transport Objective // Journal of Physics: Conference Series. - 2019. - Volume 1172. - Issue 1. - Номер статьи 012089
Series/Report no.: Journal of Physics: Conference Series
Abstract: This article proposes a close labor force allocation model based on the use of a competitive mechanism. Many practical economic activity tasks and some economic theory issues are associated with the tasks of determining the optimal variant for solving the problem of the distribution of labor resources. One of these solutions is a compromise set. This article is devoted to the search for this set in a non-antagonistic non-coalition game related to the transport problem of integer programming
URI: https://www.scopus.com/record/display.uri?eid=2-s2.0-85064863476&origin=resultslist&sort=plf-f&src=s&st1=Competitive+Mechanism+for+the+Distribution+of+Labor+Resources+in+the+Transport+Objective&st2=&sid=1dc85366fed6ba491cee221b8d0f0141&sot=b&sdt=b&sl=103&s=TITLE-ABS-KEY%28Competitive+Mechanism+for+the+Distribution+of+Labor+Resources+in+the+Transport+Objective%29&relpos=0&citeCnt=0&searchTerm=
http://hdl.handle.net/20.500.12258/5389
Appears in Collections:Статьи, проиндексированные в SCOPUS, WOS

Files in This Item:
File Description SizeFormat 
scopusresults 904 .pdf
  Restricted Access
659.74 kBAdobe PDFView/Open
WoS 619 .pdf
  Restricted Access
77.87 kBAdobe PDFView/Open


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