Matching Optimization for Automated Negotiation: From a Privacy-Enhanced Data Modeling Perspective

Abstract

Automated negotiation in multi-agent electronic commerce environments relies heavily on efficient and reliable matching mechanisms to connect negotiation participants. However, existing matching protocols often fail to ensure transaction security and user data privacy, while also lacking adaptability to dynamic negotiation contexts. To address these challenges, this study proposes a privacy-enhanced multi-agent matching optimization framework that integrates trust evaluation, privacy protection, and adaptive decision-making. First, a trust-based negotiation relationship network is constructed through complex network analysis to establish a secure and trustworthy negotiation environment. Second, a privacy-enhanced automated negotiation protocol is developed, employing the cumulative distribution function to transform sensitive data into probabilistic representations, thereby safeguarding user privacy without compromising data availability. Finally, a reinforcement learning algorithm is incorporated to optimize the matching process dynamically, using satisfaction as the reward function to achieve efficient and Pareto-optimal results. A series of experiments verify the framework’s effectiveness, demonstrating significant improvements in system robustness, adaptability, and matching accuracy. This study aims to provide a comprehensive solution that integrates trust network modeling, privacy protection, and adaptive matching optimization, serving as a valuable reference for the development of secure and intelligent automated negotiation platforms.

1. Introduction

With the rapid expansion of digital transactions, Multi-Agent Systems (MAS) have become increasingly prevalent in electronic commerce environments. Among their various applications, adaptive matching in multi-agent transactions serves as a crucial bridge between user demand and service supply, playing a vital role in automated negotiation systems [1,2]. This process enables intelligent decision support in complex negotiation settings by helping manufacturers and consumers identify compatible trading partners, thereby improving transaction efficiency and user satisfaction [3,4]. For example, Pactum’s automated negotiation platform automates counterpart matching and price negotiation, substantially reducing labor and time costs. However, as multi-agent negotiation systems continue to evolve, ensuring their security, reliability, and privacy protection has emerged as a critical challenge.

The matching process, as a fundamental prerequisite for automated negotiation, significantly influences negotiation performance. The success rate of automated negotiation depends heavily on the reliability of participating agents. Engaging with untrustworthy agents can compromise negotiation outcomes, undermine system stability, and increase transaction risks. Existing research on transaction matching in automated negotiation primarily employs rule-based or heuristic matching algorithms [5], often leveraging historical data [6], user preferences [7], and transaction intentions [4]. While these approaches improve efficiency, they typically overlook the complex trust and social relationships among users, leading to mismatches and limited robustness in scenarios with sparse or uncertain data. Moreover, without explicit consideration of trust and reliability assessments among network nodes, such methods are susceptible to manipulation and may diverge from real-world negotiation dynamics.

To address these shortcomings, this study proposes a multi-dimensional trust evaluation framework that integrates complex network analysis to construct a trust-based negotiation relationship network. By quantifying and screening trust relationships across local and global dimensions, the framework identifies and excludes untrustworthy nodes, effectively refining the negotiation counterpart search space. This approach aims to enhance the security, transparency, and stability of automated negotiation environments.

Meanwhile, the increasing focus on trust also highlights renewed concerns regarding data security and privacy protection in automated negotiation systems [8]. Negotiation processes often involve sensitive information—such as pricing strategies, trading terms, and private user data—that must be protected against leakage and misuse. Traditional methods like data masking [9], data segmentation [10], and strict access control [11] provide partial protection but often compromise processing efficiency and adaptability to dynamic negotiation data streams. To overcome these limitations, this study introduces a privacy-enhanced automated negotiation protocol that transforms deterministic data into statistical cumulative distribution functions. This transformation enables effective decision-making in matching while minimizing direct data exposure, thereby balancing privacy preservation and computational efficiency in real-time negotiation contexts.

In addition to improving data security, this study aims to further enhance the matching process through intelligent optimization. Traditional matching algorithms typically rely on static rules or historical data [12], making them inflexible to changing user requirements and prone to unstable recommendation quality. To overcome this, we incorporate a Q-learning algorithm based on reinforcement learning to dynamically optimize the matching process. By defining inter-item satisfaction as a reward function, the algorithm continuously learns from negotiation feedback and adjusts strategies in real time, thereby improving adaptability, efficiency, and the likelihood of achieving Pareto-optimal outcomes.

In summary, while existing studies have made exploratory progress in trust modeling and privacy protection within automated negotiation systems, these two aspects are typically examined in isolation. To address this limitation, this paper presents an integrated framework for multi-agent automated negotiation, combining trust network modeling, privacy-enhancing data processing, and reinforcement learning. Compared with existing research, this paper contributes in three major aspects:

(1)

From a mechanism design perspective, we propose a trust-aware negotiation framework in which multi-dimensional trust evaluation is integrated into the negotiation matching process, rather than functioning as a loosely coupled auxiliary module.

(2)

We develop a privacy-enhanced negotiation protocol that transforms sensitive negotiation attributes into probabilistic representations, allowing privacy protection to be endogenously incorporated into the protocol design and decision-making process, instead of relying on exogenous privacy safeguards.

(3)

Building upon the integrated trust and privacy framework, we design a reinforcement learning-based adaptive matching strategy that dynamically optimizes negotiation outcomes under privacy and trust constraints.

The remainder of this paper is organized as follows: Section 2 provides a survey of related works. Section 3 elaborates on the proposed model. A case study with a series of experiments is conducted, and the experimental analysis is presented and discussed in Section 4. Section 5 concludes this paper, and Section 6 discusses the theoretical implications, practical implications, and limitations.

2. Literature Review

2.1. Adaptive Matching in Automated Negotiation

Automated negotiation employs intelligent agents to represent human participants in the negotiation process, aiming to enhance negotiation efficiency and decision quality through automation technologies [13,14]. Within this field, the design of adaptive matching strategies plays a pivotal role, as the quality of matching directly affects negotiation efficiency, success rate, and overall system performance [15].

Recent studies have increasingly focused on modeling both explicit and implicit relationships among potential negotiation counterparts in the pre-negotiation phase. Such modeling enables a deeper understanding of how interpersonal and inter-agent relationships influence counterpart selection and subsequent strategic alignment, using either qualitative or quantitative methods [1,16]. The objective of these approaches is to assist negotiation platforms in identifying optimal counterparts by analyzing attributes such as cooperation potential, cost, and resource complementarity [4,5,17]. For instance, Beauprez et al. [18] proposed a heuristic agent strategy that dynamically reorders negotiation counterparts to accelerate bilateral negotiations and reduce time costs. However, this approach relies on local search mechanisms, which may lead to suboptimal global outcomes. Similarly, Munroe et al. [19] emphasized balancing conflict reduction and cost minimization when selecting negotiation partners under resource-constrained environments. While these studies focus on the structural elements of matching, they frequently neglect participant satisfaction and the alignment of attributes in traded commodities within e-commerce negotiation settings. To bridge this gap, recent work—including the present study—aims to explore the integration of reinforcement learning algorithms to enhance satisfaction-based adaptive matching and promote the intelligent evolution of automated negotiation systems.

Furthermore, the open and dynamic nature of e-commerce environments introduces security risks [20], such as malicious participation, unauthorized access, and service fraud. Ensuring the trustworthiness of negotiation participants is therefore critical to maintaining reliable transactions. Previous research has generally assessed trust from a single-dimensional perspective. For example, Shao et al. [21] developed a dynamic recommendation trust model based on normal distribution to filter unreliable information using indirect trust factors and hierarchical pruning. Zhu et al. [22] proposed a trust evaluation method grounded in social cognition theory, constructing a trust ontology for service agents to support computational trust inference. Although these studies have advanced the field, most remain exploratory and lack multi-dimensional perspectives on trust. In response, this paper tries to propose a multi-dimensional trust evaluation framework and constructs a multi-level negotiation relationship network to narrow the search space for negotiation counterparties. By filtering untrustworthy nodes and strengthening reliable connections, the proposed approach enhances both the security and efficiency of transaction matching in automated negotiation systems.

