中文
相关论文

相关论文: Infinite asymptotic games

200 篇论文

We continue the investigation of finite-duration variants of infinite-duration games by extending known results for games played on finite graphs to those played on infinite ones. In particular, we establish an equivalence between pushdown…

计算机科学与博弈论 · 计算机科学 2012-10-10 Wladimir Fridman , Martin Zimmermann

We study the analyticity of bounded solutions of systems of analytic state-dependent delay differential equations. We obtain the analyticity of solutions by transforming the system of state-dependent delay equations into an abstract…

动力系统 · 数学 2017-08-29 Qingwen Hu

We develop asymptotic approximations that can be applied to sequential estimation and inference problems, adaptive randomized controlled trials, and related settings. In batched adaptive settings where the decision at one stage can affect…

计量经济学 · 经济学 2025-02-25 Keisuke Hirano , Jack R. Porter

Freidlin and Wentzell characterized the logarithmic asymptotics of the exit time from a basin of attraction for a finite dimensional diffusion with small noise. After that, several authors studied the same properties for exit problems…

概率论 · 数学 2015-05-13 Michael Salins

We study a class of stochastic dynamic games that exhibit strategic complementarities between players; formally, in the games we consider, the payoff of a player has increasing differences between her own state and the empirical…

计算机科学与博弈论 · 计算机科学 2010-12-13 Sachin Adlakha , Ramesh Johari

Escalation is a typical feature of infinite games. Therefore tools conceived for studying infinite mathematical structures, namely those deriving from coinduction are essential. Here we use coinduction, or backward coinduction (to show its…

计算机科学与博弈论 · 计算机科学 2010-04-30 Pierre Lescanne , Perrinel Matthieu

Escalation is a typical feature of infinite games. Therefore tools conceived for studying infinite mathematical structures, namely those deriving from coinduction are essential. Here we use coinduction, or backward coinduction (to show its…

计算机科学与博弈论 · 计算机科学 2011-12-16 Pierre Lescanne , Perrinel Matthieu

Establishing the existence of Nash equilibria for partially observed stochastic dynamic games is known to be quite challenging, with the difficulties stemming from the noisy nature of the measurements available to individual players…

系统与控制 · 计算机科学 2018-06-06 Naci Saldi , Tamer Basar , Maxim Raginsky

In this paper, we use a Banach fixed point theorem to obtain suficient conditions satisfying the convergence and exponential convergence of solutions for the linear system of advanced differential equations. The considered system with…

经典分析与常微分方程 · 数学 2020-06-25 Mouataz Billah Mesmouli

We study two-player games of infinite duration that are played on finite or infinite game graphs. A winning strategy for such a game is positional if it only depends on the current position, and not on the history of the play. A game is…

计算机科学中的逻辑 · 计算机科学 2017-01-11 Erich Graedel , Igor Walukiewicz

We develop new techniques for computing the metric entropy of ellipsoids -- with polynomially decaying semi-axes -- in Banach spaces. Besides leading to a unified and comprehensive framework, these tools deliver numerous novel results as…

泛函分析 · 数学 2026-03-26 Thomas Allard , Helmut Bölcskei

We develop a probabilistic approach to continuous-time finite state mean field games. Based on an alternative description of continuous-time Markov chain by means of semimartingale and the weak formulation of stochastic optimal control, our…

概率论 · 数学 2018-08-24 Rene Carmona , Peiqi Wang

We study games with finitely many participants, each having finitely many choices. We consider the following categories of participants: (I) populations: sets of nonatomic agents, (II) atomic splittable players, (III) atomic non splittable…

最优化与控制 · 数学 2015-10-22 Sylvain Sorin , Cheng Wan

We consider two-player partial-observation stochastic games on finite-state graphs where player 1 has partial observation and player 2 has perfect observation. The winning condition we study are \omega-regular conditions specified as parity…

计算机科学中的逻辑 · 计算机科学 2014-01-15 Krishnendu Chatterjee , Laurent Doyen , Sumit Nain , Moshe Y. Vardi

Graphon games are a class of games with a continuum of agents, introduced to approximate the strategic interactions in large network games. The first result of this study is an equilibrium existence theorem in graphon games, under the same…

理论经济学 · 经济学 2025-04-03 Motoki Otsuka

We consider 2-player games played on a finite state space for infinite rounds. The games are concurrent: in each round, the two players choose their moves simultaneously; the current state and the moves determine the successor. We consider…

计算机科学与博弈论 · 计算机科学 2013-06-21 Krishnendu Chatterjee

Games with incomplete preferences are an important model for studying rational decision-making in scenarios where players face incomplete information about their preferences and must contend with incomparable outcomes. We study the problem…

计算机科学与博弈论 · 计算机科学 2024-08-13 Abhishek N. Kulkarni , Jie Fu , Ufuk Topcu

We study the asymptotic value of a frequency-dependent zero-sum game with separable payoff following a differential approach. The stage payoffs in such games depend on the current actions and on a linear function of the frequency of actions…

最优化与控制 · 数学 2019-01-23 Joseph Abdou , Nikolaos Pnevmatikos

We study the effectiveness of iterated elimination of strictly-dominated actions in random games. We show that dominance solvability of games is vanishingly small as the number of at least one player's actions grows. Furthermore,…

理论经济学 · 经济学 2021-05-25 Noga Alon , Kirill Rudov , Leeat Yariv

We study two-player games of infinite duration that are played on finite or infinite game graphs. A winning strategy for such a game is positional if it only depends on the current position, and not on the history of the play. A game is…

计算机科学中的逻辑 · 计算机科学 2012-08-29 Erich Graedel , Igor Walukiewicz