Two-Sided Stable Matching Decision-Making Method Considering Matching Intention under a Hesitant Fuzzy Environment

In this paper,a stable two-sided matching(TSM)method considering the matching intention of agents under a hesitant fuzzy environment is proposed.The method uses a hesitant fuzzy element(HFE)as its basis.First,the HFE preference matrix is transformed into the normalized HFE preference matrix.On this basis,the distance and the projection of the normalized HFEs on positive and negative ideal solutions are calculated.Then,the normalized HFEs are transformed into agent satisfactions.Considering the stable matching constraints,a multiobjective programming model with the objective of maximizing the satisfactions of two-sided agents is constructed.Based on the agent satisfaction matrix,the matching intention matrix of two-sided agents is built.According to the agent satisfaction matrix and matching intention matrix,the comprehensive satisfaction matrix is set up.Furthermore,the multiobjective programming model based on satisfactions is transformed into a multiobjective programming model based on comprehensive satisfactions.Using the G-S algorithm,the multiobjective programming model based on comprehensive satisfactions is solved,and then the best TSM scheme is obtained.Finally,a terminal distribution example is used to verify the feasibility and effectiveness of the proposed method.

Two-Sided Matching Decision Making with Multi-Attribute Probabilistic Hesitant Fuzzy Sets

In previous research on two-sided matching(TSM)decision,agents’preferences were often given in the form of exact values of ordinal numbers and linguistic phrase term sets.Nowdays,the matching agent cannot perform the exact evaluation in the TSM situations due to the great fuzziness of human thought and the complexity of reality.Probability hesitant fuzzy sets,however,have grown in popularity due to their advantages in communicating complex information.Therefore,this paper develops a TSM decision-making approach with multi-attribute probability hesitant fuzzy sets and unknown attribute weight information.The agent attribute weight vector should be obtained by using the maximum deviation method and Hamming distance.The probabilistic hesitancy fuzzy information matrix of each agent is then arranged to determine the comprehensive evaluation of two matching agent sets.The agent satisfaction degree is calculated using the technique for order preference by similarity to ideal solution(TOPSIS).Additionally,the multi-object programming technique is used to establish a TSM method with the objective of maximizing the agent satisfaction of two-sided agents,and the matching schemes are then established by solving the built model.The study concludes by providing a real-world supply-demand scenario to illustrate the effectiveness of the proposed method.The proposed method is more flexible than prior research since it expresses evaluation information using probability hesitating fuzzy sets and can be used in scenarios when attribute weight information is unclear.

Measuring Musical Rhythm Similarity: Further Experiments with the Many-to-Many Minimum-Weight Matching Distance

Musical rhythms are represented as sequences of symbols. The sequences may be composed of binary symbols denoting either silent or monophonic sounded pulses, or ternary symbols denoting silent pulses and two types of sounded pulses made up of low-pitched (dum) and high-pitched (tak) sounds. Experiments are described that compare the effectiveness of the many-to-many minimum-weight matching between two sequences to serve as a measure of similarity that correlates well with human judgements of rhythm similarity. This measure is also compared to the often used edit distance and to the one-to-one minimum-weight matching. New results are reported from experiments performed with three widely different datasets of real- world and artificially generated musical rhythms (including Afro-Cuban rhythms), and compared with results previously reported with a dataset of Middle Eastern dum-tak rhythms.

Resource Allocation Strategy Based on Matching Game

With the development of satellite communication technology,the traditional resource allocation strategies are difficult to meet the requirements of resource utilization efficiency.In order to solve the optimization problem of resource allocation for multi-layer satellite networks in multi-user scenarios,we propose a new resource allocation scheme based on the many-to-many matching game.This scheme is different from the traditional resource allocation strategies that just consider a trade-off between the new call blocking probability and the handover call failure probability.Based on different preference lists among different layers of medium earth orbit(MEO) satellites,low earth orbit(LEO) satellites,base stations and users,we propose the corresponding algorithms from the perspective of quality of experience(QoE).The simulation results show that the many-to-many matching game scheme can effectively improve both the resource utilization efficiency and QoE,compared with the one-to-one and many-to-one matching algorithms.

The Aviation Technology Two-Sided Matching with the Expected Time Based on the Probabilistic Linguistic Preference Relations

