Related papers: Brouwer's fixed point theorem with sequentially at…
We prove a fixpoint theorem for contractions on Cauchy-complete quantale-enriched categories. It holds for any quantale whose underlying lattice is continuous, and applies to contractions whose control function is sequentially…
An algebraic proof is presented for the finite strong standard completeness of involutive uninorm logic with fixed point. The result may provide a first step towards settling the open standard completeness problem for involutive uninorm…
We present a fixed point theorem for a class of (potentially) non-monotonic functions over specially structured complete lattices. The theorem has as a special case the Knaster-Tarski fixed point theorem when restricted to the case of…
We propose a new determinacy hypothesis for transfinite games, use the hypothesis to extend the perfect set theorem, prove relationships between various determinacy hypotheses, expose inconsistent versions of determinacy, and provide a…
We present a constructive proof of Tychonoff's fixed point theorem in a locally convex space for sequentially locally non-constant functions, As a corollary to this theorem we also present Schauder's fixed point theorem in a Banach space…
We obtain an almost sure limit theorem for the maximum of nonstationary random fields under some dependence conditions.
In this paper, we present an integral Suzuki-type fixed point theorem for multivalued mappings defined on a complete metric space in terms of the \'{C}iri\'{c} integral contractions. As an application, we will prove an existence and…
Game-theoretic probability uses the structure of gambles to define a concept like probability, but which is more flexible and robust. We show that results in game-theoretic probability can be thought of as minimax theorems for specific…
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…
In the realm of light logics deriving from linear logic, a number of variants of exponential rules have been investigated. The profusion of such proof systems induces the need for cut-elimination theorems for each logic, the proof of which…
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 an analogue of the fixed-point theorem for the case of definably amenable groups.
Using Sperner's lemma for modified partition of a simplex we will constructively prove the existence of a Nash equilibrium in a finite strategic game with sequentially locally non-constant payoff functions. We follow the Bishop style…
We study a model of two-player, zero-sum, stopping games with asymmetric information. We assume that the payoff depends on two continuous-time Markov chains (X, Y), where X is only observed by player 1 and Y only by player 2, implying that…
The problem of computing a common point that lies in the intersection of a finite number of closed convex sets, each known to one agent in a network, is studied. This issue, known as the distributed convex feasibility problem or the…
We consider the relation between Sion's minimax theorem for a continuous function and a Nash equilibrium in a five-players game with two groups which is zero-sum and symmetric in each group. We will show the following results. 1. The…
In this paper, we introduce a new type of Darbo's fixed point theorem by using concept of function sequences with shifting distance property. Afterward, we investigate existence of fixed point under this the theorem. Also we are going to…
We study the extent to which it is possible to approximate the optimal value of a Unique Games instance in Fixed-Point Logic with Counting (FPC). Formally, we prove lower bounds against the accuracy of FPC-interpretations that map Unique…
We consider the relation between Sion's minimax theorem for a continuous function and a Nash equilibrium in a multi-players game with two groups which is zero-sum and symmetric in each group. We will show the following results. 1. The…
Allegedly, Brouwer discovered his famous fixed point theorem while stirring a cup of coffee and noticing that there is always at least one point in the liquid that does not move. In this paper, based on a talk in honour of Brouwer at the…