Search

An optimal randomized strategy for design of balanced, normalized mass transport plans is developed. It replaces -- but specializes to -- the deterministic, regularized optimal transport (OT) strategy, which yields only a certainty-equivalent plan. The incompletely specified -- and therefore uncertain -- transport plan is acknowledged to be a random process. Therefore, hierarchical fully probabilistic design (HFPD) is adopted, yielding an optimal hyperprior supported on the set of possible transport plans, and consistent with prior mean constraints on the marginals of the uncertain plan. This Bayesian resetting of the design problem for transport plans -- which we call HFPD-OT -- confers new opportunities. These include (i) a strategy for the generation of a random sample of joint transport plans; (ii) randomized marginal contracts for individual source-target pairs; and (iii) consistent measures of uncertainty in the plan and its contracts. An application in algorithmic fairness is outlined, where HFPD-OT enables the recruitment of a more diverse subset of contracts -- than is possible in classical OT -- into the delivery of an expected plan. Also, it permits fairness proxies to be endowed with uncertainty quantifiers., Comment: 27 pages, 26 figures

As consumer flexibility becomes expected, it is important that the market mechanisms which attain that flexibility are perceived as fair. We set out fairness issues in energy markets today, and propose a market design to address them. Consumption is categorised as either essential or flexible with different prices and reliability levels for each. Prices are generated by an Automatic Market Maker (AMM) based on instantaneous scarcity and resource is allocated using a novel Fair Play algorithm. We empirically show the performance of the system over 1 year for 101 UK households and benchmark its performance against more classical approaches., Comment: Under review for inclusion in Special Issue of Applied Energy on `(R)Evolution of Electricity Markets: Designing Smart Electricity Markets for a Decarbonized World'

Controlled charging of electric vehicles, EVs, is a major potential source of flexibility to facilitate the integration of variable renewable energy and reduce the need for stationary energy storage. To offer system services from EVs, fleet aggregators must address the uncertainty of individual driving and charging behaviour. This paper introduces a means of forecasting the service volume available from EVs by considering several EV batteries as one conceptual battery with aggregate power and energy boundaries. This avoids the impossible task of predicting individual driving behaviour by taking advantage of the law of large numbers. The forecastability of the boundaries is demonstrated in a multiple linear regression model which achieves an $R^2$ of 0.7 for a fleet of 1,000 EVs. A two-stage stochastic model predictive control algorithm is used to schedule reserve services on a day-ahead basis addressing risk trade-offs by including Conditional Value-at-Risk in the objective function. A case study with 1.2 million domestic EV charge records from Great Britain shows that increasing fleet size improves prediction accuracy, thereby increasing reserve revenues and decreasing effective charging costs. For fleet sizes of 400 or above, charging cost reductions plateau at 60\%, with an average of 1.8kW of reserve provided per vehicle.

The goal of this paper is to introduce a new theoretical framework for Optimal Transport (OT), using the terminology and techniques of Fully Probabilistic Design (FPD). Optimal Transport is the canonical method for comparing probability measures and has been successfully applied in a wide range of areas (computer vision Rubner et al. [2004], computer graphics Solomon et al. [2015], natural language processing Kusner et al. [2015], etc.). However, we argue that the current OT framework suffers from two shortcomings: first, it is hard to induce generic constraints and probabilistic knowledge in the OT problem; second, the current formalism does not address the question of uncertainty in the marginals, lacking therefore the mechanisms to design robust solutions. By viewing the OT problem as the optimal design of a probability density function with marginal constraints, we prove that OT is an instance of the more generic FPD framework. In this new setting, we can furnish the OT framework with the necessary mechanisms for processing probabilistic constraints and deriving uncertainty quantifiers, hence establishing a new extended framework, called FPD-OT. Our main contribution in this paper is to establish the connection between OT and FPD, providing new theoretical insights for both. This will lay the foundations for the application of FPD-OT in a subsequent work, notably in processing more sophisticated knowledge constraints, as well as in designing robust solutions in the case of uncertain marginals., Comment: Keywords: Optimal Transport, Fully Probabilistic Design, Convex optimization

The AIMD algorithm, which underpins the Transmission Control Protocol (TCP) for transporting data packets in communication networks, is perhaps the most successful control algorithm ever deployed. Recently, its use has been extended beyond communication networks, and successful applications of the AIMD algorithm have been reported in transportation, energy, and mathematical biology. A very recent development in the use of AIMD is its application in solving large-scale optimization and distributed control problems without the need for inter-agent communication. In this context, an interesting problem arises when multiple AIMD networks that are coupled in some sense (usually through a nonlinearity). The purpose of this note is to prove that such systems in certain settings inherit the ergodic properties of individual AIMD networks. This result has important consequences for the convergence of the aforementioned optimization algorithms. The arguments in the paper also correct conceptual and technical errors in [1].

In machine learning, training data often capture the behaviour of multiple subgroups of some underlying human population. This behaviour can often be modelled as observations of an unknown dynamical system with an unobserved state. When the training data for the subgroups are not controlled carefully, however, under-representation bias arises. To counter under-representation bias, we introduce two natural notions of fairness in time-series forecasting problems: subgroup fairness and instantaneous fairness. These notions extend predictive parity to the learning of dynamical systems. We also show globally convergent methods for the fairness-constrained learning problems using hierarchies of convexifications of non-commutative polynomial optimisation problems. We also show that by exploiting sparsity in the convexifications, we can reduce the run time of our methods considerably. Our empirical results on a biased data set motivated by insurance applications and the well-known COMPAS data set demonstrate the efficacy of our methods., Comment: Journal version of Zhou et al. [arXiv:2006.07315, AAAI 2021]

Cyclists travelling in urban areas are particularly at risk of harm from particulate emissions due to their increased breathing rate and proximity to vehicles. In this paper we combine human respiratory models with models of particulate inhalation to estimate the pollution risk an individual is experiencing in real time given the local pollution level and their heart rate for the first time. Using this model as a baseline, we learn a policy that simultaneously optimises the route for a large number of cyclists with diverse origins and destinations, to minimise overall pollution risk and account for the detrimental impacts of congestion. We learn this policy using reinforcement learning techniques on simulated data in different environments with varying distributions of cyclist fitness. These findings establish that individualised routing is effective in reducing pollution risk while cycling, improving the net benefits of active commuting.

Over two thirds of women of all ages in the UK have experienced some form of sexual harassment in a public space. Recent tragic incidents involving female pedestrians have highlighted some of the personal safety issues that women still face in cities today. There exist many popular location-based safety applications as a result of this; however, these applications tend to take a reactive approach where action is taken only after an incident has occurred. This paper proposes a preventative approach to the problem by creating safer public environments through societal incentivisation. The proposed system, called "Herd Routes", improves the safety of female pedestrians by generating busier pedestrian routes as a result of route incentivisation. A novel application of distributed ledgers is proposed to provide security and trust, a record of system users' locations and IDs, and a platform for token exchange. A proof-of-concept was developed using the simulation package SUMO (Simulation of Urban Mobility), and a smartphone app. was built in Android Studio so that pedestrian Hardware-in-the-Loop testing could be carried out to validate the technical feasibility and desirability of the system. With positive results from the initial testing of the proof-of-concept, further development could significantly contribute towards creating safer pedestrian routes through cities, and tackle the societal change that is required to improve female pedestrian safety in the long term.

In this paper, we describe an approach to guide drivers searching for a parking space (PS). The proposed system suggests a sequence of routes that drivers should traverse in order to maximise the expected likelihood of finding a PS and minimise the travel distance. This system is built on our recent architecture SPToken, which combines both Distributed Ledger Technology (DLT) and Reinforcement Learning (RL) to realise a system for the estimation of an unknown distribution without disturbing the environment. For this, we use a number of virtual tokens that are passed from vehicle to vehicle to enable a massively parallelised RL system that estimates the best route for a given origin-destination (OD) pair, using crowdsourced information from participant vehicles. Additionally, a moving window with reward memory mechanism is included to better cope with non-stationary environments. Simulation results are given to illustrate the efficacy of our system., Comment: 12 pages, 5 figures, 27th ITS World Congress, Hamburg, Germany, 11-15 October 2021

In this paper we present a feedback approach to the design of an attack mitigation policy for DAG-based Distributed Ledgers. We develop a model to analyse the behaviour of the ledger under the so called Tips Inflation Attack and we design a control strategy to counteract this attack strategy. The efficacy of this approach is showcased through a theoretical analysis, in the form of two theorems about the stability properties of the ledger with and without the controller, and extensive Monte Carlo simulations of an agent-based model of the distributed ledger.

In power systems, one wishes to regulate the aggregate demand of an ensemble of distributed energy resources (DERs), such as controllable loads and battery energy storage systems. We suggest a notion of predictability and fairness, which suggests that the long-term averages of prices or incentives offered should be independent of the initial states of the operators of the DER, the aggregator, and the power grid. We show that this notion cannot be guaranteed with many traditional controllers used by the load aggregator, including the usual proportional-integral (PI) controller. We show that even considering the non-linearity of the alternating-current model, this notion of predictability and fairness can be guaranteed for incrementally input-to-state stable (iISS) controllers, under mild assumptions.

This paper is concerned with the regulation control of a one-dimensional reaction-diffusion equation in the presence of a state-delay in the reaction term. The objective is to achieve the PI regulation of the right Dirichlet trace with a command selected as the left Dirichlet trace. The control design strategy consists of the design of a PI controller on a finite dimensional truncated model obtained by spectral reduction. By an adequate selection of the number of modes of the original infinite-dimensional system, we show that the proposed control design procedure achieves both the exponential stabilization of the original infinite-dimensional system as well as the setpoint regulation of the right Dirichlet trace., Comment: Accepted for publication in Automatica

It is well known that two-sided markets are unfair in a number of ways. For instance, female workers at Uber earn less than their male colleagues per mile driven. Similar observations have been made for other minority subgroups in other two-sided markets. Here, we suggest a novel market-clearing mechanism for two-sided markets, which promotes equalisation of the pay per hour worked across multiple subgroups, as well as within each subgroup. In the process, we introduce a novel notion of subgroup fairness (which we call Inter-fairness), which can be combined with other notions of fairness within each subgroup (called Intra-fairness), and the utility for the customers (Customer-Care) in the objective of the market-clearing problem. While the novel non-linear terms in the objective complicate market clearing by making the problem non-convex, we show that a certain non-convex augmented Lagrangian relaxation can be approximated to any precision in time polynomial in the number of market participants using semi-definite programming. This makes it possible to implement the market-clearing mechanism efficiently. On the example of driver-ride assignment in an Uber-like system, we demonstrate the efficacy and scalability of the approach, and trade-offs between Inter- and Intra-fairness.

This paper studies the boundary output feedback stabilization of general 1-D reaction-diffusion PDEs in the presence of a state delay in the reaction term. The control input applies through a Robin boundary condition while the system output is selected as a either Dirichlet or Neumann boundary trace. The control strategy takes the form of a finite-dimensional observer-based controller with feedback and observer gains that are computed in order to dominate the state delayed term. For any arbitrarily given value of the state delay, we show the exponential stability of the resulting closed-loop system provided the order of the observer is selected large enough.

There has been much recent interest in two-sided markets and dynamics thereof. In a rather a general discrete-time feedback model, which we show conditions that assure that for each agent, there exists the limit of a long-run average allocation of a resource to the agent, which is independent of any initial conditions. We call this property the unique ergodicity. Our model encompasses two-sided markets and more complicated interconnections of workers and customers, such as in a supply chain. It allows for non-linearity of the response functions of market participants. Finally, it allows for uncertainty in the response of market participants by considering a set of the possible responses to either price or other signals and a measure to sample from these.

We present order reduction results for linear time invariant descriptor systems. Results are given for both forced and unforced systems as well methods for constructing the reduced order systems. Our results establish a precise connection between classical and new results on this topic, and lead to an elementary construction of quasi-Weierstrass forms for a descriptor system. Examples are given to illustrate the usefulness of our results., Comment: None

We consider the design of distributed algorithms that govern the manner in which agents contribute to a social sensing platform. Specifically, we are interested in situations where fairness among the agents contributing to the platform is needed. A notable example are platforms operated by public bodies, where fairness is a legal requirement. The design of such distributed systems is challenging due to the fact that we wish to simultaneously realise an efficient social sensing platform, but also deliver a predefined quality of service to the agents (for example, a fair opportunity to contribute to the platform). In this paper, we introduce iterated function systems (IFS) as a tool for the design and analysis of systems of this kind. We show how the IFS framework can be used to realise systems that deliver a predictable quality of service to agents, can be used to underpin contracts governing the interaction of agents with the social sensing platform, and which are efficient. To illustrate our design via a use case, we consider a large, high-density network of participating parked vehicles. When awoken by an administrative centre, this network proceeds to search for moving missing entities of interest using RFID-based techniques. We regulate which vehicles are actively searching for the moving entity of interest at any point in time. In doing so, we seek to equalise vehicular energy consumption across the network. This is illustrated through simulations of a search for a missing Alzheimer's patient in Melbourne, Australia. Experimental results are presented to illustrate the efficacy of our system and the predictability of access of agents to the platform independent of initial conditions., Comment: 18 pages, 6 figures

This paper deals with the exponential input-to-state stabilization with respect to boundary disturbances of a class of diagonal infinite-dimensional systems via delay boundary control. The considered input delays are uncertain and time-varying. The proposed control strategy consists of a constant-delay predictor feedback controller designed on a truncated finite-dimensional model capturing the unstable modes of the original infinite-dimensional system. We show that the resulting closed-loop system is exponentially input-to-state stable with fading memory of both additive boundary input perturbations and disturbances in the computation of the predictor feedback., Comment: Published in Systems & Control Letters

This paper discusses the in-domain feedback stabilization of reaction-diffusion PDEs with Robin boundary conditions in the presence of an uncertain time- and spatially-varying delay in the distributed actuation. The proposed control design strategy consists of a constant-delay predictor feedback designed based on the known nominal value of the control input delay and is synthesized on a finite-dimensional truncated model capturing the unstable modes of the original infinite-dimensional system. By using a small-gain argument, we show that the resulting closed-loop system is exponentially stable provided that the variations of the delay around its nominal value are small enough. The proposed proof actually applies to any distributed-parameter system associated with an unbounded operator that 1) generates a $C_0$-semigroup on a weighted space of square integrable functions over a compact interval; and 2) is self-adjoint with compact resolvent., Comment: Accepted for publication in Automatica as a brief paper

In several social choice problems, agents collectively make decisions over the allocation of multiple divisible and heterogeneous resources with capacity constraints to maximize utilitarian social welfare. The agents are constrained through computational or communication resources or privacy considerations. In this paper, we analyze the convergence of a recently proposed distributed solution that allocates such resources to agents with minimal communication. It is based on the randomized additive-increase and multiplicative-decrease (AIMD) algorithm. The agents are not required to exchange information with each other, but little with a central agent that keeps track of the aggregate resource allocated at a time. We formulate the time-averaged allocations over finite window size and model the system as a Markov chain with place-dependent probabilities. Furthermore, we show that the time-averaged allocations vector converges to a unique invariant measure, and also, the ergodic property holds.

This paper is concerned with the point torque boundary feedback stabilization of a damped Euler-Bernoulli beam model in the presence of a time-varying state-delay. First, a finite-dimensional truncated model is derived by spectral reduction. Then, for a given stabilizing state-feedback of the delay-free truncated model, an LMI-based sufficient condition on the maximum amplitude of the state-delay is employed to guarantee the stability of the closed-loop state-delayed truncated model. Second, we assess the exponential stability of the resulting closed-loop infinite-dimensional system under the assumption that the number of modes of the original infinite-dimensional system captured by the truncated model has been selected large enough. Finally, we consider in our control design the possible presence of a distributed perturbation, as well as additive boundary perturbations in the control inputs. In this case, we derive for the closed-loop system an exponential input-to-state estimate with fading memory of the distributed and boundary disturbances., Comment: Preprint

This paper discusses the boundary feedback stabilization of a reaction-diffusion equation with Robin boundary conditions and in the presence of a time-varying state-delay. The proposed control design strategy is based on a finite-dimensional truncated model obtained via a spectral decomposition. By an adequate selection of the number of modes of the original infinite-dimensional system, we show that the design performed on the finite-dimensional truncated model achieves the exponential stabilization of the original infinite-dimensional system. In the presence of distributed disturbances, we show that the closed-loop system is exponentially input-to-state stable with fading memory., Comment: Published in Automatica as a brief paper

Cooperative Adaptive Cruise Control (CACC) systems are considered as key potential enablers to improve driving safety and traffic efficiency. They allow for automated vehicle following using wireless communication in addition to onboard sensors. To achieve string stability in CACC platoons, constant time headway (CTH) spacing policies have prevailed in research; namely, vehicle interspacing grows with the speed. While constant distance headway (CDH) spacing policies provide superior potential to increase traffic capacity than CTH, a major drawback is a smaller safety margin at high velocities and string stability cannot be achieved using a one-vehicle look-ahead communication. The hypothesis of this work is to apply CDH only in few driving situations, when traffic throughput is of highest importance and safety requirements can be met due to comparably low velocities. As the most relevant situations where CDH could be applied, we identify starting platoons at signalized intersections. In this paper, we illustrate this idea. Specifically, we compare CTH with CDH regarding its potential to increase the capacity of traffic lights. Starting with the elementary situation of single traffic lights we expand our scope to whole traffic networks including several thousand vehicles in simulation. Using real world data to calibrate and validate vehicle dynamics simulation and traffic simulation, the study discusses the most relevant working parameters of CDH, CTH, and the traffic system in which both are applied., Comment: A short version of this study was published in the Vehicular Technology Section in IEEE Access under the title "A numerical study on constant spacing policies for starting platoons at oversaturated intersections". First version (v1) submitted to IEEE Access on 21-Oct-2021, resubmission (v2) on 31-Jan-2022, acceptance (v3) on 09-Mar-2022

Within the study of uncertain dynamical systems, iterated random functions are a key tool. There, one samples a family of functions according to a stationary distribution. Here, we introduce an extension, where one sample functions according to a time-varying distribution over the family of functions. For such iterated piecewise-stationary random functions on Polish spaces, we prove a number of results, including a bound on the tracking error.

In this paper we propose a stochastic decentralized algorithm to recommend the most convenient Charging Station (CS) to Plug-in Electric Vehicles (PEVs) that need charging. In particular, we use different cost functions to describe the possibly different priorities of PEV drivers, such as the preference to minimize charging costs, charging times, or the distance between them and the CS. For this purpose, we leverage on an IoT architecture based on a permissioned Distributed Ledger Technology (DLT) to enforce compliance of drivers and reduces the occurrence of detrimental misbehaviours of drivers. Extensive simulations performed with the mobility simulator SUMO in realistic city-wide networks have been provided to illustrate how the proposed PEV assignment procedure works in practice, and to validate its performance., Comment: accepted to IEEE Internet of Things journal

The link between transport related emissions and human health is a major issue for city municipalities worldwide. PM emissions from exhaust and non-exhaust sources are one of the main worrying contributors to air-pollution. In this paper, we challenge the notion that a ban on internal combustion engine vehicles will result in clean and safe air in our cities, since emissions from tyres and other non-exhaust sources are expected to increase in the near future. To this end, we present data from the city of Dublin that document that the current amount of tyre-related PM emissions in the city might already be above or close to the levels deemed safe by the World Health Organization. As a solution to this problem, we present a feedback-enabled distributed access control mechanism and ride-sharing scheme to limit the number of vehicles in a city and therefore maintain the amount of transport-related PM to safe levels.

This paper discusses the robustness of the constant-delay predictor feedback in the case of an uncertain time-varying input delay. Specifically, we study the stability of the closed-loop system when the predictor feedback is designed based on the knowledge of the nominal value of the time-varying delay. By resorting to an adequate Lyapunov-Krasovskii functional, we derive an LMI-based sufficient condition ensuring the exponential stability of the closed-loop system for small enough variations of the time-varying delay around its nominal value. These results are extended to the feedback stabilization of a class of diagonal infinite-dimensional boundary control systems in the presence of a time-varying delay in the boundary control input., Comment: Published in Automatica as a brief paper

We study a class of distributed optimization problems for multiple shared resource allocation in Internet-connected devices. We propose a derandomized version of an existing stochastic additive-increase and multiplicative-decrease (AIMD) algorithm. The proposed solution uses one bit feedback signal for each resource between the system and the Internet-connected devices and does not require inter-device communication. Additionally, the Internet-connected devices do not compromise their privacy and the solution does not dependent on the number of participating devices. In the system, each Internet-connected device has private cost functions which are strictly convex, twice continuously differentiable and increasing. We show empirically that the long-term average allocations of multiple shared resources converge to optimal allocations and the system achieves minimum social cost. Furthermore, we show that the proposed derandomized AIMD algorithm converges faster than the stochastic AIMD algorithm and both the approaches provide approximately same solutions.

Internet-of-Things (IoT) enables the development of sharing economy applications. In many sharing economy scenarios, agents both produce as well as consume a resource; we call them prosumers. A community of prosumers agrees to sell excess resource to another community in a prosumer market. In this chapter, we propose a control theoretic approach to regulate the number of prosumers in a prosumer community, where each prosumer has a cost function that is coupled through its time-averaged production and consumption of the resource. Furthermore, each prosumer runs its distributed algorithm and takes only binary decisions in a probabilistic way, whether to produce one unit of the resource or not and to consume one unit of the resource or not. In the proposed approach, prosumers do not explicitly exchange information with each other due to privacy reasons, but little exchange of information is required for feedback signals, broadcast by a central agency. In the proposed approach, prosumers achieve the optimal values asymptotically. Furthermore, the proposed approach is suitable to implement in an IoT context with minimal demands on infrastructure. We describe two use cases; community-based car sharing and collaborative energy storage for prosumer markets. We also present simulation results to check the efficacy of the algorithms., Comment: To appear as a chapter in "Analytics for the Sharing Economy: Mathematics, Engineering and Business Perspectives", Editors: E. Crisostomi et al., Springer, 2019 (forthcoming book)

This paper deals with the establishment of Input-to-State Stability (ISS) estimates for infinite dimensional systems with respect to both boundary and distributed disturbances. First, a new approach is developed for the establishment of ISS estimates for a class of Riesz-spectral boundary control systems satisfying certain eigenvalue constraints. Second, a concept of weak solutions is introduced in order to relax the disturbances regularity assumptions required to ensure the existence of classical solutions. The proposed concept of weak solutions, that applies to a large class of boundary control systems which is not limited to the Riesz-spectral ones, provides a natural extension of the concept of both classical and mild solutions. Assuming that an ISS estimate holds true for classical solutions, we show the existence, the uniqueness, and the ISS property of the weak solutions., Comment: Published in Automatica as a regular paper

This note establishes the Exponential Input-to-State Stability (EISS) property for a clamped-free damped string with respect to distributed and boundary disturbances. While efficient methods for establishing ISS properties for distributed parameter systems with respect to distributed disturbances have been developed during the last decades, establishing ISS properties with respect to boundary disturbances remains challenging. One of the well-known methods for well-posedness analysis of systems with boundary inputs is the use of a lifting operator for transferring the boundary disturbance to a distributed one. However, the resulting distributed disturbance involves time derivatives of the boundary perturbation. Thus, the subsequent ISS estimate depends on its amplitude, and may not be expressed in the strict form of ISS properties. To solve this problem, we show for a clamped-free damped string equation that the projection of the original system trajectories in an adequate Riesz basis can be used to establish the desired EISS property., Comment: Accepted for publication in IEEE Transactions on Automatic Control as a brief paper

In several smart city applications, multiple resources must be allocated among competing agents that are coupled through such shared resources and are constrained --- either through limitations of communication infrastructure or privacy considerations. We propose a distributed algorithm to solve such distributed multi-resource allocation problems with no direct inter-agent communication. We do so by extending a recently introduced additive-increase multiplicative-decrease (AIMD) algorithm, which only uses very little communication between the system and agents. Namely, a control unit broadcasts a one-bit signal to agents whenever one of the allocated resources exceeds capacity. Agents then respond to this signal in a probabilistic manner. In the proposed algorithm, each agent makes decision of its resource demand locally and an agent is unaware of the resource allocation of other agents. In empirical results, we observe that the average allocations converge over time to optimal allocations., Comment: To appear in IEEE International Smart Cities Conference (ISC2 2018), Kansas City, USA, September, 2018. arXiv admin note: substantial text overlap with arXiv:1711.01977

Across smart-grid and smart-city application domains, there are many problems where an ensemble of agents is to be controlled such that both the aggregate behaviour and individual-level perception of the system's performance are acceptable. In many applications, traditional PI control is used to regulate aggregate ensemble performance. Our principal contribution in this note is to demonstrate that PI control may not be always suitable for this purpose, and in some situations may lead to a loss of ergodicity for closed-loop systems. Building on this observation, a theoretical framework is proposed to both analyse and design control systems for the regulation of large scale ensembles of agents with a probabilistic intent. Examples are given to illustrate our results., Comment: Journal version of Fioravanti et al. [arXiv:1703.07308, CDC 2017]

This paper describes how Distributed Ledger Technologies can be used to design a class of cyber-physical systems, as well as to enforce social contracts and to orchestrate the behaviour of agents trying to access a shared resource. The first part of the paper analyses the advantages and disadvantages of using Distributed Ledger Technologies architectures to implement certain control systems in an Internet of Things (IoT) setting, and then focuses on a specific type of DLT based on a Directed Acyclic Graph. In this setting we propose a set of delay differential equations to describe the dynamical behaviour of the Tangle, an IoT-inspired Directed Acyclic Graph designed for the cryptocurrency IOTA. The second part proposes an application of Distributed Ledger Technologies as a mechanism for dynamic deposit pricing, wherein the deposit of digital currency is used to orchestrate access to a network of shared resources. The pricing signal is used as a mechanism to enforce the desired level of compliance according to a predetermined set of rules. After presenting an illustrative example, we analyze the control system and provide sufficient conditions for the stability of the network., Comment: This paper has been accepted for publication on the journal IEEE Access, with the title "Distributed Ledger Technology for Smart Cities, the Sharing Economy, and Social Compliance"