Related papers: Order-theoretical fixed point theorems for corresp…

It is well-known that in finite strategic games true common belief (or common knowledge) of rationality implies that the players will choose only strategies that survive the iterated elimination of strictly dominated strategies. We…

We answer the question of when a new point can be added in a continuous way to configurations of $n$ distinct points in a closed ball of arbitrary dimension. We show that this is possible given an ordered configuration of $n$ points if and…

In this article, we prove the existence of common fixed points for a pair of maps on a $q$-spherically complete $T_0$-ultra-quasi-metric space. The present article is a generalization, in the assymmetric setting of the paper of Rao et…

The known results regarding two-player zero-sum games are naturally generalized in complex space and are presented through a complete compact theory. The payoff function is defined by the real part of the payoff function in the real case,…

We prove fixed point theorems in a space with a distance function that takes values in a partially ordered monoid. On the one hand, such an approach allows one to generalize some fixed point theorems in a broad class of spaces, including…

In this paper, we study the connections between the normality, regularity, full regularity, and chain-complete property in partially ordered Banach spaces. Then, by applying these properties, we prove some fixed point theorems on partially…

We study the fixed point theory of n-valued maps of a space X using the fixed point theory of maps between X and its configuration spaces. We give some general results to decide whether an n-valued map can be deformed to a fixed point free…

We study the existence of positional strategies for the protagonist in infinite duration games over arbitrary game graphs. We prove that prefix-independent objectives in $\Sigma_0^2$ which are positional and admit a (strongly) neutral…

We established a fixed-point theorem for mapping satisfying a general contractive inequality of integral type depended an another function. This theorem substantially extend the theorem due to Branciari (2003) and Rhoades (2003)

Shapley operators of undiscounted zero-sum two-player games are order-preserving maps that commute with the addition of a constant. We characterize the fixed point sets of Shapley operators, in finite dimension (i.e., for games with a…

In the context of formal verification in general and model checking in particular, parity games serve as a mighty vehicle: many problems are encoded as parity games, which are then solved by the seminal algorithm by Jurdzinski. In this…

The classes of relativized relation algebras (whose units are not necessarily transitive as binary relations) are known to be finitely axiomatizable. In this article, we give a new proof for this fact that is easier and more transparent…

In this paper, we introduce the concept of infinitely split Nash equilibrium in repeated games in which the profile sets are chain-complete posets. Then by using a fixed point theorem on posets in [8], we prove an existence theorem. As an…

The principle of open determinacy for class games---two-player games of perfect information with plays of length $\omega$, where the moves are chosen from a possibly proper class, such as games on the ordinals---is not provable in…

Burke's theorem can be seen as a fixed-point result for an exponential single-server queue; when the arrival process is Poisson, the departure process has the same distribution as the arrival process. We consider extensions of this result…

This paper is devoted to the investigation of an important issue recently brought into attention by a recent paper of Arutyunov: the relation between openness of composition of set-valued maps and fixed point results. More precisely, we…

We present an alternative proof of a theorem by Courcelle, Makowski and Rotics which states that problems expressible in MSO are solvable in linear time for graphs of bounded rankwidth. Our proof uses a game-theoretic approach and has the…

Topological fixpoint logics are a family of logics that admits topological models and where the fixpoint operators are defined with respect to the topological interpretations. Here we consider a topological fixpoint logic for relational…

Preferences, fundamental in all forms of strategic behavior and collective decision-making, in their raw form, are an abstract ordering on a set of alternatives. Agents, we assume, revise their preferences as they gain more information…

We establish common fixed point theorems for two pairs of weakly compatible self-mappings using an auxiliary function of two variables. Unlike classical results, our theorems do not assume continuity of the mappings and require completeness…