相关论文: A remark on utility streams

We present a method for calculating and analyzing stakeholder utilities of processes that arise in, but are not limited to, the social sciences. These areas include business process analysis, healthcare workflow analysis and policy process…

Many complex systems demand manifold resources to be supplied from distinct channels to function properly, i.e, water, gas, and electricity for a city. Here, we study a model for viability of such systems demanding more than one type of…

Stream constraint programming is a recent addition to the family of constraint programming frameworks, where variable domains are sets of infinite streams over finite alphabets. Previous works showed promising results for its applicability…

We consider a problem of optimal investment with intermediate consumption and random endowment in an incomplete semimartingale model of a financial market. We establish the key assertions of the utility maximization theory assuming that…

In this work we present an overview of statistical learning, followed by a survey of robust streaming techniques and challenges, culminating in several rigorous results proving the relationship that we motivate and hint at throughout the…

A reply to the commentaries of Yana (2013), and some jots on information theory.

We propose a new approach to utilities that is consistent with state-dependent utilities. In our model utilities reflect the level of consumption satisfaction of flows of cash in future times as they are valued when the economic agents are…

We consider a sequence of repeated interactions between an agent and an environment. Uncertainty about the environment is captured by a probability distribution over a space of hypotheses, which includes all computable functions. Given a…

Fair termination is the property of programs that may diverge "in principle" but that terminate "in practice", i.e. under suitable fairness assumptions concerning the resolution of non-deterministic choices. We study a conservative…

Consider the complete n-vertex graph whose edge-lengths are independent exponentially distributed random variables. Simultaneously for each pair of vertices, put a constant flow between them along the shortest path. Each edge gets some…

Continuous queries over data streams may suffer from blocking operations and/or unbound wait, which may delay answers until some relevant input arrives through the data stream. These delays may turn answers, when they arrive, obsolete to…

We present a comprehensive study of utility function of the minority game in its efficient regime. We develop an effective description of state of the game. For the payoff function $g(x)=\sgn (x)$ we explicitly represent the game as the…

Our comments are in two parts. First, we make some observations regarding the methodology in Chambers et al. [arXiv:0708.0302]. Second, we briefly describe another interesting network monitoring problem that arises in the context of…

We present a necessary and sufficient condition for Alt's system to be represented by a continuous utility function. Moreover, we present a necessary and sufficient condition for this utility function to be concave. The latter condition can…

Richard Cox [1] set the axiomatic foundations of probable inference and the algebra of propositions. He showed that consistency within these axioms requires certain rules for updating belief. In this paper we use the analogy between…

These informal notes, initially prepared a few years ago, look at various questions related to infinite processes in several parts of mathematics, with emphasis on examples.

We define a broad class of deterministic stream functions and show they can be implemented as homomorphisms into a "state" monoid. The homomorphism laws are simpler than the conditions of previous semantic frameworks for stream program…

We prove a strong version of the Max-Flow Min-Cut theorem for countable networks, namely that in every such network there exist a flow and a cut that are "orthogonal" to each other, in the sense that the flow saturates the cut and is zero…

Motivated by an application to resource sharing network modelling, we consider a problem of greedy maximization (i.e., maximization of the consecutive minima) of a vector in $R^n$, with the admissible set indexed by the time parameter. The…

We study two notions of expansiveness for continuous semiflows: expansiveness in the sense of Alves, Carvalho and Siqueira (2017), and an adaptation of positive expansiveness in the sense of Artigue (2014). We prove that if $X$ is a metric…