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

We present new criteria on the existence of fixed points that combine some monotonicity assumptions with the classical fixed point index theory. As an illustrative application, we use our theoretical results to prove the existence of…

Covering is a common type of data structure and covering-based rough set theory is an efficient tool to process this data. Lattice is an important algebraic structure and used extensively in investigating some types of generalized rough…

The special linear group G=SL_n(Z[x1,...,xk]) (n at least 3 and k finite) is called the universal lattice. Let n be at least 4, p be any real number in (1,\infty). The main result is the following: any finite index subgroup of G has the…

We study two-player games with alternating moves played on infinite trees. Our main focus is on the case where the trees are full (regular) and the winning set is open (with respect to the product topology on the tree). Gale and Stewart…

We show that a continuous map or a continuous flow on $\R^{n}$ with a certain recurrence relation must have a fixed point. Specifically, if there is a compact set W with the property that the forward orbit of every point in $\R^{n}$…

Fictitious play (FP) is a history-based strategy to choose actions in normal-form games, where players best-respond to the empirical frequency of their opponents' past actions. While it is well-established that FP converges to the set of…

We introduce a game on graphs. By a theorem of Zermelo, each instance of the game on a finite graph is determined. While the general decision problem on which player has a winning strategy in a given instance of the game is unsolved, we…

Game comonads, introduced by Abramsky, Dawar and Wang, and developed by Abramsky and Shah, give a categorical semantics for model comparison games. We present an axiomatic account of Feferman-Vaught-Mostowski (FVM) composition theorems…

In this paper, the Pazy's Fixed Point Theorems of monotone $\alpha-$nonexpansive mapping $T$ are proved in a uniformly convex Banach space $E$ with the partial order "$\leq$". That is, we obtain that the fixed point set of $T$ with respect…

We prove that all isometric actions of higher rank simple Lie groups and their lattices on arbitrary uniformly convex Banach spaces have a fixed point. This vastly generalises a recent breakthrough of Oppenheim. Combined with earlier work…

Schmidt's game, and other similar intersection games have played an important role in recent years in applications to number theory, dynamics, and Diophantine approximation theory. These games are real games, that is, games in which the…

We present a fixed point theorem on topological cylinders in normed linear spaces for maps satisfying a property of stretching a space along paths. This result is a generalization of a similar theorem obtained by D. Papini and F. Zanolin.…

In this paper, we study the fixed point theory for multi-valued mappings on partial cone metric spaces. We prove an analogous to the well-known Kannan$'s$ fixed point theorem and Chatterjea$'s$ fixed point theorem for multi-valued mappings…

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 are going to prove a very general fixed point theorem for mappings acting in partial metric spaces. In that theorem we impose some conditions on behavior of considered mappings on orbits and a condition relating orbits of…

The classical Lefschetz fixed point theorem states that the number of fixed points, counted with multiplicity $\pm 1$, of a smooth map $f$ from a manifold $M$ to itself can be calculated as the alternating sum $\sum (-1)^k \textrm{ tr }…

We give new characterizations of core imputations for the following games: * The assignment game. * Concurrent games, i.e., general graph matching games having non-empty core. * The unconstrained bipartite $b$-matching game (edges can be…

We study approachability theory in the presence of constraints. Given a repeated game with vector payoffs, we characterize the pairs of sets (A,D) in the payoff space such that Player 1 can guarantee that the long-run average payoff…

We develop a minimal, timeless game-theoretic representation of the mass-geometry relation. An "Object" (mass) and "Space" (geometry) choose strategies in a static normal-form game; utilities encode stability as mutual consistency rather…

We study deterministic constructions of graphs for which the unique completion of low rank matrices is generically possible regardless of the values of the entries. We relate the completability to the presence of some patterns (particular…