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

We proposed an evolving network model constituted by the same nodes but different edges. The competition between nodes and different links were introduced. Scale free properties have been found in this model by continuum theory. Different…

Nestedness is a common property of communication, finance, trade, and ecological networks. In networks with high levels of nestedness, the link positions of low-degree nodes (those with few links) form nested subsets of the link positions…

Interactions between people are the basis on which the structure of our society arises as a complex system and, at the same time, are the starting point of any physical description of it. In the last few years, much theoretical research has…

Results from the communication complexity literature have demonstrated that stable matching requires communication: one cannot find or verify a stable match without having access to essentially all of the ordinal preference information held…

This paper explores a novel extension of dynamic matching theory by analyzing a three-way matching problem involving agents from three distinct populations, each with two possible types. Unlike traditional static or two-way dynamic models,…

Social storage systems are becoming increasingly popular compared to the existing data backup systems like local, centralized and P2P systems. An endogenously built symmetric social storage model and its aspects like the utility of each…

Many two-sided matching markets, from labor markets to school choice programs, use a clearinghouse based on the applicant-proposing deferred acceptance algorithm, which is well known to be strategy-proof for the applicants. Nonetheless, a…

Complex networks have emerged as a simple yet powerful framework to represent and analyze a wide range of complex systems. The problem of ranking the nodes and the edges in complex networks is critical for a broad range of real-world…

Large-scale, two-sided matching platforms must find market outcomes that align with user preferences while simultaneously learning these preferences from data. Classical notions of stability (Gale and Shapley, 1962; Shapley and Shubik,…

Community detection and hierarchy extraction are usually thought of as separate inference tasks on networks. Considering only one of the two when studying real-world data can be an oversimplification. In this work, we present a generative…

We explore the possibility of designing matching mechanisms that can accommodate non-standard choice behavior. We pin down the necessary and sufficient conditions on participants' choice behavior for the existence of stable and incentive…

It is often observed that agents tend to imitate the behavior of their neighbors in a social network. This imitating behavior might lead to the strategic decision of adopting a public behavior that differs from what the agent believes is…

In this paper we investigate networks whose evolution is governed by the interaction of a random assembly process and an optimization process. In the first process, new nodes are added one at a time and form connections to randomly selected…

We study stable matching problems where agents have multilayer preferences: There are $\ell$ layers each consisting of one preference relation for each agent. Recently, Chen et al. [EC '18] studied such problems with strict preferences,…

We study the evolution of networks when the creation and decay of links are based on the position of nodes in the network measured by their centrality. We show that the same network dynamics arises under various centrality measures, and…

We study stable matchings that are robust to preference changes in the two-sided stable matching setting of Gale and Shapley[GS62]. Given two instances $A$ and $B$ on the same set of agents, a matching is said to be robust if it is stable…

The problem of link prediction has attracted considerable recent attention from various domains such as sociology, anthropology, information science, and computer sciences. A link prediction algorithm is proposed based on link similarity…

We examine a weighted-network multi-agent model with preferential selection such that agents choose partners with the probability $p(w)$, where $w$ is the number of their past selections. When $p(w)$ increases sublinearly with the number of…

In recent years, there has been growing interest in the study of coevolutionary games on networks. Despite much progress, little attention has been paid to spatially embedded networks, where the underlying geographic distance, rather than…

Many social and biological systems are characterized by enduring hierarchies, including those organized around prestige in academia, dominance in animal groups, and desirability in online dating. Despite their ubiquity, the general…