TY - GEN

T1 - Mathematical Modelling of the Interaction of Online Shop Agents

AU - Zaitseva, Irina

AU - Malafeyev, Oleg

AU - Shebukova, Anna

AU - Sugak, Dmitry

AU - Zubov, Afanasy

AU - Orlov, Vyacheslav

N1 - Publisher Copyright: © 2021 IEEE.

PY - 2021

Y1 - 2021

N2 - The operation of an online shop that sells goods from a certain range is considered. There is a service area that can be defined by a network in which nodes of potential consumers are located. The task is to maximize profits of the participating agents or minimize the cost function of these agents. Revenue can be increased by reducing shipping costs by designing economical customer diversions routes, and by increasing the number of customers by lowering the price and placing drop-off points convenient for customers to pick up the goods themselves. This paper deals with two practical problems. The first problem involves two agents: The first is the online shop itself, which will make the delivery and wants to minimise its shipping costs. The second agent is the customer who is waiting for delivery and wants to minimise waiting time. The second problem involves three agents: The first two agents are the same as in the first problem, and a third agent appears, advertising, who needs to choose the path in which the benefits of advertising are maximised. It is convenient to solve these problems with a decision tree, whose branches will correspond to customer diversions strategies, in a given period of time, and given that in the next period there is a change in demand due to the actions of economic agents (creating advertising, detouring customers past crowded places and others), diversions strategies should also be changed.

AB - The operation of an online shop that sells goods from a certain range is considered. There is a service area that can be defined by a network in which nodes of potential consumers are located. The task is to maximize profits of the participating agents or minimize the cost function of these agents. Revenue can be increased by reducing shipping costs by designing economical customer diversions routes, and by increasing the number of customers by lowering the price and placing drop-off points convenient for customers to pick up the goods themselves. This paper deals with two practical problems. The first problem involves two agents: The first is the online shop itself, which will make the delivery and wants to minimise its shipping costs. The second agent is the customer who is waiting for delivery and wants to minimise waiting time. The second problem involves three agents: The first two agents are the same as in the first problem, and a third agent appears, advertising, who needs to choose the path in which the benefits of advertising are maximised. It is convenient to solve these problems with a decision tree, whose branches will correspond to customer diversions strategies, in a given period of time, and given that in the next period there is a change in demand due to the actions of economic agents (creating advertising, detouring customers past crowded places and others), diversions strategies should also be changed.

KW - decision tree

KW - model

KW - modelling

KW - trade-off

UR - http://www.scopus.com/inward/record.url?scp=85123675814&partnerID=8YFLogxK

U2 - 10.1109/SUMMA53307.2021.9632061

DO - 10.1109/SUMMA53307.2021.9632061

M3 - Conference contribution

AN - SCOPUS:85123675814

SP - 356

EP - 360

BT - Proceedings - 2021 3rd International Conference on Control Systems, Mathematical Modeling, Automation and Energy Efficiency, SUMMA 2021

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 3rd International Conference on Control Systems, Mathematical Modeling, Automation and Energy Efficiency, SUMMA 2021

Y2 - 10 November 2021 through 12 November 2021

ER -