Related papers: On maximal agreement couplings
We consider a class of closed loop stochastic optimal control problems in finite time horizon, in which the cost is an expectation conditional on the event that the process has not exited a given bounded domain. An important difficulty is…
We investigate quantum states that posses both maximum entanglement and maximum discord between the pertinent parties. Since entanglement (discord) is defined only for bipartite (two qubit) systems, we shall introduce an appropriate sum…
In the "correlated sampling" problem, two players are given probability distributions $P$ and $Q$, respectively, over the same finite set, with access to shared randomness. Without any communication, the two players are each required to…
This article investigates the phenomenon of maximal rigidity in spatial processes, where perfect interpolation of the process is possible from partial information, specifically, from its restriction to a strict subdomain, often resulting in…
This paper considers the optimal control problem of connecting two periodic trajectories with maximal persistence. A maximally persistent trajectory is close to the periodic type in the sense that the norm of the image of this trajectory…
A coordinate-free proof of the Maximum Principle is provided in the specific case of an optimal control problem with fixed time. Our treatment heavily relies on a special notion of variation of curves that consist of a concatenation of…
Existing protocols for multilateral negotiation require a full consensus among the negotiating parties. In contrast, we propose a protocol for multilateral negotiation that allows partial consensus, wherein only a subset of the negotiating…
The task of learning to pick a single preferred example out a finite set of examples, an "optimal choice problem", is a supervised machine learning problem with complex, structured input. Problems of optimal choice emerge often in various…
Two numerical methods are proposed for detection of coupling between multiple time series generated by deterministic nonlinear systems. The first detects interdependence or the existence of coupling between time series. The second…
We study the optimization of the stable marriage problem. All individuals attempt to optimize their own satisfaction, subject to mutually conflicting constraints. We find that the stable solutions are generally not the globally best…
This paper presents analyses for the maximum hands-off control using the geometric methods developed for the theory of turnpike in optimal control. First, a sufficient condition is proved for the existence of the maximum hands-off control…
For the formal verification and design of control systems, abstractions with quantified accuracy are crucial. This is especially the case when considering accurate deviation bounds between a stochastic continuous-state model and its finite…
Multi-stage stochastic programming is a well-established framework for sequential decision making under uncertainty by seeking policies that are fully adapted to the uncertainty. Often such flexible policies are not desirable, and the…
We consider a Markov chain of point processes such that each state is a super position of an independent cluster process with the previous state as its centre process together with some independent noise process. The model extends earlier…
One-max search is a classic problem in online decision-making, in which a trader acts on a sequence of revealed prices and accepts one of them irrevocably to maximise its profit. The problem has been studied both in probabilistic and in…
We study the entanglement of a multipartite quantum state. An inequality between the bipartite concurrence and the multipartite concurrence is obtained. More effective lower and upper bounds of the multipartite concurrence are obtained. By…
The entanglement quantified by negativity of pure bipartite superposed states is studied. We show that if the entanglement is quantified by the concurrence two pure states of high fidelity to one another still have nearly the same…
The paper proposes a surprisingly simple characterization of a large class of models of distributed computing, via an agreement function: for each set of processes, the function determines the best level of set consensus these processes can…
We first present a probabilistic version of ACP that rests on the principle that probabilistic choices are always resolved before choices involved in alternative composition and parallel composition are resolved and then extend this…
The Poisson process is the most elementary continuous-time stochastic process that models a stream of repeating events. It is uniquely characterised by a single parameter called the rate. Instead of a single value for this rate, we here…