اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCompetition May Increase Social Happiness in Bipartite Matching Problem
96
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Bipartite matching problem is to study two disjoint groups of agents who need to be matched pairwise. It can be applied to many real-world scenarios and explain many social phenomena. In this article, we study the effect of competition on bipartite matching problem by introducing correlated wish list. The results show that proper competition can improve the overall happiness of society and also reduce the instability of the matching result of unequal sized bipartite matching.
قيم البحث
اقرأ أيضاً
Recently, we introduced a quantity, node weight, to describe the collaboration sharing or competition gain of the elements in the collaboration-competition networks, which can be well described by bipartite graphs. We find that the node weight distri
butions of all the networks follow the so-called shifted power law (SPL). The common distribution function may indicate that the evolution of the collaboration and competition in very different systems obeys a general rule. In order to set up a base of the further investigations on the universal system evolution dynamics, we now present the definition of the networks and their node weights, the node weight distributions, as well as the evolution durations of 15 real world collaboration-competition systems which are belonging to diverse fields.
Recently, our group quantitatively defined two quantities, competition ability and uniqueness (Chin. Phys. Lett. 26 (2009) 058901) for a kind of cooperation-competition bipartite networks, where producers produce some products and output them to a ma
rket to make competition. Factories, universities or restaurants can serve as the examples. In the letter we presented an analytical conclusion that the competition ability was linearly dependent on the uniqueness in the trivial cases, where both the input quality and competition gain obey normal distributions. The competition between Chinese regional universities was taken as examples. In this article we discuss the abnormal cases where competition gains show the distributions near to power laws. In addition, we extend the study onto all the cooperation-competition bipartite networks and therefore redefine the competition ability. The empirical investigation of the competition ability dependence on the uniqueness in 15 real world collaboration-competition systems is presented, 14 of which belong to the general nontrivial cases. We find that the dependence generally follows the so-called shifted power law (SPL), but very near to power laws. The empirically obtained heterogeneity indexes of the distributions of competition ability and uniqueness are also presented. These empirical investigations will be used as a supplementary of a future paper, which will present the comparison and further discussions about the competition ability dependence on the uniqueness in the abnormal collaboration-competition systems and the relationship between the dependence and the competition ability and uniqueness heterogeneity.
We estimate, from first-principles, the rate of inter-party avalanche involvements. The model suggests that the likelihood of inter-party involvements is quadratic in the density of parties -- twice as many parties quadruples the likelihood. The mode
l predicts that when the product of the party-density and the area of a days potential avalanches approaches one, inter-party avalanche involvements will become a substantial fraction of all avalanche involvements. As a corollary, the relative rate of inter-party involvements is expected to increase with avalanche size. We argue, with selected North American inter-party incidents from 2001-2019, that inter-party involvements are a timely concern. To spur conversation, we enumerate a variety of strategies that may mitigate inter-party hazard.
In human society, a lot of social phenomena can be concluded into a mathematical problem called the bipartite matching, one of the most well known model is the marriage problem proposed by Gale and Shapley. In this article, we try to find out some in
trinsic properties of the ground state of this model and thus gain more insights and ideas about the matching problem. We apply Kuhn-Munkres Algorithm to find out the numerical ground state solution of the system. The simulation result proves the previous theoretical analysis using replica method. In the result, we also find out the amount of blocking pairs which can be regarded as a representative of the system stability. Furthermore, we discover that the connectivity in the bipartite matching problem has a great impact on the stability of the ground state, and the system will become more unstable if there were more connections between men and women.
Individual happiness is a fundamental societal metric. Normally measured through self-report, happiness has often been indirectly characterized and overshadowed by more readily quantifiable economic indicators such as gross domestic product. Here, we
examine expressions made on the online, global microblog and social networking service Twitter, uncovering and explaining temporal variations in happiness and information levels over timescales ranging from hours to years. Our data set comprises over 46 billion words contained in nearly 4.6 billion expressions posted over a 33 month span by over 63 million unique users. In measuring happiness, we use a real-time, remote-sensing, non-invasive, text-based approach---a kind of hedonometer. In building our metric, made available with this paper, we conducted a survey to obtain happiness evaluations of over 10,000 individual words, representing a tenfold size improvement over similar existing word sets. Rather than being ad hoc, our word list is chosen solely by frequency of usage and we show how a highly robust metric can be constructed and defended.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