Based on the above discussion, existing studies have investigated adaptive matching strategies from different perspectives, including heuristic opponent selection, trust-based filtering, and learning-assisted decision-making. To provide a systematic comparison of these approaches,

Table 1. Comparison of adaptive matching methods in automated negotiation.

Study	Research Target	Matching Basis	Trust Considered	Dynamic Adaptation Supported	Main Limitations
[5]	Bilateral/multilateral negotiation	Static rules and preferences	No	No	Rigid rules, difficult to adapt to dynamic environments
[7]	Multi-attribute negotiation	Preference similarity	No	Limited	Ignores relational and security factors
[18]	Bilateral negotiation	Time and cost heuristics	No	Yes	Prone to local optima and lacks a global perspective
[19]	Multi-agent systems	Cost–conflict trade-off	No	Yes	Negotiation relationship networks are not modeled
[21]	Agent systems	Direct trust and indirect trust	Yes	Limited	Trust modeling is single-dimensional and not deeply integrated with matching mechanisms
[22]	Service agents	Trust ontology and reasoning rules	Yes	No	Focuses on trust representation, lacking matching and decision optimization mechanisms

presents a summary of representative adaptive matching methods in automated negotiation.

In summary, existing adaptive matching methods either rely on static heuristics or incorporate trust in a limited or auxiliary manner, lacking learning-driven dynamic adaptation. By contrast, this work integrates reinforcement learning with multi-dimensional trust modeling to enable continuous and adaptive optimization of negotiation matching decisions.

2.2. Protocols in Automated Negotiation

In automated negotiation systems, protocols define the fundamental rules that govern communication, offer exchange, decision-making, and consensus formation among agents. These protocols play a critical role in ensuring negotiation efficiency, fairness, and reliability, while also reducing the need for human intervention. Over the years, research on negotiation protocols has primarily focused on the design of stopping rules and aggregation rules, which determine when to accept, reject, or modify offers and how to manage time constraints to accelerate decision-making [22,23,24].

Beyond rule definition, recent studies have explored various enhancements to negotiation protocols to improve adaptability, personalization, and decision optimization. For instance, Zhou et al. [25] developed a mediator-based multilateral protocol that employs relational networks to generate personalized offers and improve cooperation among agents. Shinohara and Fujita [26] designed a protocol incorporating opponent modeling, enabling agents to estimate counterpart utility functions while maintaining fairness in information disclosure. Similarly, Kolomvatsos et al. [23] introduced a token-based bilateral negotiation protocol that balances privacy preservation with negotiation effectiveness. These advances have contributed to more flexible and human-like automated negotiation systems.

However, despite these achievements, data security and privacy protection remain insufficiently addressed in most existing protocols. Automated negotiation often involves highly sensitive information—such as pricing strategies, trading conditions, and proprietary business data—that, if improperly handled, may lead to privacy breaches or exploitation risks. While some studies touch upon confidentiality or partial encryption, few have proposed systematic approaches that explicitly integrate privacy protection into the core negotiation protocol. To bridge this gap, this study aims to develop a privacy-enhanced automated negotiation protocol that transforms sensitive transactional data into secure probabilistic forms. The proposed framework aims to mitigate privacy and security risks while maintaining negotiation efficiency and transparency, thereby supporting the practical deployment of automated negotiation systems in complex and data-sensitive business environments.

Based on the above discussion on privacy protection in automated negotiation, existing studies have proposed various negotiation protocols with different privacy-preserving mechanisms. To facilitate a systematic comparison,

Table 2. Comparison of negotiation protocols with privacy-preserving mechanisms.

Study	Protocol Type	Privacy Protection Mechanism	Endogenous Privacy Protection	Impact on Efficiency	Main Limitations
[9,10,11]	Data masking/access control	Data masking, partitioning, access control	No	High	Operates as an exogenous mechanism and negatively affects real-time computation
[22,23,24]	Classical negotiation protocols	None	No	Low	Privacy issues are not considered
[25,27]	Mediator-based negotiation protocol	Partial information disclosure	No	Medium	Privacy protection is not systematic
[25,26]	Opponent modeling-based protocol	Partial information hiding	No	Medium	Risk of sensitive information leakage
[23,26]	Token-based negotiation protocol	Token obfuscation	Partial	Medium	Limited applicability

presents a comparison of representative negotiation protocols with privacy-preserving mechanisms.

In summary, most existing negotiation protocols introduce privacy protection as an external or auxiliary mechanism, rather than embedding it into the protocol design itself. Although certain approaches partially integrate privacy-preserving elements, they often provide limited protection and incur efficiency trade-offs.

3. The Proposed Model

3.1. Model Framework

This study aims to establish a secure and reliable automated negotiation transaction matching system to foster stable negotiation relationships and facilitate high-quality negotiation outcomes. The model framework comprises three modules, illustrated in Figure 1. The first module involves establishing a trust network to ensure the inclusion of secure and trustworthy negotiation participants, which also lays the foundation for network analysis. The second module focuses on constructing a privacy-enhanced automated negotiation protocol. Building upon Module 1, this protocol encrypts the sensitive information of negotiation participants to safeguard data security and privacy. The third module introduces the reinforcement learning algorithm into the negotiation counterpart matching process, integrating satisfaction functions into the Q-learning algorithm to dynamically match optimal adversaries for each negotiation participant. The integration of these three modules not only improves negotiation efficiency but also ensures the protection of user privacy and information security. Additionally, it establishes a unified, computable input framework for automated negotiations, thereby enhancing the system’s transparency and interpretability.

Specifically, our research commences with defining key concepts such as imperfectly competitive negotiation, negotiation relationship network, negotiation subject, and negotiation counterpart. In the initial phase, we construct a negotiation relationship network centered around the negotiation subject, utilizing the theory of six degrees of separation. This network serves as the basis for narrowing the negotiation space by evaluating local and global trust attributes. Subsequently, we classify commodity attribute data into interval number type, fuzzy number type, and semantic number type, detailing transformation steps for each data type into cumulative distribution function form. Finally, we use the Q-learning reinforcement algorithm oriented to the user’s satisfaction with goods, enabling precise matching between user needs and negotiation counterparts.

3.2. Definitions and Construction Method of Negotiation Network

This section aims to establish a negotiation relationship network using the six degrees of separation theory. It details the construction of this network through the breadth-first search method, highlighting the hierarchy of relationships formed by direct and indirect connections between nodes.

3.2.1. Key Concepts and Definitions

To facilitate understanding, this subsection begins with clear definitions of concepts related to imperfectly competitive negotiations and negotiation relationship networks:

Definition 1.

An imperfectly competitive negotiation assumes a blend of competitiveness and cooperation among participants [28]. In this type of negotiation, participants leverage their strengths to secure more favorable conditions while also considering the reactions and interests of the other party to achieve a mutually acceptable agreement.

Definition 2.

Negotiation Relationship Network assumes that the relationship network formed by each participant in the negotiation within an organizational environment can be represented by a graph model, denoted as $G=\left\{N,E\right\}$. Here, $N$ represents the set of nodes, which are the negotiation participants, and $E$ represents the set of edges, which indicate the social relationships between these negotiation participants.

Definition 3.

The negotiation subject refers to the party or parties involved in the negotiation [8], specifically the decision-making entities responsible for selecting other parties to engage in the negotiation. The negotiating subject can be an individual, a company, or another type of organization. The negotiating subject is capable of identifying and selecting the negotiating counterpart that best suits its needs using the proposed methods.

Definition 4.

Negotiation counterpart refers to the other party or parties selected for negotiation [2], i.e., the counterparty or partner chosen by the negotiating subject. This selection is based on an analysis of negotiation costs, security levels, and other factors within the negotiation relationship network.

3.2.2. The Negotiation Network Construction Based on Breadth-First Search

In the context of imperfectly competitive negotiations, constructing negotiation relationship networks is crucial for clarifying participant relationships and enhancing negotiation security. Typically, negotiation participants may lack direct communication channels, resulting in sparse negotiation networks. To address this, the Six Degrees of Separation Theory [29] is applied in this study to construct a hierarchical and relatively complete network of negotiation relationships by systematically searching for direct or indirect connections.