The two-sided matching has been widely applied to the decision-making problems in the field of management.With the limited working experience,the two-sided agents usually cannot provide the preference order directly for the opposite agent,but rather to provide the preference relations in the form of linguistic information.The preference relations based on probabilistic linguistic term sets(PLTSs)not only allowagents to provide the evaluation with multiple linguistic terms,but also present the different preference degrees for linguistic terms.Considering the diversities of the agents,they may provide their preference relations in the form of the probabilistic linguistic preference relation(PLPR)or the probabilistic linguistic multiplicative preference relation(PLMPR).For two-sided matching with the expected time,we first provide the concept of the time satisfaction degree(TSD).Then,we transform the preference relations in different forms into the unified preference relations(u-PRs).The consistency index to measure the consistency of u-PRs is introduced.Besides,the acceptable consistent u-PRs are constructed,and an algorithm is proposed to modify the unacceptable consistent u-PRs.Furthermore,we present the whole two-sided matching decisionmaking process with the acceptable consistent u-PRs.Finally,a case about aviation technology suppliers and demanders matching is presented to exhibit the rationality and practicality of the proposed method.Some analyses and discussions are provided to further demonstrate the feasibility and effectiveness of the proposed method.

A Caching Strategy Based on Many-to-Many Matching Game in D2D Networks

Wireless edge caching has been proposed to reduce data traffic congestion in backhaul links, and it is being envisioned as one of the key components of next-generation wireless networks. This paper focuses on the influences of different caching strategies in Device-to-Device(D2D) networks. We model the D2D User Equipments(DUEs) as the Gauss determinantal point process considering the repulsion between DUEs, as well as the caching replacement process as a many-to-many matching game. By analyzing existing caching placement strategies, a new caching strategy is proposed, which represents the preference list of DUEs as the ratio of content popularity to cached probability. There are two distinct features in the proposed caching strategy.(1) It can cache other contents besides high popularity contents.(2) It can improve the cache hit ratio and reduce the latency compared with three caching placement strategies: Least Recently Used(LRU), Equal Probability Random Cache(EPRC), and the Most Popular Content Cache(MPC). Meanwhile, we analyze the effect of caching on the system performance in terms of different content popularity factors and cache capacity. Simulation results show that our proposed caching strategy is superior to the three other comparison strategies and can significantly improve the cache hit ratio and reduce the latency.

Binary Operations for the Lattice Structure in a Many-to-Many MatchingModel

The lattice structure of the set of stable matchings in many-to-many matching model is well known in literature.If preferences of the agents are substitutable,this result can be obtained by fixed-point methods,for that purpose an algorithm for finding a fixed-point matching is defined.Since the fixed-point set equals the set of stable matchings,the latter has a lattice structure too.In this paper,we consider a many-to-many matching market where the preferences of firms satisfy substitutability and the law of aggregate demand,and workers have responsive preferences.In this many-to-many matching market,we explicitly compute for any pair of stable matchings the least upper bound and the greatest lower bound,without using fixed-point methods.

Trust Access Authentication in Vehicular Network Based on Blockchain

Data sharing and privacy securing present extensive opportunities and challenges in vehicular network.This paper introducestrust access authentication scheme’as a mechanism to achieve real-time monitoring and promote collaborative sharing for vehicles.Blockchain,which can provide secure authentication and protected privacy,is a crucial technology.However,traditional cloud computing performs poorly in supplying low-latency and fast-response services for moving vehicles.In this situation,edge computing enabled Blockchain network appeals to be a promising method,where moving vehicles can access storage or computing resource and get authenticated from Blockchain edge nodes directly.In this paper,a hierarchical architecture is proposed consist of vehicular network layer,Blockchain edge layer and Blockchain network layer.Through a authentication mechanism adopting digital signature algorithm,it achieves trusted authentication and ensures valid verification.Moreover,a caching scheme based on many-to-many matching is proposed to minimize average delivery delay of vehicles.Simulation results prove that the proposed caching scheme has a better performance than existing schemes based on central-ized model or edge caching strategy in terms of hit ratio and average delay.

Volunteer rescue dispatch during the Coronavirus Disease 2019 epidemic:Using the recruitment of volunteers for pneumonia epidemic prevention and control in Chun’an County as an example

To solve the problem of volunteer dispatch during the Coronavirus Disease 2019(COVID-19)epidemic,a many-to-many two-sided matching volunteer dispatch method based on an improved predator-search algorithm is pro-posed.First,different evaluation index sets for volunteers and rescue tasks were developed,and weightings were determined using the analytic hierarchy process.Subsequently,the actual and expected values of the different indicators of the two parties were determined,and the triangular fuzzy number was used to calculate the satis-faction of the two parties.Based on this number,we used a linear weighting method to calculate the combined satisfaction and build a many-to-many two-sided matching model according to the demands of both parties.Sub-sequently,an improved predator-search algorithm was used to solve the model.Finally,taking the recruitment of volunteers for pneumonia epidemic prevention and control in Chun’an County as an example,the method proposed in our study was verified.A comparison and analysis of the results further demonstrated the feasibility and advantages of this method.