We study decentralized task coordination. Tasks are of varying complexity and agents asymmetric: capable completing high-level tasks may also take on originally contracted by lower-level agents, facilitating system-wide cost reductions. suggest a family two-stage mechanisms, in which first announce preferred individual workloads then bargain over the induced joint savings. The second-stage nego...

This paper develops a dynamic general equilibrium matching model with many types of long-lived workers, many types of jobs and stochastic transitions between many possible aggregate productivity states. The supply of new jobs is determined by free entry, matching is directed, wages are determined by auction and workers can continue to search on-the-job for better employment opportunities. We sh...

As decentralized computing scenarios get ever more popular, unstructured topologies are natural candidates to consider running mix networks upon. We consider mix network topologies where mixes are placed on the nodes of an unstructured network, such as social networks and scale-free random networks. We explore the efficiency and traffic analysis resistance properties of mix networks based on un...

In recent autonomous decentralized systems, every node might not execute the same algorithm because it might have i ts own local policy and follow that policy rather than the common principle. In this paper, we model these systems as a multi-policy distributed system. W e introduce a new type of failure, a truant failure, on multi-policy distributed systems, which i s considered to be the simpl...

A DAO is a blockchain-based system that enables people to coordinate and govern themselves mediated by set of self-executing rules deployed on public blockchain, whose governance decentralised (i.e., independent from central control).