相关论文: On Using Matching Theory to Understand P2P Network…

Understanding the evolution of cooperation in structured populations represented by networks is a problem of long research interest, and a most fundamental and widespread property of social networks related to cooperation phenomena is that…

Most research on predicting community evolution focuses on changes in the states of communities. Instead, we focus on individual nodes and define the novel problem of predicting whether a specific node stays in the same cluster, moves to…

The stable marriage and stable roommates problems have been extensively studied due to their high applicability in various real-world scenarios. However, it might happen that no stable solution exists, or stable solutions do not meet…

Collaboration networks are studied as an example of growing bipartite networks. These have been previously observed to have structure such as positive correlations between nearest-neighbour degrees. However, a detailed understanding of the…

With the emerging of new networks, such as wireless sensor networks, vehicle networks, P2P networks, cloud computing, mobile Internet, or social networks, the network dynamics and complexity expands from system design, hardware, software,…

The need to build a link between the structure of a complex network and the dynamical properties of the corresponding complex system (comprised of multiple low dimensional systems) has recently become apparent. Several attempts to tackle…

In many economic contexts, agents from a same population team up to better exploit their human capital. In such contexts (often called "roommate matching problems"), stable matchings may fail to exist even when utility is transferable. We…

To guarantee all agents are matched in general, the classic Deferred Acceptance algorithm needs complete preference lists. In practice, preference lists are short, yet stable matching still works well. This raises two questions: $\bullet$…

The field of complex networks studies a wide variety of interacting systems by representing them as networks. To understand their properties and mutual relations, the randomisation of network connections is a commonly used tool. However,…

Motivated by recent applications of sequential decision making in matching markets, in this paper we attempt at formulating and abstracting market designs for P2P lending. We describe a paradigm to set the stage for how peer to peer…

We present an analysis of the topologies of a class of networks which are optimal in terms of the requirements of having as short a route as possible between any two nodes while yet keeping the congestion in the network as low as possible.…

Research regarding the stable marriage and roommate problem has a long and distinguished history in mathematics, computer science and economics. Stability in this context is predominantly core stability or one of its variants in which each…

Traditional end-to-end congestion control mechanisms assume data transferring happens between each pair user. In contrast, in a P2P network, many peers may locally keep a copy of a specific data object. If the path between a pair of peers…

Spectrum sharing is one of the promising solutions to meet the spectrum demand in 5G networks that results from the emerging services like machine to machine and vehicle to infrastructure communication. The idea is to allow a set of…

This paper studies matching markets where institutions are matched with possibly more than one individual. The matching market contains some couples who view the pair of jobs as complements. First, we show by means of an example that a…

We consider the problem of embedding a dynamic network, to obtain time-evolving vector representations of each node, which can then be used to describe changes in behaviour of individual nodes, communities, or the entire graph. Given this…

Based on measurements of the Internet topology data, we found out that there are two mechanisms which are necessary for the correct modeling of the Internet topology at the Autonomous Systems (AS) level: the Interactive Growth of new nodes…

The stable matching problem sets the economic foundation of several practical applications ranging from school choice and medical residency to ridesharing and refugee placement. It is concerned with finding a matching between two disjoint…

We introduce and study a general model of social network formation and evolution based on the concept of preferential link formation between similar nodes and increased similarity between connected nodes. The model is studied numerically…

In the fundamental Stable Marriage and Stable Roommates problems, there are inherent trade-offs between the size and stability of solutions. While in the former problem, a stable matching always exists and can be found efficiently using the…