The basic principle of the Six Degrees of Separation Theory is that there exists an implicit connection path between the nodes of a social network. Through forwarding information or establishing direct connections from one level to another, the entire network can achieve a high degree of connectivity. In this theory, “degree” refers to the length of the path connecting two individuals. According to the Six Degrees of Separation Theory, the negotiation counterpart with direct contact with the negotiation subject is categorized as the first level of relationship. Based on the first level, the negotiation counterpart connected to the first level forms the second level of the relationship. This process is repeated until the predetermined requirements are met. In practice, the search scope is generally controlled within four levels of relationships [30]. This is because, in real-world scenarios, a shallower search range can usually identify the target node or target relationship more accurately. Additionally, limiting the search range can prevent a drastic increase in the load of the relationship network and improve the accuracy of search results.

Accordingly, based on the Six Degrees of Separation Theory, this study uses the negotiation subject as the starting node for a breadth-first search [31]. The search depth is controlled to no more than four degrees to construct the negotiation agent relationship network. The steps are as follows:

Step 1: Initialize the relationship network graph $G$, which stores relationships between negotiation participants.

Step 2: Add negotiation subject: Include the negotiation subject agent as a node in the relationship network.

Step 3: Extend the relational network using breadth-first search, limiting the search depth to 4: Firstly, create an empty queue for storing pending nodes and their depth information. Secondly, create an empty collection for recording nodes that have been accessed to avoid repeated access. Then, add the negotiation subject agent to the queue and mark it as accessed. Finally, continuously remove nodes from the queue and iterate through their neighboring nodes.

Step 4: Generate the relationship network graph.

To facilitate understanding, this study provides a schematic diagram of the negotiation relationship network constructed based on breadth-first search, as shown in Figure 2.

In this network relationship schematic, the red node represents the negotiation subject agent; the blue nodes indicate negotiation agents with a direct connection to the negotiation subject, classified as first-level relationship nodes; and the grey nodes represent negotiation agents with an indirect connection to the negotiation subject, classified as second-level relationship nodes. Overall, the combination of red, blue, and grey nodes constitutes a hierarchical negotiation relationship network.

3.3. Trust-Based Negotiation Space Reduction Method

In this subsection, we employ logistic regression to fuse trust-related features among nodes within the negotiation relationship network. This approach evaluates the trustworthiness levels between nodes. Subsequently, nodes identified as untrustworthy are removed from the negotiation network. This refinement reduces the search scope for potential negotiation partners, thereby enhancing the efficiency and security of subsequent negotiation processes.

3.3.1. Local Trust Evaluation

The local trust focuses on the trust relationship between individuals they interact with, either directly or indirectly. It infers the level of trust by analyzing transaction history data, such as transaction frequency, success rate, and behavioral patterns. Additionally, the model considers indirect trust information, including social network recommendations and friend evaluations, which provide supplementary trust support and serve as an important basis for individuals to form trust preferences during transactions.

In this study, local trust is divided into two components: direct trust and recommendation trust. Direct trust is measured by interaction frequency; more frequent transactions indicate a higher level of trust. Accordingly, the following local direct trust metric formula is proposed:

