English
Related papers

Related papers: Infinite asymptotic games

200 papers

This paper investigates the asymptotic behaviour of solutions to certain infinite systems of ordinary differential equations. In particular, we use results from ergodic theory and the asymptotic theory of $C_0$-semigroups to obtain a…

Functional Analysis · Mathematics 2019-02-14 Lassi Paunonen , David Seifert

Prisoner's Dilemma (PD) is a widely studied game that plays an important role in Game Theory. This paper aims at extending PD Tournaments to the case of infinite, finite or infinitesimal payoffs using Sergeyev's Infinity Computing (IC). By…

Computer Science and Game Theory · Computer Science 2020-02-18 Lorenzo Fiaschi , Marco Cococcioni

Two-player win/lose games of infinite duration are involved in several disciplines including computer science and logic. If such a game has deterministic winning strategies, one may ask how simple such strategies can get. The answer may…

Computer Science and Game Theory · Computer Science 2020-02-04 Stéphane Le Roux

We consider infinite-state turn-based stochastic games of two players, Box and Diamond, who aim at maximizing and minimizing the expected total reward accumulated along a run, respectively. Since the total accumulated reward is unbounded,…

Computer Science and Game Theory · Computer Science 2012-08-09 Tomáš Brázdil , Antonín Kučera , Petr Novotný

In this paper we introduce polytopal stochastic games, an extension of two-player, zero-sum, turn-based stochastic games, in which we may have uncertainty over the transition probabilities. In these games the uncertainty over the…

Logic in Computer Science · Computer Science 2025-02-26 Pablo F. Castro , Pedro D'Argenio

We study first-order as well as infinitary logics extended with quantifiers closed upwards under embeddings. In particular, we show that if a chain of quasi-homogeneous structures is sufficiently long then a given formula of such a logic is…

Logic · Mathematics 2014-07-04 Jevgeni Haigora , Kerkko Luosto

The famous theorem of R.Aumann and M.Maschler states that the sequence of values of an N-stage zero-sum game G_N with incomplete information on one side converges as N tends to infinity, and the error term is bounded by a constant divided…

Computer Science and Game Theory · Computer Science 2013-12-30 Fedor Sandomirskiy

We prove that the determinacy of Gale-Stewart games whose winning sets are infinitary rational relations accepted by 2-tape B\"uchi automata is equivalent to the determinacy of (effective) analytic Gale-Stewart games which is known to be a…

Logic in Computer Science · Computer Science 2013-12-16 Olivier Finkel

We consider a dynamical approach to sequential games. By restricting the convertibility relation over strategy profiles, we obtain a semi-potential (in the sense of Kukushkin), and we show that in finite games the corresponding restriction…

Computer Science and Game Theory · Computer Science 2016-09-15 Stéphane Le Roux , Arno Pauly

Mean-field game theory relies on approximating games that are intractable to model due to a very large to infinite population of players. While these kinds of games can be solved analytically via the associated system of partial…

Machine Learning · Computer Science 2026-04-16 Anna C. M. Thöni , Yoram Bachrach , Tal Kachman

In many multiagent environments, a designer has some, but limited control over the game being played. In this paper, we formalize this by considering incompletely specified games, in which some entries of the payoff matrices can be chosen…

Computer Science and Game Theory · Computer Science 2021-04-30 Markus Brill , Rupert Freeman , Vincent Conitzer

We study a class of semilinear impulsive differential inclusions with infinite delay in Banach spaces. The model incorporates multivalued nonlinearities, impulsive effects, and infinite memory, allowing for the description of systems…

Optimization and Control · Mathematics 2025-12-25 Irene Benedetti , Paola Rubbioni

Mean field games are studied by means of the weak formulation of stochastic optimal control. This approach allows the mean field interactions to enter through both state and control processes and take a form which is general enough to…

Probability · Mathematics 2015-04-09 Rene Carmona , Daniel Lacker

Candogan et al. (2011) provide an orthogonal direct-sum decomposition of finite games into potential, harmonic and nonstrategic components. In this paper we study the issue of decomposing games that are strategically equivalent from a…

Computer Science and Game Theory · Computer Science 2020-04-01 Joseph Abdou , Nikolaos Pnevmatikos , Marco Scarsini , Xavier Venel

After defining a pure-action profile in a nonatomic aggregative game, where players have specific compact convex pure-action sets and nonsmooth convex cost functions, as a square-integrable function, we characterize a Wardrop equilibrium as…

Computer Science and Game Theory · Computer Science 2018-06-19 Paulin Jacquot , Cheng Wan

We provide bounds on the upper box-counting dimension of negatively invariant subsets of Banach spaces, a problem that is easily reduced to covering the image of the unit ball under a linear map by a collection of balls of smaller radius.…

Analysis of PDEs · Mathematics 2010-07-28 Alexandre N Carvalho , José A Langa , James C Robinson

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…

Logic · Mathematics 2017-12-05 Logan Crone , Lior Fishman , Stephen Jackson

We consider mean field games with discrete state spaces (called discrete mean field games in the following) and we analyze these games in continuous and discrete time, over finite as well as infinite time horizons. We prove the existence of…

Optimization and Control · Mathematics 2019-09-04 Josu Doncel , Nicolas Gast , Bruno Gaujal

We study strategic interaction in data-driven games where players face uncertainty about payoff distributions inferred from finite samples. To model calibrated attitudes toward such uncertainty, we formulate distributionally robust games…

Computer Science and Game Theory · Computer Science 2026-05-28 Bharat Gangwani , Arunesh Sinha

Given a countable discrete amenable group, we study conditions under which a set map into a Banach space (or more generally, a complete semi-normed space) can be realized as the ergodic sum of a vector under a group representation, such…

Dynamical Systems · Mathematics 2025-09-03 Raimundo Briceño , Godofredo Iommi
‹ Prev 1 4 5 6 7 8 10 Next ›