Conditional belief types Report Title We study type spaces where a player's type at a state is a conditional probability on the space. We axiomatize these spaces using conditional belief operators, examining three additional axioms of increasing strength. First, introspection, which requires the agent to be unconditionally certain of her beliefs. Second, echo, according to which the uncondition...

In the setting of hyperbolic spaces, we show that convergence Browder-type sequences and Halpern iterations respectively entail their viscosity version with a Rakotch map. We also hybrid Krasnoselskii-Mann iteration follows from Browder type sequence. Our results follow proof-theoretic techniques (proof mining). From an analysis theorems due to T. Suzuki, extract transformation rates for origin...

We consider the l1-regularized Markowitz model, where a l1-penalty term is added to the objective function of the classical mean-variance one to stabilize the solution process, promoting sparsity in the solution and avoiding short positions. In this paper, we consider the Bregman iteration method to solve the related constrained optimization problem. We propose an iterative algorithm based on a...

we prove a strong convergence theorem for the modified noor iterations‎ ‎in the framework of cat(0) spaces‎. ‎our results extend and improve the corresponding results of‎ ‎x‎. ‎qin‎, ‎y‎. ‎su and m‎. ‎shang‎, ‎t‎. ‎h‎. ‎kim and h‎. ‎k‎. ‎xu and s‎. ‎saejung‎ ‎and some others‎.

Halpern and Pearl introduced a definition of actual causality; Eiter and Lukasiewicz showed that computing whether X = x is a cause of Y = y is NP-complete in binary models (where all variables can take on only two values) and Σ2 -complete in general models. In the final version of their paper, Halpern and Pearl slightly modified the definition of actual cause, in order to deal with problems po...

We consider the infinite-horizon γ-discounted optimal control problem formalized by Markov Decision Processes. Running any instance of Modified Policy Iteration—a family of algorithms that can interpolate between Value and Policy Iteration—with an error at each iteration is known to lead to stationary policies that are at least 2γ (1−γ)2 -optimal. Variations of Value and Policy Iteration, that ...

modeled as relations between states (see (Kozen Tiuryn 1990; Harel 1984; Parikh 1981) for surveys on PDL’s, see also (Stifling 1992) for a somewhat different account). The language of PDL includes formulae built from the boolean combinations of atomic propositions that are interpreted as simple properties of states, plus the construct (R/¢, where ¢ is a formula and R is an action, whose meaning...