Multi-Agent Interaction in Social Trading Network

TL;DR

This paper presents an algorithm for optimally placing delivery points in an online retail network with consumers and retailers, aiming to minimize costs and adhere to optimality principles.

Contribution

It introduces a novel algorithm for optimal placement of delivery points in social trading networks based on a compromise solution.

Findings

Algorithm effectively minimizes total costs.

Optimal placement aligns with the principle of optimality.

Applicable to online retail networks with consumer and retailer nodes.

Abstract

The online retailers network models are considered. In some nodes of the network consumers are located. Each consumer wishes to purchase a particular product at minimal cost due to the price of goods and transport corruption costs. Also, in some nodes of network online-retailers wish to allocate the points of goods delivery. The points of goods delivery must be placed in accordance with a certain principle of optimality. In this paper we propose an algorithm for finding the optimal placement of goods delivery points in accordance with the compromise solution as the principle of optimality.