Related papers: Order-theoretical fixed point theorems for corresp…
We study trees where each successor set is equipped with some additional structure. We introduce a family of automaton models for such trees and prove their equivalence to certain fixed-point logics. As a consequence we obtain…
Fixed points are a recurring theme in computer science and are often constructed as limits of suitably seeded fixed point iterations. We present the algebra of iterative constructions (AIC) -- a purely algebraic approach to reasoning about…
We generalize the notion of complete binary relation on complete lattice to residuated lattice valued ordered sets and show its properties. Then we focus on complete fuzzy tolerances on fuzzy complete lattices and prove they are in…
We introduce a new class of abstract structures, which we call generalized ultrametric semilattices, and in which the meet operation of the semilattice coexists with a generalized distance function in a tightly coordinated way. We prove a…
Given an infinite word ${\bf w}$ on a finite alphabet, an immediate question arises:~can we understand the frequency of letters in ${\bf w}$\,? For words that are the fixed points of substitutions, the answer to this question is often `yes'…
We develop a fixed-point extension of quantitative equational logic and give semantics in one-bounded complete quantitative algebras. Unlike previous related work about fixed-points in metric spaces, we are working with the notion of…
We introduce a notion of substitutability for correspondences and establish a monotone comparative static result, unifying results such as the inverse isotonicity of M-matrices, Berry, Gandhi and Haile's identification of demand systems,…
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing optimal strategies and the values of competitive games…
We consider Markov chains on partially ordered sets that generalize the success-runs and remaining life chains in reliability theory. We find conditions for recurrence and transience and give simple expressions for the invariant…
In this paper, we study finite-agent linear-quadratic games on graphs. Specifically, we propose a comprehensive framework that extends the existing literature by incorporating heterogeneous and interpretable player interactions. Compared to…
We examine the problem of the existence of optimal deterministic stationary strategiesintwo-players antagonistic (zero-sum) perfect information stochastic games with finitely many states and actions.We show that the existenceof such…
In this paper we prove FG-coupled fixed point theorems for different contractive mappings and generalized quasi- contractive mappings in partially ordered complete metric spaces. We prove the existence of FG-coupled fixed points of…
The aim of this paper is to present some fixed point theorems for generalized contractions by altering distance functions in a complete cone metric spaces endowed with a partial order. We also generalize fixed point theorems of J. Harjani,…
This paper develops a unified framework for zero-sum games in which both the pure strategies and the payoff matrices contain complex-valued entries. By leveraging a linear isomorphism between complex and real vector spaces, we extend key…
We extend to binary relational systems the notion of compact and normal structure, introduced by J.P.Penot for metric spaces, and we prove that for the involutive and reflexive ones, every commuting family of relational homomorphisms has a…
The classical, complete-information two-player games assume that the problem data (in particular the payoff matrix) is known exactly by both players. In a now famous result, Nash has shown that any such game has an equilibrium in mixed…
By reformulating a learning process of a set system L as a game between Teacher (presenter of data) and Learner (updater of the abstract independent set), we define the order type dim L of L to be the order type of the game tree. The theory…
The purpose of this note is to generalize the celebrated Ran and Reurings fixed point theorem to the setting of a space with a binary relation that is only transitive (and not necessarily a partial order) and a relation-complete metric. The…
In this paper, vector ultrametric spaces are introduced and a fixed point theorem is given for correspondences. Our main result generalizes a known theorem in ordinary ultrametric spaces.
This paper presents a complete axiomatization of Monadic Second-Order Logic (MSO) over infinite trees. MSO on infinite trees is a rich system, and its decidability ("Rabin's Tree Theorem") is one of the most powerful known results…