Related papers: The Chaos Game on a General Iterated Function Syst…
In this paper we prove a generalization of Istr\u{a}\c{t}escu's theorem for convex contractions. More precisely, we introduce the concept of iterated function system consisting of convex contractions and prove the existence and uniqueness…
We study contraction conditions for an iterated function system of continuous maps on a metric space which are chosen randomly, identically and independently. We investigate metric changes, preserving the topological structure of the space,…
The exponential ordering is exploited in the context of non-auto\-no\-mous delay systems, inducing monotone skew-product semiflows under less restrictive conditions than usual. Some dynamical concepts linked to the order, such as…
The fluctuation theorem characterizes the distribution of the dissipation in nonequilibrium systems and proves that the average dissipation will be positive. For a large system with no external source of fluctuation, fluctuations in…
Motivated by the scarcity of accurate payoff feedback in practical applications of game theory, we examine a class of learning dynamics where players adjust their choices based on past payoff observations that are subject to noise and…
The concept of intransitiveness for games, which is the condition for which there is no first-player winning strategy can arise surprisingly, as happens in the Penney game, an extension of the heads or tails. Since a game can be converted…
Stimulated by recent problems in the theory of iterated function systems, we provide a variant of the Banach converse theorem for multivalued maps. In particular, we show that attractors of continuous multivalued maps in a metric space are…
A class of discrete Bidding Combinatorial Games that generalize alternating normal play was introduced by Kant, Larsson, Rai, and Upasany (2022). The major questions concerning optimal outcomes were resolved. By generalizing standard game…
Game theory is used by all behavioral sciences, but its development has long centered around tools for relatively simple games and toy systems, such as the economic interpretation of equilibrium outcomes. Our contribution, compositional…
In some maps the existence of an attractor with a positive Lyapunov exponent can be proved by constructing a trapping region in phase space and an invariant expanding cone in tangent space. If this approach fails it may be possible to adapt…
Games have a long history as benchmarks for progress in artificial intelligence. Approaches using search and learning produced strong performance across many perfect information games, and approaches using game-theoretic reasoning and…
A solution concept that is a refinement of Nash equilibria selects for each finite game a nonempty collection of closed and connected subsets of Nash equilibria as solutions. We impose three axioms for such solution concepts. The axiom of…
Routing games are amongst the most studied classes of games. Their two most well-known properties are that learning dynamics converge to equilibria and that all equilibria are approximately optimal. In this work, we perform a stress test…
This paper investigates the discrete-time asynchronous games in which noncooperative agents seek to minimize their individual cost functions. Building on the assumption of partial asynchronism, i.e., each agent updates at least once within…
Chaotic itinerancy is a universal dynamical concept that describes itinerant motion among many different ordered states through chaotic transition in dynamical systems. Unlike the expectation of the prevalence of chaotic itinerancy in…
We prove the holding of chaos in the sense of Li-Yorke for a family of four-dimensional discrete dynamical systems that are naturally associated to ODE systems describing coupled oscillators subject to an external non-conservative force,…
We consider a matching problem, which is meaningful in team competitions, as well as in information theory, recommender systems, and assignment problems. In the competitions which we study, each competitor in a team order plays a match with…
We investigate multi-round team competitions between two teams, where each team selects one of its players simultaneously in each round and each player can play at most once. The competition defines an extensive-form game with perfect…
Motivated by applications in optics and acoustics we develop a dynamical-system approach to describe absorption in chaotic systems. We introduce an operator formalism from which we obtain (i) a general formula for the escape rate $\kappa$…
We introduce the notions of weakly *-concave and weakly naturally quasi-concave correspondence and prove fixed point theorems and continuous selection theorems for these kind of correspondences. As applications in the game theory, by using…