We study the design of a decentralized two-sided matching market in which agents’ search is guided by platform. There are finitely many agent types, each with (potentially random) preferences drawn from known type-specific distributions. Equipped knowledge these distributions, platform guides process determining meeting rate between pair types two sides. Focusing on symmetric pairwise continuum...

IOTA is a typical blockchain designed for IoT applications. The Markov chain monte carlo algorithm (MCMC) used in may lead to large number of unverified blocks, which increases transaction delay certain extent. We propose Stable matching (SMA) based on theory stimulate nodes verify thereby reducing the blocks and consensus delay. structure our uses Directed acyc1ic graph (DAG) improve processin...

We study a class of finite state machines, called w-matching machines, which yield to simulate the behavior of pattern matching algorithms while searching for a pattern w. They can be used to compute the asymptotic speed, i.e. the limit of the expected ratio of the number of text accesses to the length of the text, of algorithms while parsing an iid text to find the pattern w. Defining the orde...

We study a dynamic matching environment where individuals arrive sequentially. There is a tradeoff between waiting for a thicker market, allowing for higher quality matches, and minimizing agents’waiting costs. The optimal mechanism cumulates a stock of incongruent pairs up to a threshold and matches all others in an assortative fashion instantaneously. In decentralized settings, a similar prot...

Background matching is the most familiar and widespread camouflage strategy: avoiding detection by having a similar colour and pattern to the background. Optimizing background matching is straightforward in a homogeneous environment, or when the habitat has very distinct sub-types and there is divergent selection leading to polymorphism. However, most backgrounds have continuous variation in co...