相关论文: Kidney Exchange in Dynamic Sparse Heterogenous Poo…
We develop a model in which interactions between nodes of a dynamic network are counted by non homogeneous Poisson processes. In a block modelling perspective, nodes belong to hidden clusters (whose number is unknown) and the intensity…
Motivated by recent findings, we discuss the existence of a direct and robust mechanism providing discontinuous absorbing transitions in short range systems with single species, with no extra symmetries or conservation laws. We consider…
In the pooled data problem the goal is to efficiently reconstruct a binary signal from additive measurements. Given a signal $\sigma \in \{ 0,1 \}^n$, we can query multiple entries at once and get the total number of non-zero entries in the…
Microscopic strategy update rules play an important role in the evolutionary dynamics of cooperation among interacting agents on complex networks. Many previous related works only consider one \emph{fixed} rule, while in the real world,…
We investigate statistics of dynamical exchange events in coarse--grained models of supercooled liquids in spatial dimensions $d=1$, 2, and 3. The models, based upon the concept of dynamical facilitation, capture generic features of…
We study the feasibility of using electric vehicles in online, high-capacity ridepooling systems. Prior work has shown that online algorithms perform well for centrally-controlled, high-capacity ridepool systems. First, we propose a mixed…
We study an online hypergraph matching problem with delays, motivated by ridesharing applications. In this model, users enter a marketplace sequentially, and are willing to wait up to $d$ timesteps to be matched, after which they will leave…
In observational studies of treatment effects, matched samples are created so treated and control groups are similar in terms of observable covariates. Traditionally such matched samples consist of matched pairs. If a pair match fails to…
In microfluidic devices, inertia drives particles to focus on a finite number of inertial focusing streamlines. Particles on the same streamline interact to form one-dimensional microfluidic crystals (or "particle trains"). Here we develop…
The discerning behavior of living systems relies on accurate interactions selected from the lot of molecular collisions occurring in the cell. To ensure the reliability of interactions, binding partners are classically envisioned as finely…
The tremendous increase in the size and heterogeneity of supercomputers makes it very difficult to predict the performance of a scheduling algorithm. Therefore, dynamic solutions, where scheduling decisions are made at runtime have…
Many biological and artificial transport channels function without direct input of metabolic energy during a transport event and without structural rearrangements involving transitions from a 'closed' to an 'open' state. Nevertheless, such…
Pairwise comparison matrices are widely used in Multicriteria Decision Making. This article applies incomplete pairwise comparison matrices in the area of sport tournaments, namely proposing alternative rankings for the 2010 Chess Olympiad…
Here we introduce a model in which individuals differ in the rate at which they seek new interactions with others, making rational decisions modeled as general symmetric two-player games. Once a link between two individuals has formed, the…
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…
This paper introduces a new learning-based approach for approximately solving the Kidney-Exchange Problem (KEP), an NP-hard problem on graphs. The problem consists of, given a pool of kidney donors and patients waiting for kidney donations,…
A network of delay-coupled logistic maps exhibits two different synchronization regimes, depending on the distribution of the coupling delay times. When the delays are homogeneous throughout the network, the network synchronizes to a…
This paper combines the idea of a hierarchical distributed genetic algorithm with different inter-agent partnering strategies. Cascading clusters of sub-populations are built from bottom up, with higher-level sub-populations optimising…
In two-sided matching markets, the agents are partitioned into two sets. Each agent wishes to be matched to an agent in the other set and has a strict preference over these potential matches. A matching is stable if there are no blocking…
We consider classical hard-core particles moving on two parallel chains in the same direction. An interaction between the channels is included via the hopping rates. For a ring, the stationary state has a product form. For the case of…