Related papers: On maximal agreement couplings
We study a control problem where the state equation is a nonlinear partial differential equation of the calculus of variation in a bounded domain, perturbed by noise. We allow the control to act on the boundary and set stochastic boundary…
It is well-known that coupling constraints in linear bilevel optimization can lead to disconnected feasible sets, which is not possible without coupling constraints. However, there is no difference between linear bilevel problems with and…
We consider the problem of robotic planning under uncertainty in this paper. This problem may be posed as a stochastic optimal control problem, a solution to which is fundamentally intractable owing to the infamous "curse of…
We present a logical framework to represent and reason about stochastic optimization problems based on probability answer set programming. This is established by allowing probability optimization aggregates, e.g., minimum and maximum in the…
Gaussian random processes which variances reach theirs maximum values at unique points are considered. Exact asymptotic behaviors of probabilities of large absolute maximums of theirs trajectories have been evaluated using Double Sum Method…
We propose a timed and soft extension of Concurrent Constraint Programming. The time extension is based on the hypothesis of bounded asynchrony: the computation takes a bounded period of time and is measured by a discrete global clock.…
A stochastic system of particles is considered in which the sizes of the particles increase by successive binary mergers with the constraint that each coagulation event involves a particle with minimal size. Convergence of a suitably…
We propose models describing the collective dynamics of two opposing groups of individuals with stochastic communication. Individuals from the same group are assumed to align in a stochastic manner, while individuals from different groups…
A bipartite quantum state (for two systems in any dimensions) can be decomposed as a superposition of many components. For a superposition of more than two components we prove that there is a bound of the entanglement of the superposition…
Implicit methods for the numerical solution of initial-value problems may admit multiple solutions at any given time step. Accordingly, their nonlinear solvers may converge to any of these solutions. Below a critical timestep, exactly one…
We study a model of consensus decision making, in which a finite group of Bayesian agents has to choose between one of two courses of action. Each member of the group has a private and independent signal at his or her disposal, giving some…
We find tight lower and upper bounds on the entanglement of a superposition of two bipartite states in terms of the entanglement of the two states constituting the superposition. Our upper bound is dramatically tighter than the one…
This paper considers pairs of optimization problems that are defined from a single input and for which it is desired to find a good approximation to either one of the problems. In many instances, it is possible to efficiently find an…
For Markov processes over discrete configurations, an asymptotic bound on the uncertainty of stochastic fluxes is derived in terms of the harmonic mean of decay rates with respect to the stationary distribution. This bound is necessarily…
For optimal stopping problems with time-inconsistent preference, we measure the inherent level of time-inconsistency by taking the time needed to turn the naive strategies into the sophisticated ones. In particular, when in a repeated…
In this paper, we consider a leader-following consensus problem of a group of autonomous agents with time-varying coupling delays. Two different cases of coupling topologies are investigated. At first, a necessary and sufficient condition…
We all have preferences when multiple choices are available. If we insist on satisfying our preferences only, we may suffer a loss due to conflicts with other people's identical selections. Such a case applies when the choice cannot be…
We investigate upper and lower bounds on the entropy of entanglement of a superposition of bipartite states as a function of the individual states in the superposition. In particular, we extend the results in [G. Gour, arxiv.org:0704.1521…
We develop a necessary stochastic maximum principle for a finite-dimensional stochastic control problem in infinite horizon under a polynomial growth and joint monotonicity assumption on the coefficients. The second assumption generalizes…
The maximum observable correlation between the two components of a bipartite quantum system is a property of the joint density operator, and is achieved by making particular measurements on the respective components. For pure states it…