Related papers: Programs with Stringent Performance Objectives Wil…
Self-adjusting, or adaptive systems have gathered much recent interest. We present a model for self-adjusting systems which treats the control parameters of the system as slowly varying, rather than constant. The dynamics of these…
We study turn-based stochastic zero-sum games with lexicographic preferences over reachability and safety objectives. Stochastic games are standard models in control, verification, and synthesis of stochastic reactive systems that exhibit…
Cooperative games provide a framework to study cooperation among self-interested agents. They offer a number of solution concepts describing how the outcome of the cooperation should be shared among the players. Unfortunately, computational…
This paper focuses on an interesting phenomenon when chaos meets computers. It is found that digital computers are absolutely incapable of showing true long-time dynamics of some chaotic systems, including the tent map, the Bernoulli shift…
Implicit variables of a mathematical program are variables which do not need to be optimized but are used to model feasibility conditions. They frequently appear in several different problem classes of optimization theory comprising bilevel…
In stochastic games with incomplete information, the uncertainty is evoked by the lack of knowledge about a player's own and the other players' types, i.e. the utility function and the policy space, and also the inherent stochasticity of…
In the vicinity of a solution of a nonlinear programming problem at which both strict complementarity and linear independence of the active constraints may fail to hold, we describe a technique for distinguishing weakly active from strongly…
We show for several computational problems how classical greedy algorithms for special cases can be derived in a simple way from dynamic programs for the general case: interval scheduling (restricted to unit weights), knapsack (restricted…
Modern software systems are often equipped with hundreds to thousands of configuration options, many of which greatly affect performance. Unfortunately, properly setting these configurations is challenging for developers due to the complex…
A multidimensional chaos is generated by a special initial value problem for the non-autonomous impulsive differential equation. The existence of a chaotic attractor is shown, where density of periodic solutions, sensitivity of solutions…
Strong nonlinear effects combined with diffusive coupling may give rise to unpredictable evolution in spatially extended deterministic dynamical systems even in the presence of a fully negative spectrum of Lyapunov exponents. This regime,…
It has been proposed to make practical use of chaos in communication, in enhancing mixing in chemical processes and in spreading the spectrum of switch-mode power suppies to avoid electromagnetic interference. It is however known that for…
In this note, we study a class of stochastic control problems where the optimal strategies are described by two parameters. These include a subset of singular control, impulse control, and two-player stochastic games. The parameters are…
Chaos is associated with stochasticity, complex, irregular motion, etc. It has some peculiar properties such as ergodicity, highly initial value sensitivity, non-periodicity and long-term unpredictability. These pseudo random features lead…
In this paper, a new approach to the problem of stabilizing a chaotic system is presented. In this regard, stabilization is done by sustaining chaotic properties of the system. Sustaining the chaotic properties has been mentioned to be of…
Optimizing strategic decisions (a.k.a. computing equilibrium) is key to the success of many non-cooperative multi-agent applications. However, in many real-world situations, we may face the exact opposite of this game-theoretic problem --…
Chaotic functions are characterized by sensitivity to initial conditions, transitivity, and regularity. Providing new functions with such properties is a real challenge. This work shows that one can associate with any Boolean network a…
In this paper I present several algorithmic techniques for improving the decision process of multiple types of agents behaving in environments where their interests are in conflict. The interactions between the agents are modelled by using…
It is well known that a non-cooperative game may have multiple equilibria. In this paper we consider the efficiency of games, measured by the ratio between the aggregate payoff over all Nash equilibria and that over all admissible controls.…
We propose a computational framework to quantify (measure) and to optimize the reliability of complex systems. The approach uses a graph representation of the system that is subject to random failures of its components (nodes and edges).…