اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدBarter Exchange via Friends Friends
103
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Barter exchange studies the setting where each agent owns a good, and they can exchange with each other if that gives them more preferred goods. This exchange will give better outcomes if there are more participants. The challenge here is how to get more participants and our goal is to incentivize the existing participants to invite new participants. However, new participants might be competitors for the existing participants. Therefore, we design an exchange mechanism based on the classical Top Trading Cycle (TTC) algorithm to solve their conflicts. Our mechanism is truthful in terms of revealing their preferences and also guarantees that inviting all their neighbors is a dominant strategy for all participants. The mechanism can be applied in settings where more participants are preferred but no extra budget to reach new participants.
قيم البحث
اقرأ أيضاً
We examine the problem of assigning plots of land to prospective buyers who prefer living next to their friends. They care not only about the plot they receive, but also about their neighbors. This externality results in a highly non-trivial problem
structure, as both friendship and land value play a role in determining agent behavior. We examine mechanisms that guarantee truthful reporting of both land values and friendships. We propose variants of random serial dictatorship (RSD) that can offer both truthfulness and welfare guarantees. Interestingly, our social welfare guarantees are parameterized by the value of friendship: if these values are low, enforcing truthful behavior results in poor welfare guarantees and imposes significant constraints on agents choices; if they are high, we achieve good approximation to the optimal social welfare.
We present a catalogue of galaxy groups and clusters selected using a friends-of-friends algorithm with a dynamic linking length from the 2dF-SDSS and QSO (2SLAQ) luminous red galaxy survey. The linking parameters for the code are chosen through an a
nalysis of simulated 2SLAQ haloes. The resulting catalogue includes 313 clusters containing 1,152 galaxies. The galaxy groups and clusters have an average velocity dispersion of sigma_v = 467.97 km/s and an average size of R_clt = 0.78 Mpc/h. Galaxies from regions of one square degree and centred on the galaxy clusters were downloaded from the Sloan Digital Sky Survey Data Release 6 (SDSS DR6). Investigating the photometric redshifts and cluster red-sequence of these galaxies shows that the galaxy clusters detected with the FoF algorithm are reliable out to z~0.6. We estimate masses for the clusters using their velocity dispersions. These mass estimates are shown to be consistent with 2SLAQ mock halo masses. Further analysis of the simulation haloes shows that clipping out low richness groups with large radii improves the purity of catalogue from 52% to 88%, while retaining a completeness of 94%. Finally, we test the two-point correlation function of our cluster catalogue. We find a best-fitting power law model with parameters r0 = 24pm4 Mpc/h and gamma = -2.1pm 0.2, which are in agreement with other low redshift cluster samples and consistent with a {Lambda}CDM universe.
Milgram empirically showed that people knowing only connections to their friends could locate any person in the U.S. in a few steps. Later research showed that social network topology enables a node aware of its full routing to find an arbitrary targ
et in even fewer steps. Yet, the success of people in forwarding efficiently knowing only personal connections is still not fully explained. To study this problem, we emulate it on a real location-based social network, Gowalla. It provides explicit information about friends and temporal locations of each user useful for studies of human mobility. Here, we use it to conduct a massive computational experiment to establish new necessary and sufficient conditions for achieving social search efficiency. The results demonstrate that only the distribution of friendship edges and the partial knowledge of friends of friends are essential and sufficient for the efficiency of social search. Surprisingly, the efficiency of the search using the original distribution of friendship edges is not dependent on how the nodes are distributed into space. Moreover, the effect of using a limited knowledge that each node possesses about friends of its friends is strongly nonlinear. We show that gains of such use grow statistically significantly only when this knowledge is limited to a small fraction of friends of friends.
A natural and established way to restrict the constraint satisfaction problem is to fix the relations that can be used to pose constraints; such a family of relations is called a constraint language. In this article, we study arc consistency, a heavi
ly investigated inference method, and three extensions thereof from the perspective of constraint languages. We conduct a comparison of the studied methods on the basis of which constraint languages they solve, and we present new polynomial-time tractability results for singleton arc consistency, the most powerful method studied.
In this work we analyze traces of mobility and co-location among a group of nearly 1000 closely interacting individuals. We attempt to reconstruct the Facebook friendship graph, Facebook interaction network, as well as call and SMS networks from long
itudinal records of person-to-person offline proximity. We find subtle, yet observable behavioral differences between pairs of people who communicate using each of the different channels and we show that the signal of friendship is strong enough to stand out from the noise of random and schedule-driven offline interactions between familiar strangers. Our study also provides an overview of methods for link inference based on offline behavior and proposes new features to improve the performance of the prediction task.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