$$L{T}_{i,j}^d=\left\{\begin{array}{cc}{\displaystyle \frac{\ln (N_{i,j}+1)}{\ln (N_{i,\max }+1+\alpha )}}& e(i,j)\ne 0\\ 0& e(i,j)=0\end{array}\right.$$

(1)

where $L{T}_{i,j}^d$ denotes the local direct trust between user i and user j, $N_{i,j}$ represents the number of transactions between user i and user j within a specific date range $\left[t^s,t^e\right]$, $N_{i,\max }$ is the maximum number of transactions between user i and any other users within the same date range $\left[t^s,t^e\right]$, and $\alpha$ is a regulating parameter, a positive real number arbitrarily less than 1, to avoid division by zero errors.

In service transaction environments, constructing recommendation trust features often relies on the evaluations and feedback of other users to assist in decision-making. These evaluations reflect the degree of user approval and satisfaction with the transaction object. Therefore, evaluation similarity is considered an effective recommendation trust feature for measuring the trust relationship between users, especially when there is no direct interaction between them, but they have evaluated the same object. This approach quantifies the level of trust by comparing the consistency of user evaluations. The cosine similarity is calculated as follows:

$$L{T}_{i,j}^i={\displaystyle \frac{{\displaystyle \sum _{k=1}^n{{\displaystyle i}}_k{{\displaystyle j}}_k}}{\sqrt{{\displaystyle \sum _{k=1}^n{{\displaystyle i}}_k^2}}\sqrt{{\displaystyle \sum _{k=1}^n{{\displaystyle j}}_k^2}}}}$$

(2)

where $L{T}_{i,j}^i$ denotes the local indirect trust between user $i$ and user $j$, $i_k$ and $j_k$ represent each element in the evaluation vectors of nodes $i$ and $j$, respectively, and $n$ denotes the dimension of the evaluation vector.

3.3.2. Global Trust Evaluation

Global trust is built on a broad foundation, encompassing the relationships between all individuals in a trust network and a specific individual. It reflects the degree of trust formed through long-term experience and shared values. Typically, the calculation of local trust fully considers the information from direct or indirect interactions between individuals, providing a critical basis for constructing global trust. Building on this, the global trust degree is defined using the structure feature of the in-degree inspired by the trust network. Generally, an individual’s direct interaction with more individuals indicates higher centrality in the network, which usually implies greater global trust. The global trust feature is defined as follows:

$$G{T}_i={\displaystyle \frac{\ln (d_i^{in}+1)}{\ln (d_{\max }^{in}+1+\beta )}}$$

(3)

where $G{T}_i$ denotes the global trust of user $i$, $d_i^{in}$ represents the incidence of user i within a specific date range $\left[t^s,t^e\right]$, and $d_{\max }^{in}$ presents the maximum number of interactions of nodes in the network. $\beta$ is also a tuning parameter, a positive real number arbitrarily less than 1.

3.3.3. Relationship Prediction Based on Logistic Regression

Logistic regression is employed to construct predictive models that generate output probability values for classification. This is achieved by combining the trust-related features of known entities with a probability function. The aforementioned trust-related features can be used as input variables in a logistic regression model to predict the trustworthiness between individuals within the negotiation counterpart search space.

Consider nodes i and j as examples, assuming that there are two possible types of relationships between these nodes: (1) the relationship between nodes i and j is mutually trustworthy, and (2) the relationship between nodes i and j is not mutually trustworthy. This study uses a logistic regression model to predict the probability that the relationship between a node i and a node j is trustworthy, utilizing local trust features and global trust features as follows:

$$P\left(T\left(i,j\right)=1|\mathrm{x}\right)={\displaystyle \frac{1}{1+e^{-({\mathrm{w}}^T\mathrm{x}+b)}}}$$

(4)

where $P\left(T\left(i,j\right)=1|\mathrm{x}\right)$ denotes the probability that the relationship between nodes i and j is trustworthy; $\mathrm{x}$ denotes the feature vector, which consists of local trust features and global trust features; and $\mathrm{w}$ denotes the vector of feature weights estimated by the maximum likelihood method.

3.3.4. Negotiation Space Reduction

To ensure negotiation security, it is essential to focus on trusted negotiation objects, i.e., nodes that have a high degree of trust with the negotiation subject agent. Based on the relationship modeling results in Section 3.2, the trustworthiness of transaction nodes within the negotiation object search space can be predicted. This helps to eliminate untrustworthy nodes, thereby reducing the negotiation object search space and enhancing transaction security. Specifically, nodes predicted to be untrustworthy are removed from the original list of negotiators, retaining only those deemed trustworthy. This process narrows and refines the original search space $G$ into a new secure search space $G^{*}$, comprising only trusted negotiation objects.

Assume that node i is the negotiation subject agent, and node j represents any other negotiation participant. For each pair of nodes i and j, the probability score of their belonging to a trust relationship is calculated based on a logistic regression model. We then set a threshold θ and use the following expression to decide whether to include node j in node i’s new search space $G^{*}$:

$$G^{*}=\left\{j\in G\left|P\left(T\left(i,j\right)=1\right)>P_0\left(T\left(i,j\right)\right)\right.\right\}$$

(5)

where $G^{*}$ denotes the new search space for node i, and $P\left(T\left(i,j\right)=1\right)$ is the probability that a trusted relationship exists between nodes i and j. If this probability exceeds the threshold $P_0\left(T\left(i,j\right)\right)$, node j is considered suitable for inclusion in the new search space of node i.

3.4. Privacy-Enhanced Data Processing Protocol

The screening of trust relationships offers negotiation participants a relatively secure selection pool, which is essential for achieving an optimal match between negotiation counterparts. This mechanism not only significantly improves the likelihood of successful negotiations but also establishes a foundation for maximizing potential gains. However, in automated negotiation environments, participants often need to handle data containing sensitive information—such as bid ranges, preference parameters, and product attributes—during the sharing and computation processes. To address the growing concerns regarding user privacy protection, this paper proposes a privacy-enhanced data processing protocol.

In designing this protocol, we adopt a semi-honest (honest-but-curious) threat model, a widely used assumption in privacy-preserving computation and automated negotiation research. Under this threat model, negotiation participants and the platform are expected to execute the protocol correctly while potentially attempting to infer sensitive information from exchanged data. The proposed protocol aims to prevent the direct exposure of exact attribute values and preference boundaries by transforming sensitive information into probabilistic representations.

Specifically, the proposed protocol utilizes the Cumulative Distribution Function (CDF) to process sensitive data, converting deterministic numerical values into distributional forms, thereby minimizing the risks associated with direct data exposure. Specifically, in online platforms, product attributes are often represented as interval numbers, fuzzy numbers, or linguistic variables—representations that may implicitly contain crucial transactional details. By transforming these data representations into CDF-based distributions, the protocol effectively achieves data anonymization and enhances privacy protection. This approach not only ensures the security of sensitive information but also fosters negotiation transparency and improves computational efficiency, thereby establishing a secure, reliable, and efficient privacy protection framework for automated negotiation systems.

3.4.1. Interval-Type Data Under the Privacy-Enhanced Protocol

In automated negotiation, data such as commodity prices is often represented as intervals rather than precise values. These intervals reflect the participants’ reservation values and the proposal value with the maximum potential returns. Consequently, interval number types are well-suited to reflect these characteristics. Here, the buyer agent’s demand interval is defined as $B_{ik}=[B_{ik}^L,B_{ik}^U]$, and the seller agent’s supply interval is defined as $S_{jk}=[S_{jk}^L,S_{jk}^U]$. The interval number type typically represents the upper and lower bounds of the attributes for the participants, meaning the intervals $[B_{ik}^L,B_{ik}^U]$ and $[S_{jk}^L,S_{jk}^U]$ are relatively fixed.

In this context, $x$ denotes a specific proposal value within either the buyer’s demand interval or the seller’s supply interval. The actual value of x is usually drawn from a uniformly or normally distributed interval. Thus, $f_{B_{ik}}(x)$ represents the probability density of $x$ within the buyer’s demand interval, while $f_{S_{jk}}(x)$ denotes the probability density of $x$ within the seller’s supply interval. The cumulative distribution function can be expressed as follows:

$$F_{B_{ik}}(x)={\displaystyle {\int }_{B_{ik}^L}^x{f}_{B_{ik}}(y)dy},\hspace{1em}k\in K(B)$$

(6)

$$F_{S_{jk}}(x)={\displaystyle {\int }_{S_{jk}^L}^x{f}_{S_{jk}}(y)dy,}\hspace{1em}k\in K(S)$$

(7)

where $K(B)$ is the set of attributes for the buyer’s commodity and $K(S)$ is the set of attributes for the seller’s commodity.

3.4.2. Fuzzy-Type Data Under the Privacy-Enhanced Protocol

Users’ perceptions of commodity satisfaction, service quality, and other attributes are often not explicit values but are subjective and fuzzy. The fuzzy number type effectively describes this characteristic. Taking a buyer as an example, a certain buyer attribute $B_{ik}$ is generally expressed using triangular fuzzy numbers $(\alpha B_{ik},\beta B_{ik},\gamma B_{ik})$, where $\alpha B_{ik}$ represents the minimum possible value, $\beta B_{ik}$ represents the most likely value, and $\gamma B_{ik}$ represents the maximum possible value. Similarly, a seller’s attribute $S_{jk}$ can be represented using triangular fuzzy numbers $(\alpha S_{jk},\beta S_{jk},\gamma S_{jk})$.

Through introducing constants $\lambda B_{ik}={\displaystyle \frac{2}{(\lambda B_{ik}-\alpha B_{ik})}}$ and $\lambda S_{jk}={\displaystyle \frac{2}{(\lambda S_{jk}-\alpha S_{jk})}}$ into the membership functions of the buyer and the seller, these fuzzy numbers can be transformed into corresponding probability density functions [32]. Consequently, the cumulative distribution function for the buyer, $F_{B_{ik}}(x)$, can be expressed as follows:

$$\left\{\begin{array}{cc}\hfill 0\hfill & ,x<\alpha B_{ik}\hfill \\ \hfill {\displaystyle \frac{{(x-\alpha B_{ik})}^2}{(\beta B_{ik}-\alpha B_{ik})(\gamma B_{ik}-\alpha B_{ik})}}\hfill & ,\alpha B_{ik}\le x<\beta B_{ik}\hfill \\ \hfill 1-{\displaystyle \frac{{(\gamma B_{ik}-x)}^2}{(\gamma B_{ik}-\beta B_{ik})(\gamma B_{ik}-\alpha B_{ik})}}\hfill & ,\beta B_{ik}\le x<\gamma B_{ik}\hfill \\ \hfill 1\hfill & ,x\ge \gamma B_{ik}\hfill \end{array}\right., k\in K(B)$$

(8)

Similarly, the cumulative distribution function for the seller, $F_{S_k}(x)$, can be expressed as follows:

$$\left\{\begin{array}{cc}\hfill 0\hfill & ,x<\alpha S_{jk}\hfill \\ \hfill {\displaystyle \frac{{(x-\alpha S_{jk})}^2}{(\beta S_{jk}-\alpha S_{jk})(\gamma S_{jk}-\alpha S_{jk})}}\hfill & ,\alpha S_{jk}\le x<\beta S_{jk}\hfill \\ \hfill 1-{\displaystyle \frac{{(\gamma S_{jk}-x)}^2}{(\gamma S_{jk}-\beta S_{jk})(\gamma S_{jk}-\alpha S_{jk})}}\hfill & ,\beta S_{jk}\le x<\gamma S_{jk}\hfill \\ \hfill 1\hfill & ,x\ge \gamma S_{jk}\hfill \end{array}\right., k\in K(S)$$

(9)

3.4.3. Linguistic-Type Data Under the Privacy-Enhanced Protocol

For general products, information such as reviews is often expressed in natural language. Linguistic number types can effectively capture and clarify the semantics of such data. The set $U_k$ of linguistic variables is defined as follows:

$$U_k=\left\{{\widehat{u}}_{rk}\left|r=0,1,\dots ,q_k\right.\right\}$$

(10)

where ${\widehat{u}}_{rk}$ denotes the $r+1$ linguistic variable in the set.

According to the literature [33], these linguistic variables are transformed into corresponding triangular fuzzy numbers in the form of:

$${\widehat{u}}_{rk}=({\alpha }_k^r,{\beta }_k^r,{\gamma }_k^r)=((0,\max (r-1)),r/q_k,\min ((r+1)/q_k,1))$$

(11)

Based on the method of transforming triangular fuzzy numbers into random variables, the corresponding cumulative distribution functions $F_{B_k}(x)$ and $F_{S_{jk}}(x)$ can be determined in a similar manner.

3.5. Adaptive Matching Strategy

After the implementation of the privacy-enhanced data processing protocol, the attribute data of negotiation participants is transformed into random variables represented by cumulative distribution functions. This probabilistic representation not only conceals sensitive information but also enables the system to process diverse data types in a unified manner. Building upon this privacy-preserving data structure, this study introduces a reinforcement learning-based matching strategy that incorporates the Q-learning algorithm into the negotiation matching system. Through iterative learning, the system dynamically adjusts its matching decisions in response to evolving market conditions and user preference patterns. In this framework, the satisfaction measure between buyers and sellers is redefined and employed as the reward function within the Q-learning algorithm, providing an objective evaluation of matching outcomes and improving user satisfaction. The update function of the Q-learning algorithm is formulated as follows:

$$Q(S_t,A_t)\leftarrow Q(S_t,A_t)+\alpha [R_{t+1}+\gamma \max Q(S_{t+1},a)-Q(S_t,A_t)]$$

(12)

where α represents the learning rate, $S$ denotes the matching state, $A$ indicates the selection of a matching strategy based on the current state, $R$ is the immediate reward, and $\gamma$ signifies the discount factor.

To improve the reproducibility of the proposed approach, we further clarify the implementation details of the Q-learning algorithm. In this study, the reinforcement learning agent corresponds to the platform-level matching decision module, while the learning environment is defined by the current pool of feasible negotiation agents, the associated trust relationships, and the privacy-preserving attribute representations derived from cumulative distribution functions (CDFs).

State space ($S$). The state space is designed to characterize the current matching context. Specifically, each state is represented by a feature vector that integrates the trust levels between candidate buyer–seller pairs, the satisfaction information computed from the privacy-protected attribute representations, and the current matching status (e.g., whether an agent has already been matched). This state representation provides sufficient decision-relevant information for learning while avoiding the exposure of raw sensitive data.

Action space ($A$). The action space consists of the set of feasible matching decisions available in the current state. Each action corresponds to selecting a buyer–seller pair for matching under one-to-one matching constraints or choosing to defer matching at the current decision step. This design allows the system to flexibly adjust its decisions across different negotiation stages.

Exploration strategy. To balance exploration and exploitation during training, an ε-greedy exploration strategy is adopted. Specifically, with probability ε, the agent randomly selects a matching action to explore the strategy space, while with probability 1 − ε, it selects the action with the highest Q-value. Through iterative updates, the learning process gradually converges to a stable and effective matching policy.

Generally, commodity attributes are categorized into benefit and cost types, and the satisfaction formulas of buyers and sellers are also different under different attributes. Thus, we adopt the revenue evaluation function proposed in the literature [34] to establish our satisfaction function. For a benefit-type attribute, let $g_{ik}^B$ denote buyer $B_i$’s requirement for attribute $k$, and $\widehat{g_{ik}^B}$ denote the requirement for attribute $k$ to achieve a satisfaction level of 1. In this context, $g_{ik}^B\in [g_{ik\min }^B,+\infty )$, and the minimum value provided by the seller for this attribute is $g_{ik\min }^B$. Conversely, for a cost-type attribute, $g_{ik}^B\in [0,g_{ik\max }^B]$, the maximum value provided by the seller for this attribute is $g_{ik\max }^B$. Figure 3 illustrates the satisfaction levels for both benefit-type and cost-type attributes. Buyer $B_i$’s satisfaction with attribute $k$, denoted by $R_{ik}^B$, is calculated as follows:

$$R_{ik}^B=\left\{\begin{array}{cc}\hfill 0,\hfill & \hfill k<g_{ik\min }^B\hfill \\ \hfill ({\displaystyle \frac{k-\widehat{g_{ik}^B}}{\widehat{g_{ik}^B}-g_{ik\min }^B}}),\hfill & \hfill g_{ik\min }^B\le k<\widehat{g_{ik}^B}\hfill \\ \hfill 1,\hfill & \hfill k\ge \widehat{g_{ik}^B}\hfill \end{array}\right.\hspace{1em}k\in K(B)$$

(13)

$$R_{ik}^B=\left\{\begin{array}{cc}1,& \hfill k<\widehat{g_{ik}^B}\hfill \\ \hfill 1-{({\displaystyle \frac{k-\widehat{g_{ik}^B}}{g_{ik\max }^B-\widehat{g_{ik}^B}}})}^2,\hfill & \hfill \widehat{g_{ik}^B}\le k<g_{ik\max }^B\hfill \\ \hfill 0,\hfill & \hfill k\ge g_{ik\max }^B\hfill \end{array}\right.\hspace{1em}k\in K(S)$$

(14)

4. Experiments and Results

This section presents a comprehensive case study, supported by numerical experiments, to demonstrate the effectiveness and reliability of the proposed model. The case study examines the matching process of multi-attribute goods in an online social commerce environment, where the demand side specifies detailed requirements for particular commodities. Based on these requirements, the platform employs the proposed matching mechanism to identify suitable suppliers and facilitate subsequent automated negotiations and transactions. Throughout this process, multiple factors are jointly considered, while privacy protection and transaction security are strictly maintained.

4.1. Screening of Trusted Negotiation Relationship Networks

All experiments were conducted using Python (version 3.9), with the negotiation relationship network constructed and analyzed through the NetworkX library (version 2.8). The proposed models were developed and executed within the PyCharm (version 2022.2) integrated development environment (IDE). NetworkX was utilized for graph representation, topological analysis, and the extraction of trust-related features, thereby providing a stable and reproducible platform for the experiments.

4.1.1. Dataset Description

For the validation of the trusted negotiation relationship network, we selected the Sina Weibo dataset, which exemplifies the complex interpersonal interactions and trust relationships inherent in social business networks. Sina Weibo, one of China’s largest social media platforms, offers extensive user interaction data and a rich social network structure, making it ideal for studying automated negotiation and transaction matching systems. The dataset includes 63,641 users, encompassing basic user information and interactions. It conforms to the power-law and long-tail distribution characteristics of social networks, and its basic in-degree and out-degree information is shown in

Table 3. Network structure characteristics.

	Mean	Median	Maximum
Out-degree	22.28	20	131
In-degree	2.04	0	9948

.

4.1.2. Evaluation Metrics

To evaluate the validity of the trusted negotiation relationship network model proposed in this paper, we utilize the following metrics: accuracy, precision, recall, and F1 score. These metrics are defined as follows:

Accuracy: the ratio of correctly predicted samples to the total number of samples.

$$\mathrm{Accuacy}\hspace{0.33em}=\hspace{0.33em}{\displaystyle \frac{\mathrm{TP}\hspace{0.33em}+\hspace{0.33em}\mathrm{TN}}{\mathrm{TP}\hspace{0.33em}+\hspace{0.33em}\mathrm{TN}\hspace{0.33em}+\hspace{0.33em}\mathrm{FP}\hspace{0.33em}+\hspace{0.33em}\mathrm{FN}}}$$

(15)

Precision: the proportion of correctly predicted positive samples to all samples predicted as positive.

$$\mathrm{Precision}\hspace{0.33em}=\hspace{0.33em}{\displaystyle \frac{\mathrm{TP}}{\mathrm{TP}\hspace{0.33em}+\hspace{0.33em}\mathrm{FP}}}$$

(16)

Recall: The proportion of correctly predicted positive samples to all actual positive samples.

$$\mathrm{Recall}\hspace{0.33em}=\hspace{0.33em}{\displaystyle \frac{\mathrm{TP}}{\mathrm{TP}\hspace{0.33em}+\hspace{0.33em}\mathrm{FN}}}$$

(17)

F1 Score: The harmonic mean of precision and recall.

$$\mathrm{F}1\hspace{0.33em}=\hspace{0.33em}2\hspace{0.33em}\times \hspace{0.33em}{\displaystyle \frac{\mathrm{Precision}\times \hspace{0.33em}\mathrm{Recall}}{\mathrm{Precision}\hspace{0.33em}+\hspace{0.33em}\mathrm{Recall}}}$$

(18)

Here, TP (true positive), TN (true negative), FP (false positive), and FN (false negative) refer to correctly identified positive samples, correctly identified negative samples, incorrectly labeled positive samples, and missed positive samples, respectively, in the context of relationship prediction.

4.1.3. Experimental Results and Analysis

This section evaluates the effectiveness of the trusted negotiation network established for the negotiation subject. Figure 4 illustrates the construction process for the trusted negotiation network of the node number “1,006,718,042”: the red node represents the negotiation subject node, the yellow nodes are unreliable nodes that were eliminated, and the green nodes constitute the final credible relationship network.

We conducted 50 independent numerical experiments, each selecting a random set of 50 negotiation agents as target nodes to evaluate the classification performance of the trust prediction model across different negotiation relationship subnetworks. For each experiment, we first constructed the corresponding negotiation subnetwork centered on the selected node and performed model evaluation using 10-fold cross-validation. Specifically, the samples within the subnetwork were randomly divided into 10 mutually exclusive subsets of approximately equal size. In each iteration, one subset was designated as the test set, while the remaining 9 subsets were used to train the logistic regression model. This process was repeated 10 times, ensuring that each subset served as the test set exactly once.

During training, the model’s input features included direct trust, recommended trust, and global trust, all derived from the negotiation relationship network. Model parameters were estimated through maximum likelihood estimation. After training, the model was applied to the corresponding test subset to predict the reliability of the negotiation relationships between agents.

Performance metrics, including accuracy, precision, recall, and F1 score, were averaged across the 10-fold validation for each node group experiment. The final experimental results represent the average of the evaluation outcomes across 50 distinct target nodes, effectively minimizing sampling bias induced by network structural heterogeneity. Subsequently, we compared our method with the approach presented in the literature [35], which analyzes network topology using structural equilibrium theory. The comparison results are displayed in Figure 5.

The classification effect of node relationships in constructing trusted negotiation networks was presented in Figure 5 Figure 5a–d show the visualization of our model’s performance compared to the baseline method in terms of accuracy, precision, recall, and F1 score, respectively. The horizontal axis represents the 50 different sets of numerical experiment results, while the vertical axis indicates the percentage. The green line represents our method, the red line represents the baseline method, and the corresponding dashed line represents the average value for each method. The results indicate that our method achieved average scores of 0.8798 in accuracy, 0.9114 in precision, 0.9230 in recall, and 0.9171 in F1 score. These scores represent improvements of 4.52%, 3.27%, 3.15%, and 3.21%, respectively, over the baseline method. This demonstrates that our model provides better performance in establishing an effective network and constructing a credible negotiation relationship network.

Additionally, the green dashed line of our method shows greater stability, whereas the baseline method exhibits significant fluctuations for individual numerical experiments. To further verify the reliability of the results, we calculated the variance of the above experimental results of the two methods, as shown in

Table 4. Variance comparison of model performances.

	Accuracy	Precision	Recall	F1 Score
Baseline method	0.002123	0.001992	0.001752	0.001365
Our method	0.000501	0.000856	0.000876	0.000229

.

According to Table 4, the variance for our method is lower than that of the baseline method across all four indicators of model effectiveness. We further analyzed the cause of this difference and found that the baseline method overly depends on the current node’s network structure, resulting in weaker judgment of inter-node relationships when data is sparse. In contrast, our method incorporates both global and local trust, enhancing the accuracy of inter-node trust assessments. Through integrating local trust with global trust, our model demonstrates greater robustness.

In summary, our model not only surpasses the comparative method in classification effectiveness but also exhibits higher stability and robustness. By comprehensively assessing both global and local trust, our method demonstrates strong adaptability and accuracy in constructing a trusted negotiation relationship network, which can better improve the reliability and effectiveness of negotiation counterpart matching.

4.2. Application of the Privacy-Enhanced Protocol

In this scenario, we assume there are five negotiating parties ($B_1,B_2,\dots B_5$) seeking to purchase a chair and thirty suppliers ($S_1,S_2,\dots S_{30}$) available within the constructed trusted negotiation relationship network. The platform provides optimal matching options for each demand party, facilitating subsequent negotiation and transaction conclusion. The details of the demanders and suppliers are listed in

Table 5. Buyer’s requirements for different attributes of the commodity.

Buyers	k1	k2	k3
B1	[100, 165, 180]	L	(1, 6, 10)
B2	[125, 180, 260]	H	(2, 5, 10)
B3	[90, 136, 200]	M	(3, 6, 14)
B4	[110, 179, 240]	VH	(2, 8, 10)
B5	[120, 180, 330]	VH	(1, 4, 10)

and

Table 6. Seller’s supplies for different attributes of the commodity.

Sellers	k1	k2	k3	Sellers	k1	k2	k3
S1	[148, 200]	L	(2, 5, 10)	S16	[99, 160]	M	(2, 7, 10)
S2	[200, 360]	VH	(3, 7, 12)	S17	[128, 205]	M	(3, 7, 10)
S3	[130, 215]	M	(1, 5, 10)	S18	[110, 199]	M	(1, 5, 14)
S4	[145, 250]	H	(3, 7, 10)	S19	[100, 150]	L	(3, 10, 14)
S5	[70, 188]	M	(3, 4, 10)	S20	[89, 130]	L	(2, 7, 12)
S6	[140, 220]	M	(2, 4, 7)	S21	[179, 400]	VH	(1, 5, 7)
S7	[160, 250]	H	(3, 9, 14)	S22	[110, 199]	M	(2, 6, 10)
S8	[138, 330]	H	(1, 5, 9)	S23	[145, 280]	H	(1, 3, 7)
S9	[160, 310]	VH	(2, 4, 7)	S24	[125, 255]	M	(2, 6, 14)
S10	[90, 175]	L	(5, 9, 12)	S25	[210, 240]	H	(1, 4, 7)
S11	[95, 200]	M	(2, 5, 9)	S26	[173, 200]	H	(2, 5, 7)
S12	[80, 155]	L	(3, 7, 14)	S27	[163, 299]	VH	(1, 2, 7)
S13	[125, 199]	H	(1, 5, 10)	S28	[99, 120]	L	(3, 6, 10)
S14	[180, 280]	VH	(1, 3, 7)	S29	[133, 189]	M	(2, 7, 10)
S15	[60, 100]	VL	(5, 10, 14)	S30	[150, 240]	M	(3, 6, 14)

, which present the requirements and supply attributes for the commodity as specified by buyers and sellers. Specifically, $k_1$ denotes the price, including the lowest price, current price, and highest acceptable price proposed by the participant, represented as an interval number type; $k_2$ denotes quality, characterized by a fuzzy number type with its fuzzy set denoted as $U=\left\{u_1=VL:Very Low,u_2=L:Low,u_3=M:Mid,u_4=H:High,u_5=VH:Very High\right\}$; and $k_3$ denotes delivery time, a soft constraint where shorter times are preferable. For delivery time, Table 5 and Table 6 list the fastest delivery time, the average delivery time, and the longest delivery time, represented as linguistic number types with the unit in days. The data in Table 5 and Table 6 are obtained from the website of Alibaba (1688.com). The specific process of applying the privacy-enhanced automated negotiation protocol is detailed below.

Based on the assumption that the attributes of buyers and sellers follow a uniform distribution, the buyer and seller information in Table 5 and Table 6 are converted into cumulative distribution functions $F^B=F_{ik}^B(x)$ and $F^S=F_{jk}^S(x)$, respectively, using the formulas outlined in Section 3.4, where $i\in \{1,2,\dots ,5\}$ and $j\in \{1,2,\dots ,30\}$. Due to space constraints, we only present the results of the transformation for the demand side B1 and the supply side S1 as follows:

$$F_{11}^B(x)=\left\{\begin{array}{cc}\hfill 0,\hfill & \hfill x<100\hfill \\ \hfill {\displaystyle \frac{x-100}{80}},\hfill & \hfill 100\le x<180\hfill \\ \hfill 1,\hfill & \hfill x\ge 180\hfill \end{array}\right.$$

(19)

$$F_{12}^B(x)=\left\{\begin{array}{cc}\hfill 0,\hfill & \hfill x<0\hfill \\ \hfill {\displaystyle \frac{x^2}{0.08}},\hfill & \hfill 0\le x<0.2\hfill \\ \hfill {\displaystyle \frac{-x^2+0.8x-0.08}{0.08}},\hfill & \hfill 0.2\le x<0.4\hfill \\ \hfill 1,\hfill & \hfill x\ge 0.4\hfill \end{array}\right.$$

(20)

$$F_{13}^B(x)=\left\{\begin{array}{cc}\hfill 0,\hfill & \hfill x<1\hfill \\ \hfill {\displaystyle \frac{{(x-1)}^2}{21}},\hfill & \hfill 1\le x<4\hfill \\ \hfill {\displaystyle \frac{-x^2+16x-36}{28}},\hfill & \hfill 4\le x<8\hfill \\ \hfill 1,\hfill & \hfill x\ge 8\hfill \end{array}\right.$$

(21)

$$F_{11}^S(x)=\left\{\begin{array}{cc}\hfill 0,\hfill & \hfill x<148\hfill \\ \hfill {\displaystyle \frac{x-148}{52}},\hfill & \hfill 148\le x<200\hfill \\ \hfill 1,\hfill & \hfill x>200\hfill \end{array}\right.$$

(22)

$$F_{12}^S(x)=\left\{\begin{array}{cc}\hfill 0,\hfill & \hfill x<0\hfill \\ \hfill {\displaystyle \frac{x^2}{0.08}},\hfill & \hfill 0\le x<0.2\hfill \\ \hfill {\displaystyle \frac{-x^2+0.8x-0.08}{0.08}},\hfill & \hfill 0.2\le x<0.4\hfill \\ \hfill 1,\hfill & \hfill x\ge 0.4\hfill \end{array}\right.$$

(23)

$$F_{13}^S(x)=\left\{\begin{array}{cc}\hfill 0,\hfill & \hfill x<2\hfill \\ \hfill {\displaystyle \frac{{(x-2)}^2}{24}},\hfill & \hfill 2\le x<5\hfill \\ \hfill {\displaystyle \frac{-x^2+20x-60}{40}},\hfill & \hfill 5\le x<10\hfill \\ \hfill 1,\hfill & \hfill x\ge 10\hfill \end{array}\right.$$

(24)

4.3. Case Study

In this subsection, we process all the data of buyers and sellers using cumulative distribution functions to obtain the corresponding distribution functions. Subsequently, we apply the Q-learning reinforcement learning algorithm, as proposed in Section 3.5, for matching. The learning rate α is set to 0.5, and the discount factor γ is set to 0.9. Meanwhile, we compared our method with the improved Kuhn-Munkres algorithm [36], which is utilized to solve the multiple assignment problem and effectively addresses resource allocation tasks. The comparison of matching outcomes is presented in

Table 7. Comparison of matching outcomes and performance.

Methods	Matching Result	Satisfaction				Time
		k1	k2	k3	Sum
Baseline method	$(B_1\iff S_5,B_2\iff S_{13},B_3\iff S_{16},B_4\iff S_2,B_5\iff S_9)$	4.1884	5	4.1791	13.3675	1.0 s
Our method	$(B_1\iff S_{10},B_2\iff S_{13},B_3\iff S_{16},B_4\iff S_2,B_5\iff S_9)$	4.0581	5	4.7346	13.7927	1.2 s

.

In addition, we calculated the satisfaction measures for each group of buyers and sellers sequentially. Due to space constraints, we present only the calculation process for buyers B1–B5 and sellers S1–S5, as illustrated in Figure 6.

The optimal matching results, calculated across all combinations, are also summarized in Table 7. The joint satisfaction achieved by the method proposed in this study is 13.7927, surpassing the 13.3675 obtained by the baseline method described in the literature [36]. Although the baseline method achieves higher satisfaction in terms of attribute 1, its overall joint satisfaction is not optimal and reflects a local optimum. This limitation arises from the Kuhn-Munkres algorithm’s constraints: it has a limited search space, lacks global search capabilities, and tends to converge on local optima when handling multi-attribute data streams. In contrast, the method proposed in this paper integrates various types of data into distribution functions using privacy-preserving data processing protocols. This approach not only standardizes the data format but also broadens the algorithm’s search scope. Meanwhile, by leveraging the global search capabilities of the reinforcement learning algorithm, this method enhances joint satisfaction and ensures that the matching results achieve Pareto optimality. Furthermore, the computation time for the method proposed in this study is 1.2 s, compared to 1.0 s for the baseline method [36]. This slight difference indicates that while the proposed method improves result optimization, it maintains comparable efficiency.

4.4. Comparative Experiments and Analysis

To further verify the effectiveness of the proposed method, we designed two sets of comparative experiments following the framework of the case study. Specifically, 150 items of “chair” products were collected from the Alibaba platform using a web crawler, and their attributes were cleaned and organized to obtain the following attribute ranges: price $k_1\in [39,400]$, quality level $k_2\in [V_L,V_H]$, and delivery time $k_3\in [1,31]$. To simulate diverse buyer preferences, buyer attribute intervals were generated using a simple random distribution within the above ranges. The experimental setting consisted of 5 buyers and 30 sellers, and a total of 100 independent configurations of buyer–seller attribute profiles were randomly generated. In each experimental run, both the baseline methods and the proposed method were applied to perform matching, and the satisfaction achieved from the finalized transactions was recorded. Subsequently, the mean satisfaction and its variation across the 100 experiments were computed to evaluate the stability and superiority of the proposed method under different random environments.

Baseline method 1 [37] is an experience-based multi-dimensional trust allocation model, which updates trust levels based on historical matching records, with trust values gradually converging as experience accumulates. It should be noted that the method in [37] introduces a strata-based trust discretization mechanism at the trust comparison stage to mitigate the potential over-influence of minor numerical differences between continuous trust values on the decision-making process. For the sake of simplifying the experimental procedure, this strata mechanism was not explicitly incorporated in our implementation of the baseline method; instead, matching and decision-making were performed directly based on continuous trust values. Baseline method 2 [36] is the Kuhn-Munkres algorithm. The experimental results are shown in Figure 7.

Figure 7 illustrates the performance of the proposed method and the baseline methods in terms of matching satisfaction over 100 mutually independent repeated experiments. The horizontal axis represents the experiment index, while the vertical axis denotes the corresponding satisfaction value. The dashed lines indicate the average satisfaction levels of each method across all experiments. As shown in Figure 7, the proposed method consistently maintains a higher and relatively stable level of satisfaction across all experimental runs, with a mean satisfaction of 13.7063, which is noticeably higher than that of baseline method 1 (mean 13.5673) and baseline method 2 (mean 13.3083). These results indicate that the proposed method is able to consistently achieve superior matching performance under different random experimental configurations, and that the observed performance improvement is not dependent on any single experimental setting or specific parameter combination.

Although in a few experimental runs the satisfaction achieved by baseline method 1 exceeds that of the proposed method, the overall trend and statistical results indicate that the proposed method achieves higher satisfaction in the vast majority of experiments, with its overall mean level consistently outperforming both baseline methods. This demonstrates that the proposed method exhibits superior overall performance under long-term and repeated execution conditions. In contrast, baseline method 2 shows relatively smaller fluctuations in its satisfaction curve, indicating higher stability; however, its mean satisfaction is noticeably lower. This is mainly because baseline method 2 has limited capability to explore the matching space and cannot effectively adapt to changes in buyer and seller attributes, making it difficult to achieve high-quality matching results in complex and diverse matching environments.

The other set of comparative experiments primarily evaluates the computational performance of the proposed method. We measured the processing time required for matching as the number of sellers increased from 30 to 500, and the experimental results are shown in Figure 8.

As shown in Figure 8, as the data scale continuously increases, the proposed method consistently maintains a low and relatively stable processing time. In contrast, the processing times of the two baseline methods increase more noticeably as the problem scale grows. In particular, baseline method 2 exhibits the steepest growth trend in processing time under large-scale scenarios, while baseline method 1 shows a more moderate increase, but its overall runtime remains higher than that of the proposed method.

The above differences mainly arise from the distinct computational mechanisms adopted by the compared methods. Baseline method 2 has a time complexity of $O(n^3)$, which performs well in small-scale and static matching problems; however, as the problem scale and state space expand rapidly, its computational burden increases significantly, leading to reduced processing efficiency. Baseline method 1 only considers experience-based trust and does not model trust from the perspective of network structure, resulting in insufficient control over computational complexity in large-scale application scenarios.

It should be noted that baseline method 1 implicitly adopts an incremental trust update and caching strategy in its original formulation, which helps reduce the computational overhead caused by repeated calculations when the network structure remains relatively stable. In contrast, the experimental setting in this study focuses on evaluating the overall matching efficiency when new users join the system, during which the network structure may undergo dynamic changes, thereby increasing the need for recomputing trust relationships. Under this experimental scenario, an explicit trust memoization mechanism was not incorporated in our implementation of the baseline method.

In contrast, the proposed method has a time complexity of $O(n^2)$ and employs a Q-learning-based decision mechanism, which can effectively cope with the expanding state space through incremental exploration and policy learning. By avoiding exhaustive enumeration of the matching space, the proposed method is able to maintain high computational efficiency even as the problem scale increases.

In summary, the two sets of experiments demonstrate that in social commerce platform environments characterized by large-scale data and dynamic features, the model proposed in this paper exhibits significant advantages in terms of scalability and computational efficiency. The results indicate that while improving matching quality, the proposed method is still able to maintain favorable runtime performance, showing strong potential for practical application in continuously changing environments.

5. Conclusions

This study establishes a trusted and secure automated negotiation transaction matching system to address the challenge of selecting reliable negotiation counterparts for platform users in social commerce networks. The proposed system achieves accurate and personalized matching under multi-attribute constraints, providing a solid foundation for subsequent automated negotiations. From the platform perspective, the model emphasizes the dual objectives of trust assurance and privacy protection. By implementing a privacy-enhanced automated negotiation protocol, sensitive data are transformed into probabilistic representations, effectively safeguarding user information while maintaining computational efficiency. Moreover, the integration of reinforcement learning algorithms enables the system to dynamically adjust its matching strategies, achieving Pareto-optimal outcomes, avoiding local optima, and improving overall negotiation performance.

The findings further demonstrate that trust-based relationship modeling enhances the reliability and stability of the negotiation environment. By combining local and global trust indicators through logistic regression, the model accurately identifies trustworthy relationships and effectively narrows the search space for negotiation counterparts. This process strengthens network stability and improves the credibility of matching decisions. Meanwhile, the privacy-enhanced protocol significantly reduces the risk of exposing sensitive information by employing the cumulative distribution function to convert deterministic data into distributional forms. It also ensures that interval-type, fuzzy-type, and linguistic-type data can be securely processed, enhancing transparency and efficiency within the negotiation process. Additionally, the incorporation of Q-learning further refines the matching mechanism, enabling the system to adapt to dynamic market conditions and evolving user preferences. By redefining satisfaction as the reward function, the model promotes fairness, efficiency, and user satisfaction across negotiation outcomes.

Finally, a series of experimental results and case studies confirm the robustness, scalability, and adaptability of the proposed system. The results demonstrate that it consistently achieves efficient and accurate Pareto-optimal solutions, outperforming traditional approaches in handling large-scale and dynamic negotiation scenarios. Overall, this study verifies the effectiveness of integrating trust modeling, privacy-enhanced mechanisms, and reinforcement learning to realize secure, intelligent, and adaptive automated negotiation systems within social commerce environments.

6. Discussion

6.1. Theoretical Implications

In this study, we developed a transaction matching model that integrates complex network analysis with reinforcement learning-driven adaptive matching. The proposed model incorporates trust relationships and multi-attribute satisfaction into an automated negotiation framework, enhancing both the security and intelligence of the transaction process. By mining trust relationships and applying a privacy-enhanced automated negotiation protocol, sensitive user data are transformed into protected probabilistic forms, thereby strengthening privacy preservation and ensuring a secure data-sharing environment.

Furthermore, this study provides an in-depth examination of security risks and trust dynamics within automated negotiation systems. The proposed identification of multi-dimensional trust relationships improves the structural accuracy of the negotiation network and enhances the model’s adaptability to complex transaction environments. Experimental analyses demonstrate that, compared with traditional complex network-based matching methods in the literature [36], the proposed model achieves higher effectiveness and robustness, resulting in a more secure and reliable negotiation ecosystem and offering a novel perspective for studying trust-driven matching in social commerce platforms.

Additionally, by integrating the Q-learning algorithm into the decision-making process, the model dynamically optimizes the satisfaction of multi-attribute commodities to derive Pareto-optimal matching strategies. The experimental results confirm that the proposed approach avoids local optima and ensures fast convergence in large-scale data scenarios. This highlights the scalability, efficiency, and adaptability of the model in handling dynamic data streams and complex negotiation behaviors.

6.2. Practical Implications

The proposed model offers substantial practical value for the design and management of automated negotiation platforms in social commerce environments. By integrating a privacy-enhanced automated negotiation protocol, the system ensures secure information exchange throughout the transaction matching process. Sensitive data such as reservation prices and user preferences are effectively protected from leakage, enabling trusted interactions among participants. From an operational perspective, the framework provides a transparent and controllable management mechanism, allowing platform administrators to oversee the overall negotiation process, enhance regulatory efficiency, and support informed decision-making at the system level.

In practical electronic transaction environments, commodity data typically exhibit multi-attribute and heterogeneous characteristics, requiring robust handling of diverse data types. This study addresses this challenge by formalizing the processing of interval-type, fuzzy-type, and linguistic-type data through cumulative distribution function-based transformation. This approach enhances the flexibility of the matching mechanism, allowing dynamic adjustment of commodity attributes in response to market fluctuations. In practice, platform operators can selectively activate, modify, or remove specific attributes to reflect changing participant preferences, demonstrating the model’s high adaptability and generalizability.

Furthermore, in addition to its applications in social commerce, the proposed system can be extended to multi-party matching and allocation problems such as supply chain coordination, multi-agent resource distribution, and collaborative procurement. By combining trust evaluation, privacy protection, and adaptive matching, the model serves as a scalable decision-support tool for real-world negotiation and coordination across various industries.

6.3. Limitations and Future Research

This study proposes an automated negotiation transaction matching model that integrates security and intelligent decision-making to enhance the reliability and efficiency of social commerce platforms. Despite its promising results, several limitations remain, suggesting avenues for further research.

The current analysis of trust relationships focuses primarily on local and global perspectives, whereas real-world social interactions on online platforms are often more dynamic and multi-dimensional. Future research will incorporate additional behavioral and contextual attributes to enrich trust evaluation and improve the accuracy of relationship network construction. Moreover, the present model distinguishes only between trust and distrust states without accounting for varying degrees of trust intensity. Further exploration of fine-grained trust segmentation is planned to better understand how different trust levels influence negotiation outcomes and matching performance. In addition, the proposed approach does not aim to provide cryptographic-level privacy guarantees and may be vulnerable to inference attacks when adversaries possess strong prior knowledge or engage in long-term observation across multiple negotiation rounds. Future research will explore the incorporation of stronger privacy-preserving mechanisms, including cryptography-inspired or hybrid solutions, to mitigate inference risks under stronger adversarial assumptions while preserving the efficiency of the negotiation process.

In the comparative experiments, some baseline methods were not implemented with all mechanisms described in their original studies. For example, the trust stratification mechanism and the trust memoization update strategy proposed in [37] were not explicitly implemented in our experiments. These implementation differences may, to some extent, affect the decision stability and computational efficiency of the comparative methods. Future work will incorporate these mechanisms to conduct more rigorous replication experiments and more comprehensive performance evaluations.

Addressing these directions in future work will further enhance the adaptability, scalability, and practical applicability of automated negotiation transaction matching systems in complex and dynamic trading environments.